SOLUTION: prove that a perfact number can be written as a sum of (2^n)-1 consicutine numbers for some n.
Algebra
->
Number-Line
-> SOLUTION: prove that a perfact number can be written as a sum of (2^n)-1 consicutine numbers for some n.
Log On
Algebra: Number Line
Section
Solvers
Solvers
Lessons
Lessons
Answers archive
Answers
Click here to see ALL problems on Number-Line
Question 475361
:
prove that a perfact number can be written as a sum of (2^n)-1 consicutine numbers for some n.
Answer by
richard1234(7193)
(
Show Source
):
You can
put this solution on YOUR website!
First, we have to assume that all perfect numbers N can be written as
for positive integer k.
Let m, m+1, ..., (m+2^n)-2 be the (2^n) - 1 consecutive numbers, in which their sum is
We want to show that all perfect numbers N can be expressed in this form. However, if we set m = 1 the solution becomes trivial.
Alternatively, we can let
in which N becomes the sum of the first (2^k) - 1 integers.