Date: Nov 28, 2012 10:56 AM Author: gus gassmann Subject: Re: From Fermat little theorem to Fermat Last Theorem On 28/11/2012 11:19 AM, John Jens wrote:
> If x>p ,x = a + mp , m, natural
> (a + mp)^p?(a + mp)(mod p)=a + mp + kp=a + p(m+k)...
How does any of your stuff work when p = 2? It is simply not sufficient
to claim that a must be less than 2, i.e., equal to 1.