20211107, 02:18  #12  
Sep 2002
Database er0rr
7612_{8} Posts 
Quote:
Enjoy the latest incarnation found in post #1. 

20211120, 14:01  #14 
Sep 2002
Database er0rr
111110001010_{2} Posts 
The row of data for 9 digits has been added. The data for 10 digits will take another month of so.
I have tried to make the English simpler. So it is worth downloading the latest copy from post #1. Please enjoy the read  it is less that 3 pages long  and let me know about any improvements that could be made. 
20220107, 22:32  #15 
Sep 2002
Database er0rr
7612_{8} Posts 
I am still gathering data, but post #1 has been updated with the latest paper. The idea of segmenting P is introduced with the idea of unlikely geometric progression of passes of the test. I also offer £100 for a composite that passes for any "r".
EDIT: I have removed the wishywashy paragraph about segmentation. Last fiddled with by paulunderwood on 20220108 at 12:38 
20220115, 16:57  #16 
Sep 2002
Database er0rr
2·3^{2}·13·17 Posts 
I can now clarify. Take the example n=2499327041 with 30258 P <= (n1)/2 values that give rise to counterexamples. The multiplicative order of 2 is 560 meaning a single 2^r solution would give rise to 2231542 solutions in total, as r goes up to (n1)/2. Maybe this is not the correct reasoning
Last fiddled with by paulunderwood on 20220115 at 17:58 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Conference paper: On the Combined Fermat/Lucas Probable Prime Test  SELROC  Math  1  20190731 09:54 
Question on Lucas Lehmer variant (probably a faster prime test)  MrRepunit  Math  9  20120510 03:50 
An interesting paper: PomeranceLucas  T.Rex  Math  5  20090130 22:50 
Lucas test for billion bit prime  MESCALINE1968  Lone Mersenne Hunters  2  20050606 22:06 
about LucasLehmer test and Prime 95  Annunaki  Math  22  20030805 21:52 