Daffodil International University
Science & Information Technology => Science Discussion Forum => Topic started by: jas_fluidm on March 05, 2012, 03:23:41 PM
-
Over 2300 years ago Euclid proved that If 2^(k)-1 is a prime number (it would be a Mersenne prime), then 2^(k-1)(2^(k)-1) is a perfect number. A few hundred years ago Euler proved the converse (that every even perfect number has this form). It is still unknown if there are any odd perfect numbers (but if there are, they are large and have many prime factors).
-
All even perfect numbers are a power of two times a Mersenne prime.
-
Nice post.