I got given a problem which was:
For , find the possible integer values of .
My proof is as follows:
Say that and .
This means that a and b are either 1 or -1. The different combinations inputted into then show that the only two possible values are 2 and -2.
I'm just not sure about how rigid this proof is.
Thanks for any help.