|
Guest
|
Let:
n be an integer >= 2
m = 2n+1
c=3, 5, and 7
a=(c^n+1)/2
b=(c^n-1)/2
m is prime if for each value of c (3,5,7) and its corresponding a and
b, one of a, b, and c is equally divisible by m but not three
consecutive a's, three consecutive b's, or three consecutive c's are
equally divisible by m
for example:
n m=2n+1 c a=(c^n+1)/2 b=(c^n-1)/2 Mod(c,m) Mod(a,m) Mod(b,m)
2 5 3 5 4 3 0 4
5 13 12 0 3 2
7 25 24 2 0 4
3 7 3 14 13 3 0 6
5 63 62 5 0 6
7 172 171 0 4 3
4 9 3 41 40 3 5 4
5 313 312 5 7 6
7 1201 1200 7 4 3
5 11 3 122 121 3 1 0
5 1563 1562 5 1 0
7 8404 8403 7 0 10
etc. |
|
|
