I was wondering if anybody knew a way to show that the Diophantine equation given by:
$a^3 + b^3 + c^3 - 3abc =1$
Only has solutions $(1,0,0)$, $(0,1,0)$, and $(0,0,1)$.
The only idea I have had is to consider it modulo $3$, in which case $a^3 =a$ (Fermat's Little Theorem). So then
$a+b+c=1 ($mod $3)$.
But this didn't prove to be very helpful.
Edit: For those interested, this shows that the permutation matrix given by
$P =\left( \begin{matrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \end{matrix} \right)$
Does not commute with any $3 \times 3$ matrices which have determinant $1$ and integer entries. The equation $$PA = AP$$ implies that $A= \left( \begin{matrix} a & b & c \\ c & a & b \\ b & c & a \end{matrix} \right),$ and so the determinant equation is $a^3 + b^3 + c^3 -3abc =1$.