FLT case 1

Consider the following descent proof outline:

1. Assume there exists a "smallest" solution satisfying the FLT problem
for any given prime exponent p and positive integers a,b,c.

i.e., that c^p = a^p + b^p (abc,p) =1

Note: These solution values would also satisfy the congruence c^p ==
a^p + b^p (modp^2)

2. Suppose one could then show (as a contradiction) that a smaller such
"congruence" solution must also exist:

i.e. such that c'^p == a'^p + b'^p mod p^2, for values c'<c, a'<a, b'<b

Would this be a valid proof of FLT by contradiction?

.

Relevant Pages

  • Re: FLT case 1
    ... > Consider the following descent proof outline: ... Assume there exists a "smallest" solution satisfying the FLT problem ... Suppose one could then show (as a contradiction) that a smaller such ...
    (sci.math)
  • Re: FLT case 1
    ... >Consider the following descent proof outline: ... Assume there exists a "smallest" solution satisfying the FLT problem ... Suppose one could then show (as a contradiction) that a smaller such ... doesn't imply that it's the smallest solution of the congruence. ...
    (sci.math)