SOLUTION: if 2^k-1 is a prime number,then show that 2^(k-1).(2^k-1)is a perfect number.
Algebra
->
Numeric Fractions Calculators, Lesson and Practice
-> SOLUTION: if 2^k-1 is a prime number,then show that 2^(k-1).(2^k-1)is a perfect number.
Log On
Algebra: Numeric Fractions
Section
Solvers
Solvers
Lessons
Lessons
Answers archive
Answers
Click here to see ALL problems on Numeric Fractions
Question 475362
:
if 2^k-1 is a prime number,then show that 2^(k-1).(2^k-1)is a perfect number.
Answer by
richard1234(7193)
(
Show Source
):
You can
put this solution on YOUR website!
Let
denote the sum of factors of x. Since 2^k - 1 is prime, then
Also,
The sigma function is multiplicative, so
, hence it is a perfect number.