Answer to Question #9489 in Discrete Mathematics for Ashok

Question #9489

If the sum of divisors of n, that is (n) is equal to 2n, then n is called a perfect number.
Show that if n is an odd perfect number then n has at least three different prime
divisors.

Expert's answer

Answer in progress...

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. Let E = {2, 4, 6, …}. Then prove that (E, +) is a semigroup, where + is usual addition.
2. Prove by principle of Mathematical induction that sum of squares of first n natural number is {
3. If A is the set of triangles in a plane then prove that the relation R defined by “a is similar
4. Find the edge chromatic number of Kn, where n is a positive integer.
5. How many nonisothropic spanning trees does each of these simple graphs have? a. K3
6. Situation:A researcher is interested in whether students who attend private high schools have higher
7. What is the number of edges in a K^n?