20201127, 14:13  #12  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
1001100111001_{2} Posts 
Quote:
Code:
Searching in the interval k=[0, 16336320] Each of 16 (p mod 60) passes will consist of 1 intervals of length 272272 Factor with k = 68745. This factor is a probable prime. MM(31) has 1 factors in range k = [0, 16336320], passes 015 Code:
MM(31) has 1 factors in range k = [0, 16336320], passes 015 Performed 505654 trial divides Clocks = 00:00:54.206 Code:
M( M( 31 ) )C: 295257526626031 # k = 68745, Wilfrid Keller 1981 Nov 27 M( M( 31 ) )C: 87054709261955177 # k = 20269004, Tony Forbes  Wilfrid Keller 1994 Aug 20 M( M( 31 ) )C: 242557615644693265201 # k = 56474845800, Reto Keiser 1999 Dec 6 M( M( 31 ) )C: 178021379228511215367151 # k = 41448832329225, Ernst Mayer 2005 June 20 That was just a few months after the beginning of commercial sale of the original IBM PC; several years before the beginning of creation of http. So news of it would have spread by number theory mailing lists. Last fiddled with by kriesel on 20201127 at 14:32 

20201127, 14:30  #13  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
7×19×37 Posts 
Quote:
Start through https://www.mersenneforum.org/showthread.php?t=24607. Bookmark it for later reference. For software after you've absorbed the contents of the first several links there, see http://www.mersenneforum.org/showpos...91&postcount=2 and its attachment. I'll put up a version of Mfactor later. People really should use and recommend Mfactor, not Factor5. Speed penalty ~7+ measured for Factor5. Last fiddled with by kriesel on 20201127 at 14:42 

20201127, 17:35  #14  
Banned
"Luigi"
Aug 2002
Team Italia
2·7^{4} Posts 
Quote:
Oh, and can work on exponents whose size is only limited by the memory of your computer. Yep, I'm proud of it, it's my baby... Luigi 

20201127, 18:20  #15 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
7·19·37 Posts 
Just to be clear, all functional GIMPS software contributions and their authors are welcome and respected. Cllucas used to be the best primality testing software for Mersennes on OpenCL. Eventually it was eclipsed by Gpuowl. I had written a combined TF and LL test program for x86 on DOS, doing it all integer and without the benefit of some number theory understanding; trial long division and grammar school squaring, in Fortran and then C. Single threaded, but didn't matter way back then when dual processor systems were rare. The run time scaling was absolutely dreadful (higher than cube of exponent), and made clear that better algorithms and better implementation were both required to have any chance. I learned of prime95 and its fft based multiplication in mid 1996, after beginning to implement Karatsuba. It didn't take long to decide to switch to George's far superior program.
Last fiddled with by kriesel on 20201127 at 18:26 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Primenet ECMFermat results  ET_  PrimeNet  3  20180828 12:40 
Primenet exponent status distribution archived data  James Heinrich  Data  2  20120201 21:14 
What minimum exponent would give 100M digit prime?  odin  Software  7  20100418 13:57 
V5 not reporting results to PrimeNet  edron1011  Software  8  20090126 16:59 
Request specific exponent from primenet question  Unregistered  Information & Answers  19  20080530 08:34 