Re: FLT an incurable, unending addiction


Peter Allen wrote:
> fermat wrote:

> If by 'the first case' you mean e.g. n=3 or n=4 case,

No. First case requires x,y,x coprime to the exponent.

The first case had been fully proved up to 10^17 or so via
extensions of the Miramanoff & Wieferich criteria even before Wiles'
proof.
(by A. Granville et.al)

.

Relevant Pages

  • Re: Nonrenormalization vs Renormalization 83.4: The Riccati "Creation Operator" Equation
    ... Notice that the Riccati Differential equation is one of the very few ... exponent higher in the same scenarios), which in turn ties in with my ... Fermat of 1600s France during ... Descartes in optics to the extent that Descartes had to twice apologize ...
    (sci.physics)
  • Re: fermats last theorem
    ... to prove odd exponent (so that includes those even with an odd factor - yes ... advanced mathematics than maybe Fermat had access to, ... I'd still err on the side of Fermat possessing a flawed, odd exponent proof, ...
    (sci.math)
  • Re: Numbers in array and its exponents ( congruence operation )
    ... the operation is multiplication and not exponent! ... If the number I chose is coprime with n (2 and 5 are coprime in my ... Since by assumption a and b are different, (a-b) is not 0; ... But since k is coprime to n, the /least/ common multiple of k and n is ...
    (sci.math)
  • Re: is it sufficient to solve factoring problem
    ... Christian Siebert wrote: ... exponent 'e' which is coprime to 'phi', ... The OP posited only a "secret exponent d, of RSA ...
    (sci.crypt)
Loading