Loading ...
Sorry, an error occurred while loading the content.

Re: [PrimeNumbers] Most important conjecture?

Expand Messages
  • Décio Luiz Gazzoni Filho
    ... The Riemann hypothesis. If you also consider computational number theory, then settling down whether P == NP would be equally, if not more important.
    Message 1 of 2 , Feb 7, 2005
    • 0 Attachment
      On Tuesday 08 February 2005 00:09, you wrote:
      > There seem to be a lot of conjectures/open questions regarding the
      > existence of certain collections of primes (e.g. tuplets or arithmetic
      > progressions) or the infinitude of primes of certain forms (e.g. n^2+1,
      > Mersenne)... Is there any one conjecture in Number Theory that if proved
      > would lead us to be able to make concrete assertions about these above-
      > mentioned conjectures/open questions?

      The Riemann hypothesis.

      If you also consider computational number theory, then settling down whether P
      == NP would be equally, if not more important.

      Décio


      [Non-text portions of this message have been removed]
    Your message has been successfully submitted and would be delivered to recipients shortly.