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

24372Re: [PrimeNumbers] Re: Impossible to Prove ??

Expand Messages
  • James Merickel
    Aug 8, 2012
    • 0 Attachment
      I think that having gone through (at least) 5 editions and been scrutinized by all of the best number theorists in the world for the better part of a century makes this a safe assumption.

      --- On Wed, 8/8/12, djbroadhurst <d.broadhurst@...> wrote:

      From: djbroadhurst <d.broadhurst@...>
      Subject: [PrimeNumbers] Re: Impossible to Prove ??
      To: primenumbers@yahoogroups.com
      Date: Wednesday, August 8, 2012, 1:19 AM


      --- In primenumbers@yahoogroups.com,
      "Aldrich" <aldrich617@...> wrote:

      > qfbsolve definitely does necessarily presuppose
      > something about infinities of primes in the structure
      > of binary quadratic forms

      In the case in question, it presupposes that
      Theorem 257 of Hardy and Wright is correct.

      Like many others, I believe that this is the case.

      David (per proxy the good book)

      [Non-text portions of this message have been removed]
    • Show all 18 messages in this topic