20081230, 20:24  #34 
May 2005
2·809 Posts 
1.371.38M complete, reserving 1.381.39M

20090221, 17:49  #35 
May 2005
2·809 Posts 
complete till 1.4M, reserving 1.4M1.45M

20090717, 20:36  #36 
May 2005
2×809 Posts 
complete till 1.45M, reserving 1.45M1.5M

20091019, 13:16  #37 
May 2005
2·809 Posts 
reserving 1.5M1.51M

20091218, 22:47  #38 
May 2005
3122_{8} Posts 
complete till n=1.51M, reserving 1.51M  1.55M

20100213, 09:15  #39 
May 2005
2·809 Posts 
Reserving 1.55  1.56M

20100406, 17:28  #40 
May 2005
2·809 Posts 
complete till n=1.56M, reserving 1.56M  1.6M

20100805, 20:29  #41 
May 2005
652_{16} Posts 
complete till n=1.6M, reserving 1.6M  1.66M

20101230, 23:56  #42 
May 2005
2·809 Posts 
complete till n=1.66M, reserving 1.66M  1.7M

20110120, 13:15  #43 
May 2005
2×809 Posts 
Well, here comes 6th largest PRP @ 502485 digits ;)
(2^16692192^834610+1)/5 is 5PRP, originally found using LLR ver.3.8.4 for Windows (no factor till 2^54). This is a Fermat PRP at base 3, 5, 7, 11, 13, 31, 101, 137  confirmed with PFGW ver.3.4.4 for Windows (32bit). Additionally using the following command with PFGW: pfgw l tc q(2^16692192^834610+1)/5 I've received the following result: Code:
Primality testing (2^16692192^834610+1)/5 [N1/N+1, BrillhartLehmerSelfridge] Running N1 test using base 2 Running N1 test using base 5 Running N1 test using base 7 Running N1 test using base 11 Running N1 test using base 19 Running N1 test using base 29 Running N+1 test using discriminant 37, base 2+sqrt(37) Calling N1 BLS with factored part 0.02% and helper 0.00% (0.07% proof) (2^16692192^834610+1)/5 is Fermat and Lucas PRP! (229144.7431s+0.0642s) 
20110717, 16:33  #44 
May 2005
2×809 Posts 
complete till n=1.7M, reserving 1.7M  1.77M

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
New PC dedicated to Mersenne Prime Search  Taiy  Hardware  12  20180102 15:54 
Gaussian integers use of norms  devarajkandadai  Number Theory Discussion Group  11  20171028 20:58 
Low clock speeds on Mersenne Prime search  Ammonia  Hardware  2  20160121 17:46 
Testing Mersenne cofactors for primality?  CRGreathouse  Computer Science & Computational Number Theory  18  20130608 19:12 
Can I specify the range to search the Mersenne Prime?  Unregistered  Information & Answers  22  20120320 11:38 