mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Proth Prime Search

Reply
 
Thread Tools
Old 2011-01-14, 07:07   #1
Cruelty
 
Cruelty's Avatar
 
May 2005

2·809 Posts
Default

2^1667321-2^833661+1 (501914 digits) Gaussian Mersenne norm 38
Cruelty is offline   Reply With Quote
Old 2011-01-17, 04:28   #2
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

Cruelty

Congrats on a nice prime!
Can you share exe times, hardware details with us.

Thanks.
Kosmaj is offline   Reply With Quote
Old 2011-01-20, 13:10   #3
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default

Thanks!
The search runs on single core of C2Q @ 3GHz. Single test using LLR takes ~4800 sec.
Cruelty is offline   Reply With Quote
Old 2011-01-20, 13:15   #4
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default

Well, here comes 6-th largest PRP @ 502485 digits ;-)

(2^1669219-2^834610+1)/5 is 5-PRP, 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 (32-bit).

Additionally using the following command with PFGW:
pfgw -l -tc -q(2^1669219-2^834610+1)/5

I've received the following result:
Code:
Primality testing (2^1669219-2^834610+1)/5 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Running N-1 test using base 5
Running N-1 test using base 7
Running N-1 test using base 11
Running N-1 test using base 19
Running N-1 test using base 29
Running N+1 test using discriminant 37, base 2+sqrt(37)
Calling N-1 BLS with factored part 0.02% and helper 0.00% (0.07% proof)
(2^1669219-2^834610+1)/5 is Fermat and Lucas PRP! (229144.7431s+0.0642s)
Cruelty is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 11:36.

Mon Jul 13 11:36:28 UTC 2020 up 110 days, 9:09, 0 users, load averages: 1.34, 1.38, 1.42

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.