Yeah, I'm just not sure how (if it can be) to go about showing that. I'm trying to prove that the first and second terms can't both be equal to cubed integers at the same time. But I am not sure how to set up or solve a proof of that. I'd assume modus tolens of some kind but don't really know
Okay, so I'm trying to figure something out.
Why can (x+y)=integer^3 not be true while
(x^2-x*y+y^2)=integer^3 is true?
where x and y are also integers. The integer to the right is just an undefined integer.
I'm trying to prove Fermat's last theorem x^n+y^n=z^n for n=3.
I was able to...