Define a primitive inverse-cubed triplet as any ordered triplet ( x , y , z ) , where x , y , z ∈ Z + and g cd ( x , y , z ) = 1 , such that
x 3 1 + y 3 1 = z 3 1 .
How many ordered triplets ( x , y , z ) exist that are primitive inverse-cubed triplets?
If you enjoyed this problem, you might also want to check out this and this problem .
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.
( y z ) 3 + ( x z ) 3 = ( x y ) 3 ,because there doesn't exist a triplet ( a , b , c ) that satisfy a 3 + b 3 = c 3 ,so there is no ( x , y , z ) exist
Problem Loading...
Note Loading...
Set Loading...
x 3 1 + y 3 1 ( y z ) 3 + ( x z ) 3 = z 3 1 = ( x y ) 3
By Fermat's Last Theorem, the only solution occurs when x 2 y 2 z 2 = 0 . Thus, no solution exists.
Bonus
What about x 3 1 + y 3 1 + z 3 1 = w 3 1 ? Does the same result still apply?