3 9 + 3 1 2 + 3 1 5 + 3 n
Find the minimum possible value of positive integer n such that the expression above is a perfect cube.
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.
3 9 + 3 1 2 + 3 1 5 = 3 9 ( 1 + 2 7 + 7 2 9 ) = 3 9 ⋅ 7 5 7 . The closest cubes are 9 3 = 7 2 9 , and 1 0 3 = 1 0 0 0 . Since 1 0 0 0 − 7 5 7 = 2 4 3 = 3 5 , n = 9 + 5 = 1 4 .
Otto Bretscher is right, you need to prove that n < 9 has no solution.
I only understood after a while. I think you could rephrase it and explain better.
You seem to assume that n ≥ 9 .
I used the similar process to solve 2 more questions like this, n i think it is simplest approach.;
This solution is based on the flawed assumption that the four terms of 3 9 + 3 1 2 + 3 1 5 + 3 n must match the four terms of the binomial expansion of ( a + b ) 3 . Considering these six cases does not prove that 3 9 + 3 1 2 + 3 1 5 + 3 n fails to be a perfect cube for n < 1 4 .
The first thing I noticed was that 3 n will be odd for any positive integer n so the sum of 4 of these must be even. As the number is a cube, it must be the product of cube primes. As 2 divides this number, 8 must divide it too. Also, it is the sum of multiples of 3 so the final number must be divisible by 3 cubed or 27. As the terms are multiples of 27, 3 n must be too so n ≥ 3
In order for the number to be a multiple of 8, consideration is needed for the terms mod 8. 3 9 ≡ 3 m o d 8 3 1 2 ≡ 1 m o d 8 3 1 5 ≡ 3 m o d 8 ⟹ 3 n ≡ 1 m o d 8 Which shows that n has to be even.
At this point. I started getting lazy so I made a program in VB.net that generates these numbers and I put in that n has to be even as to save time. Luckily, I was able to find n = 1 4 . Sorry about the anticlimactic ending :(.
Problem Loading...
Note Loading...
Set Loading...
Case 1: n < 9
First we show that 3 9 + 3 1 2 + 3 1 5 + 3 n fails to be a perfect cube if n < 9 . Using the binomial expansion, we see that ( 3 5 + 3 ) 3 < 3 9 + 3 1 2 + 3 1 5 + 3 n < ( 3 5 + 4 ) 3 for all n < 9 . Thus 3 9 + 3 1 2 + 3 1 5 + 3 n is "trapped" between two consecutive perfect cubes, 2 4 6 3 and 2 4 7 3 .
Case 2: n ≥ 9
We observe that 3 9 + 3 1 2 + 3 1 5 + 3 n = 3 9 ( 1 + 3 3 + 3 6 + 3 n − 9 ) = 2 7 3 ( 7 5 7 + 3 n − 9 ) . We want 7 5 7 + 3 n − 9 to be a perfect cube. Now the smallest perfect cube exceeding 7 5 7 is 1 0 0 0 , and it so happens that 1 0 0 0 − 7 5 7 = 2 4 3 = 3 5 . Thus 3 9 ( 1 + 3 3 + 3 6 + 3 5 ) = 3 9 + 3 1 2 + 3 1 5 + 3 1 4 = 2 7 0 3 .
The answer is n = 1 4 .