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

An Algorithm to generate primes ...

Expand Messages
  • alby7e7
    I suppose... if GCD(n! , n + 1) = 1 if GCD(n! , n + 1 ) != 1 also (n+1)+1 so I do GCD(n!, n+2) = 1? if yes I do the sum n! + n+2 also I do another GCD with n+3
    Message 1 of 1 , Nov 17, 2007
    • 0 Attachment
      I suppose...
      if GCD(n! , n + 1) = 1

      if GCD(n! , n + 1 ) != 1

      also (n+1)+1

      so I do GCD(n!, n+2) = 1?
      if yes I do the sum n! + n+2 also I do another GCD with n+3 and n!...

      n! + n +1 = P

      ** but if n > 7

      n + 1 > n! so I will do n+1+1+1+1+1+1+1+1+1...+1k

      while n+k > n! and GCD(n!,n+k ) = 1

      n! + n + k = P

      According to you is it true?

      it can generate a lot of primes?

      *** for example : ***
      EX.1
      n=0

      n! = 1 , n+1 = 2 GCD(1,1)= 1
      1+1 = 2

      EX.2

      n=1


      n!=1 n+1 = 2 GCD(1,2)= 1
      1+2=3

      EX.3

      n=3


      n! = 6
      n+1 = 4 GCD(6,4)=2
      GCD(6,4+1)=1
      6+5 = 11


      EX.4

      n=4

      n! = 24

      n+1 = 5

      GCD(24,5)=1

      24+5 = 29
    Your message has been successfully submitted and would be delivered to recipients shortly.