Find the set of integers n such that n 6 + 2 4 n 3 + 1 9 2 is a perfect cube. If there are N distinct solutions n 1 , n 2 , … , n N , submit N + j = 1 ∑ N n j .
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.
This is not related to this problem, but I was wondering if you could post a solution to A discrete mathematics problem by Tai Ching Kan , or at least an outline. I've spent a lot of time on it, and I think I'm close, but I can't quite nail it.
Log in to reply
I set it up as a four-dimensional integral, defining a region of [ 0 , 4 3 ] 4 , representing the coordinates ( a , b ) , and ( c , d ) of the opposite corners, so that the other two corners are inside the unit square. I then got bored and let Mathematica work it out! An uninteresting solution, so I did not post anything...
oh yes!!!same solution
I misread the problem and thought that 24 was preceded by both a + and a - sign, and found n = 2 to be a solution. Stupid.
Honestly I was, mistakenly, looking for all solutions for which this expression is not a perfect cube but rather a perfect square . Interesting enough, it gave the same result. Rewritten as ( n 3 + 1 2 ) 2 + 4 8 = M 2 for some integer M , we deduce that the only possibilities are M = ( n 3 + 1 2 ) 2 + 2 , M = ( n 3 + 1 2 ) 2 + 4 , M = ( n 3 + 1 2 ) 2 + 6 , , for which ( n 3 + 1 2 ) = 1 1 , 4 , 1 respectively. The first two give n = − 1 , − 2 , the last one is invalid as -11 isn't a perfect cube (while -1, -8 are).
Thus N = 2 , Σ j = 1 2 n j = − 3 , and the final result is − 1 , too. Weird, isn't it?
Also, following the correct solution for the original problem together with this result, it follows that for n = − 2 the expression is a perfect sixth power , and is the only one. And indeed, it equals 6 4 = 2 6 .
hey!!!!need to get deep in it....niceeee result
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Fermat's Last Theorem
Note first that n = 0 is not a solution. If m , n are integers such that n 6 + 2 4 n 3 + 1 9 2 = m 3 , then n 9 + 2 4 n 6 + 1 9 2 n 3 ( n 3 + 8 ) 3 = ( m n ) 3 = ( m n ) 3 + 8 3 It is well-known that the only solutions in integers of the equation x 3 + y 3 = z 3 occur with one or more of x , y , z being equal to 0 . If m n = 0 then (since n = 0 ), we deduce that m = 0 , and hence ( n 3 + 8 ) 3 = 8 3 , so that n 3 + 8 = 8 , and hence n = 0 . This case is not possible, Thus we must have n 3 + 8 = 0 , so that n = − 2 and hence m = 4 .
There is only one solution: n = − 2 . Thus the answer is 1 + ( − 2 ) = − 1 .