Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: unable to prove?
Replies: 28   Last Post: Sep 18, 2012 3:54 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Luis A. Rodriguez

Posts: 731
Registered: 12/13/04
Re: unable to prove?
Posted: Sep 6, 2012 11:41 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Friday, August 24, 2012 12:58:24 PM UTC-4, TS742 wrote:
> Are some hypotheses unprovable? Or do they all have a proof that is
>
> just not found yet? The Riemann hypothesis comes to mind.


Yes. There exits. That was demonstrated by Goedel in 1931. "Within any sistem of axioms of arithmetic there will be, ever, undecidable propositions ."
Example:
Before Pascal did introduce the Axiom of Mathematical Induction, the sum of the
first n integers ( S = n(n+1)/2) was a hypothesis unprovable."

Perhaps the hypothesis of the infintude of twin primes (And others),needs the following new axiom: "The pairing of two Dirichlet Arithmetic Progresions produce infinitely many coincidences of two primes."
( D.A.P is a progression a.n + b such that a , b are coprimes.)

For the twin primes it suffices to pair the progressions 6n - 1 and 6n + 1

Ludovicus



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.