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

RE: [PrimeNumbers] Elementary proof

Expand Messages
  • Paul Jobling
    ... Currently, all of the composite Fermat numbers have been found to be squarefree. There is no known reason for this, however, so the discovery of a square
    Message 1 of 2 , Mar 29 2:32 AM
    • 0 Attachment
      > P.S1 At present there are 185 Fermat numbers that are
      > known to be composite.I wanted to ask if there could
      > be a way to check if some of the existed factors of
      > them divide again the remaining number,i.e p^2/F(m)
      > This could be more probably for small values of
      > k,p=k*2^n+1

      Currently, all of the composite Fermat numbers have been found to be
      squarefree. There is no known reason for this, however, so the discovery of a
      square factor of a Fermat number would be of interest as it would kill the
      conjecture.

      Regards,

      Paul.


      __________________________________________________
      Virus checked by MessageLabs Virus Control Centre.
    Your message has been successfully submitted and would be delivered to recipients shortly.