20081006, 00:27  #1 
Jun 2005
2×7^{2} Posts 
New Class of primes  proving algorithm
Using my new proof for Wagstone numbers I hope to present a proof for a new class of primes.
allow a day or two for me to adapt the paper presented in my post of thread This method will only be of value if one can pick a to complete the cycle within and I am not sure yet if that can be done. to convince you, you could try: V_(12+5) = (2^12+5)/3=1367 5 > 23 > 527 > 226 > 495 > 330 > 905 > 190 > 556> 192 > 1320 > 840 > 226 or 19 > 359 > 381 > 257 > 431 > 1214 > 168 > 882 > 99 > 230 > 952> 1348 > 359 now the minus case and that q is prime is coincidental V_(135)= (2^135)/3 = 2729 2434 > 2424 > 237 > 1587 > 2429 > 2670 > 750> 324 > 1272 > 2414 > 979 > 560 > 2492 > 1587 or 2220 > 2553 > 955 > 537 > 1822 > 1218 > 1675 > 211 > 855 > 2380 > 1723 > 2304 > 509> 2553 or you can try for yourself: V_(1323) = (2^1323)/21 S_0 = 199, then S_2 = 15 = S_39 or S_0 = 6, then S_1 = 34 = S_13 Last fiddled with by AntonVrba on 20081006 at 00:58 
20081006, 00:43  #2  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
5·1,217 Posts 
Quote:
But earlier you say:Which suggests a cycle length of 12. Hey this tex thing is interesting, I didn't know we could do that. 

20081006, 00:53  #3  
Jun 2005
142_{8} Posts 
Quote:
Cycle bad terminology and my mistake S_q should have read S_n which has now been corrected in the post. Last fiddled with by AntonVrba on 20081006 at 00:55 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Proving, for A > 1, (A+1)^n mod A = 0  MushNine  Number Theory Discussion Group  9  20180104 03:29 
Mersenne primes and class field theory  Nick  Math  4  20170401 16:26 
Primality proving  CRGreathouse  Software  13  20110130 14:30 
fastest general number primalityproving algorithm?  ixfd64  Math  3  20031217 17:06 
Countdown to proving M(6972593) is #38 down to less than 10!  eepiccolo  Lounge  10  20030203 05:15 