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

24333Re: [PrimeNumbers] Conjecture for primes

Expand Messages
  • Peter Kosinar
    Jul 28, 2012
    • 0 Attachment
      > If p and q are primes  and p and q >3 we have:
      > Floor[(p+q)/6]=Ceiling[(Floor[p/3]+Floor[q/3])/2]

      Now, replace "primes greater than 3" by "integers congruent to +1 or -1
      modulo 6". Since any multiple of 6 behaves the same way on left-hand and
      right-hand side of the equality (and thus we can cancel it out), we only
      need to check three possible cases:

      Floor((1+1)/6) = Ceiling[(Floor(1/3)+Floor(1/3))/2],
      Floor((1+5)/6) = Ceiling[(Floor(1/3)+Floor(5/3))/2] and
      Floor((5+5)/6) = Ceiling[(Floor(5/3)+Floor(5/3))/2]



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