Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Rotationally Prime Numbers Revisited

by 5mi11er (Deacon)
on Mar 24, 2005 at 22:22 UTC ( [id://442213]=note: print w/replies, xml ) Need Help??


in reply to Rotationally Prime Numbers Revisited

I was going to say that proving a "negative statement", is logically impossible...

However, this is mathematics, so perhaps the "I can't prove I don't have something, you have to prove I do" isn't quite as solid in the world of mathematics? I'm pretty sure reading through some of the recent mathematical threads I've seen some "proofs" that showed that certain things are not possible.

But, I could simply be remembering "conjectures" and the like as "proofs", and thus, the original line above might still be correct?

-Scott

  • Comment on Re: Rotationally Prime Numbers Revisited

Replies are listed 'Best First'.
Re^2: Rotationally Prime Numbers Revisited
by shemp (Deacon) on Mar 25, 2005 at 00:58 UTC
    It is perfectly valid in math to prove that something does not exist. 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.

    Now there are also a different class of assertions that cannot be proved either way. (Godels Incompleteness Theorem)
    I am digressing a lot here, but if you find this sort of thing interesting, i suggest reading 'Godel, Escher, Bach' by Hofsteadter (spelling?)
    ...prepare to hurt your brain :)

      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

        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://442213]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (7)
As of 2024-04-19 07:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found