Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re^3: Rotationally Prime Numbers Revisited

by ambrus (Abbot)
on Mar 25, 2005 at 09:27 UTC ( [id://442303]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Rotationally Prime Numbers Revisited
in thread Rotationally Prime Numbers Revisited

For example, there are no positive integers {a,b,c} such that a^3 + b^3 = c^3

This is a direct result of Wiles (1994) proof of Fermats Last Theorem.

No, this case is much easier to prove than the general case, and was proven in the 18th century by Euler and Legendre.

In fact, for all sufficently small n exponents the impossibility of a^n + b^n = c^n was proven long ago, in fact, Szalay[1] which was published in 1991 reports all n < 125000.

[1] Dr. Szalay Mihály, Számelmélet. Tankönyvkiadó, Budapest, 1991

  • Comment on Re^3: Rotationally Prime Numbers Revisited

Replies are listed 'Best First'.
Re^4: Rotationally Prime Numbers Revisited
by tilly (Archbishop) on Mar 25, 2005 at 19:36 UTC
    The fact that there is an easier proof of the special case doesn't change the fact that the special case is a direct result of the general case.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://442303]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others learning in the Monastery: (8)
As of 2024-04-24 10:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found