Find the integer triples satisfying the equation above. Give your answer as the sum of every possible value of .
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.
We see that the trivial solution is ( a , b , c ) = ( 0 , 0 , 0 ) . If two of a , b , c are zero, it implies that the another one must be zero as well. If one of a , b , c is zero, there will be no integral solution but all zero, since 3 3 , 3 5 , 3 3 5 are not rational. Therefore, it is left to find solution that none of a , b , c is zero.
Because this equation is homogeneous (of order 3 ), we assume that g cd ( a , b , c ) = 1 . Notice that 5 ∣ a , so we let a = 5 x , and get the new (reduced) equation 7 5 x 3 + b 3 + 3 c 3 = 4 5 x b c . Again, we see that 3 ∣ b , so we let b = 3 y , and have the new equation 2 5 x 3 + 9 y 3 + c 3 = 4 5 x y c . Take modulo 9 , we have that 7 x 3 + c 3 ≡ 0 ( m o d 9 ) . Since the possible residues of a cube modulo 9 are 0 , 1 , 8 , we write the table of 7 x 3 + c 3 m o d 9 as follow. ( x 3 m o d 9 ) 0 1 8 0 ∣ ∣ 0 ∣ ∣ 7 ∣ ∣ 2 ∣ ∣ ( c 3 m o d 9 ) 1 ∣ ∣ 1 ∣ ∣ 8 ∣ ∣ 3 ∣ ∣ 8 ∣ ∣ 8 ∣ ∣ 6 ∣ ∣ 1 ∣ ∣ We see that the only case that makes 7 x 3 + c 3 ≡ 0 ( m o d 9 ) is that x 3 ≡ 0 ( m o d 9 ) and c 3 ≡ 0 ( m o d 9 ) . Finally, we get that 3 ∣ x and 3 ∣ c . This means that a , b , c are all divisible by 3 , contradicting our assumption that they are relatively prime. Thus, there is no other solution than ( a , b , c ) = ( 0 , 0 , 0 ) , and the answer to this problem is 0 + 0 + 0 = 0 .