Find the smallest positive integer n with n > 2 0 1 7 so that
n 1 3 + 2 3 + 3 3 + . . . + n 3
is an integer.
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.
m = n 1 3 + 2 3 + 3 3 + ⋯ + n 3 = n ( 1 + 2 + 3 + ⋯ + n ) 2 = ( 1 + 2 + 3 + ⋯ + n ) ⋅ n 1 = 2 n n ( n + 1 ) Recall the identity k = 1 ∑ n k 3 = ( k = 1 ∑ n k ) 2
Observe that if n is a square, then n ∣ n , so it follows that n ∣ n ( n + 1 ) . Also notice that 2 ∣ n ( n + 1 ) ∀ n ∈ N : this can be easily proven by induction.
Thus, 2 n n ( n + 1 ) ∈ Z + ⟺ n ∈ Z + .
We can bound the squares > 2 0 1 7 to 1 6 0 0 = 4 0 2 < n 2 < 5 0 2 = 2 5 0 0 . With trial and error, we find that the smallest square > 2 0 1 7 is 4 5 2 = 2 0 2 5 .
N = n 1 3 + 2 3 + 3 3 + ⋯ + n 3 = 4 n n 2 ( n + 1 ) 2 = 2 n ( n + 1 ) Note that k = 1 ∑ n k 3 = ( 2 n ( n + 1 ) ) 2
For N to be an integer, n must be a perfect square. And the smallest perfect square n > 2 0 1 7 is given by n = ⌈ 2 0 1 7 ⌉ 2 = ⌈ 4 4 . 9 1 1 ⌉ 2 = 4 5 2 = 2 0 2 5 . Then N = 2 4 5 ⋅ 2 0 2 6 = 4 5 5 8 5 .
Problem Loading...
Note Loading...
Set Loading...
Sum of third powers: 1 3 + 2 3 + 3 3 + . . . + n 3 = ( 2 n ( n + 1 ) ) 2
n 1 3 + 2 3 + 3 3 + . . . + n 3 = n × 2 n + 1
2 0 1 7 ≈ 4 4 . 9 1
The nearest number above that is 4 5 , which happens to be odd, so that 2 n + 1 is an integer.
So the answer is 4 5 2 = 2 0 2 5