In December 2017, was proved prime, so according to the Euclid-Euler Theorem , the number must be a perfect number .
is also the sum of the first odd cubes. Find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The sum of the first k cubes 1 3 + 2 3 + 3 3 + ⋯ + k 3 is ( 2 k ( k + 1 ) ) 2 .
The sum of the first k even cubes 2 3 + 4 3 + 6 3 + ⋯ + ( 2 k ) 3 = 2 3 ( 1 3 + 2 3 + 3 3 + ⋯ + k 3 ) is then 2 3 ( 2 k ( k + 1 ) ) 2 = 2 k 2 ( k + 1 ) 2 .
The sum of the first k odd cubes 1 3 + 3 3 + 5 3 + ⋯ + ( 2 k − 1 ) 3 is the sum of the first 2 k cubes ( 1 3 + 2 3 + 3 3 + ⋯ + ( 2 k ) 3 ) minus the sum of the first k even cubes ( 2 3 + 4 3 + 6 3 + ⋯ + ( 2 k ) 3 ), or ( 2 2 k ( 2 k + 1 ) ) 2 − 2 k 2 ( k + 1 ) 2 , which simplifies to k 2 ( 2 k 2 − 1 ) .
The perfect number 2 7 7 2 3 2 9 1 6 ( 2 7 7 2 3 2 9 1 7 − 1 ) is equal to 2 7 7 2 3 2 9 1 6 ( 2 ⋅ 2 7 7 2 3 2 9 1 6 − 1 ) or ( 2 3 8 6 1 6 4 5 8 ) 2 ( 2 ⋅ ( 2 3 8 6 1 6 4 5 8 ) 2 − 1 ) , and so k = 2 3 8 6 1 6 4 5 8 , which means 2 7 7 2 3 2 9 1 6 ( 2 7 7 2 3 2 9 1 7 − 1 ) is the sum of the first 2 3 8 6 1 6 4 5 8 cubes, and therefore n = 3 8 6 1 6 4 5 8 .