[Webmath] Arithmétics progressions ruling primes

[francillette thierry]

hello,

How to know if N is prime? with N, odd and different than 3;
We can find (N-1)/3 or (N-2)/3, I call an ALTHEYR = R (integer).
Looking each R, odd or even, we can discribe when 3r+1 or 3r+2 is Prime.

with (n) going from 0 to infinite and K stricly positive
--With R even : 3R+1 is prime if
   R is not  (8+10n) + K (10+12n)  or (16+16n) + K(14+12n)

--With r odd : 3r+2 is prime if
   R is not (11+14n) + K(10+12n) or (11+10n) + K(14+12n)
There are others équations with only odds or enes numbers and a big one on 
one line:
N= 2R+1 and R= (4+3n) + K(3+2n)
With a program we can "CRIBLE" all PRIMES and find factors ...

Thanks to study this, I have only a TI 92

_________________________________________________________________
Windows Live Mail : venez tester la version bêta ! 
http://www.ideas.live.com/programpage.aspx?versionId=5d21c51a-b161-4314-9b0e-4911fb2b2e6d