Find the number of ordered triples of integers that satisfy the equation
Details and assumptions
The order matters: and are considered different solutions.
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.
Note that permuting any two of the numbers a , b , c changes the sign of the polynomial a ( b − c ) 3 + b ( c − a ) 3 + c ( a − b ) 3 . In particular, if a = b , then this expression is zero. This suggests that this polynomial is divisible by a − b and, similarly, a − c and b − c . Indeed, the following beautiful identity is true: a ( b − c ) 3 + b ( c − a ) 3 + c ( a − b ) 3 = ( a − b ) ( b − c ) ( c − a ) ( a + b + c ) Note that permuting the three numbers a , b , c , cyclically and/or simultaneously changing their signs does not change the value of this expression. Using these transformations, we can change any triple ( a , b , c ) we are looking for into a triple for which a + b + c > 0 and a is the smallest of the numbers a , b , c . Because a − b < 0 , c − a > 0 and 2 7 6 0 > 0 , this implies that b − c < 0 . Therefore a < b < c . Note that a and/or b may be negative, as long as a + b + c > 0 . Each such triple will produce 6 solutions by cyclic permutations and sign changes: ( a , b , c , ) , ( c , a , b ) , ( b , c , a ) , ( − a , − b , − c ) , ( − c , − a , − b ) , ( − b , − c , − a ) Clearly, all solutions are obtained in this manner, and they are distinct, because no two of the numbers a , b , c are equal.
Suppose b − a = x , c − b = y , c − a = z . Then all these numbers are positive, z = x + y , and x y z ∣ 2 7 6 0 = 2 3 ⋅ 3 ⋅ 5 ⋅ 2 3 . The number 2 7 6 0 has 3 2 divisors, listed below in the increasing order: 1 , 2 , 3 , 4 , 5 , 6 , 8 , 1 0 , 1 2 , 1 5 , 2 0 , 2 3 , 2 4 , 3 0 , 4 0 , 4 6 , 6 0 , 6 9 , 9 2 , 1 1 5 , 1 2 0 , 1 3 8 , 1 8 4 , 2 3 0 , 2 7 6 , 3 4 5 , 4 6 0 , 5 5 2 , 6 9 0 , 9 2 0 , 1 3 8 0 , 2 7 6 0
For the purpose of finding these x , y , z , we can freely switch x and y . So suppose x ≤ y . Then, because 2 7 6 0 = x y z ≥ x ⋅ x ⋅ ( 2 x ) , we get x ≤ 3 1 3 8 0 , so x ≤ 1 0 . We consider several cases, depending on what x can be.
Case 1. x = 1 . Then y and z must be consecutive divisors of 2 7 6 0 . We have six such triples ( x , y , z ) with x ≤ y : ( 1 , 1 , 2 ) , ( 1 , 2 , 3 ) , ( 1 , 3 , 4 ) , ( 1 , 4 , 5 ) , ( 1 , 5 , 6 ) , ( 1 , 2 3 , 2 4 ) .
Case 2. x = 2 . Then y cannot be even, otherwise z is also even and either y or z is divisible by 4 . This would makes x y z divisible by 2 4 , which is impossible since x y z divides 2 7 6 0 . This greatly reduces the number of y to consider, and we get one triple: ( 2 , 3 , 5 ) .
Case 3. x = 3 . Then y is not divisible by 3 and y z ∣ 9 2 0 , so y ≤ 3 0 . We get the following triples: ( 3 , 5 , 8 ) , ( 3 , 2 0 , 2 3 ) .
Case 4. x = 4 . Then y must be odd, and y z ∣ 6 9 0 , so y ≤ 2 3 . There are no solutions in this case.
Case 5. x = 5 . Then y is not divisible by 5 , and y z ∣ 5 5 2 , so y ≤ 1 2 . There are no solutions in this case.
Case 6. x = 6 . Like in Case 2, y is odd and so is z . So y z ∣ 1 1 5 , there are no solutions in this case.
Case 7. x = 8 . Then y is odd and y z ∣ 3 4 5 , so y ≤ 1 5 . We get one triple: ( 8 , 1 5 , 2 3 ) .
Case 8. x = 1 0 . Then y is odd and y ≤ 2 7 6 , there are no solutions in this case.
Case 9. x = 1 2 . Then y is odd and y ≤ 2 3 0 , there are no solutions in this case.
All together, we get the following ten choices for ( x , y , z ) , up to switching x and y : ( 1 , 1 , 2 ) , ( 1 , 2 , 3 ) , ( 1 , 3 , 4 ) , ( 1 , 4 , 5 ) , ( 1 , 5 , 6 ) , ( 1 , 2 3 , 2 4 ) , ( 2 , 3 , 5 ) , ( 3 , 5 , 8 ) , ( 3 , 2 0 , 2 3 ) , ( 8 , 1 5 , 2 3 )
We consider these cases separately. Most of them are similar, with the notable exceptions of ( 1 , 1 , 2 ) and ( 1 , 4 , 5 ) .
If ( x , y , z ) = ( 1 , 1 , 2 ) , then for some integer k we must have a = k − 1 , b = k , c = k + 1 . The sum a + b + c equals 2 7 6 0 / ( x y z ) = 1 3 8 0 . This implies k = 4 6 0 , so we get a triple ( a , b , c ) = ( 4 5 9 , 4 6 0 , 4 6 1 ) .
If ( x , y , z ) = ( 1 , 2 , 3 ) or ( x , y , z ) = ( 2 , 1 , 3 ) then for some k ( a , b , c ) = ( k − 1 , k , k + 2 ) or ( a , b , c ) = ( k − 2 , k , k + 1 ) . In both cases the sum must equal 2 7 6 0 / 6 = 4 6 0 . Because 4 6 0 ≡ 1 ( m o d 3 ) , in order for the number k to be integer we must have ( a , b , c ) = ( k − 1 , k , k + 2 ) . This gives k = 1 5 3 and a triple ( 1 5 2 , 1 5 3 , 1 5 5 ) .
Similarly to the last case, for each of the remaining triples except ( 1 , 4 , 5 ) , exactly one of the two possibilities works modulo 3 , and we get the following triples ( a , b , c ) :
If ( x , y , z ) = ( 1 , 3 , 4 ) , then ( a , b , c ) = ( 7 5 , 7 6 , 7 9 ) .
If ( x , y , z ) = ( 5 , 1 , 6 ) , then ( a , b , c ) = ( 2 7 , 3 2 , 3 3 ) .
If ( x , y , z ) = ( 2 3 , 1 , 2 4 ) , then ( a , b , c ) = ( 2 7 , 3 2 , 3 3 ) .
If ( x , y , z ) = ( 3 , 2 , 5 ) , then ( a , b , c ) = ( 2 8 , 3 1 , 3 3 ) .
If ( x , y , z ) = ( 3 , 5 , 8 ) , then ( a , b , c ) = ( 4 , 7 , 1 2 ) .
If ( x , y , z ) = ( 3 , 2 0 , 2 3 ) , then ( a , b , c ) = ( − 8 , − 5 , 1 5 ) .
If ( x , y , z ) = ( 8 , 1 5 , 2 3 ) , then ( a , b , c ) = ( − 1 0 , − 2 , 1 3 ) .
The case ( 1 , 4 , 5 ) is slightly different, because both ( 1 , 4 , 5 ) and ( 4 , 1 , 5 ) are possible, producing triples ( 4 4 , 4 5 , 4 9 ) and ( 4 3 , 4 7 , 4 8 ) . (What made this case different is that neither of the numbers x , y , z is divisible by 3 ).
Putting it all together, we have got 1 1 triples, and each of them gives 6 solutions by cyclic permutation and sign changes. So the answer is 6 6 .