Date: Nov 28, 2012 2:46 AM Author: quasi Subject: Re: From Fermat little theorem to Fermat Last Theorem John Jens wrote:
>If a > c and/or b > c it's obvious that a^p + b^p > c^p.
I made it very clear in my prior replies that it's fine to
assume 0 < a <= b < c, so your statement above is totally
>We can choose z ,y ,z > p , x <= y < z and using
>modulus properties a ,b ,c, a <= b < c , a < p
You _can_ assume 0 < a <= b < c, but you _can't_ justify
the inequality a < p.