mersenneforum.org  

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

Reply
 
Thread Tools
Old 2013-02-15, 19:58   #1
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

3×5×317 Posts
Default Proth primes

While working on GFNs (N=6000-6150, k=50,000,000-2,500,00,000), Markus Tervoonen gathered a huge list of Proth primes (about 40 millions).

If you are interested please leave a message...

Luigi
ET_ is offline   Reply With Quote
Old 2019-05-18, 05:48   #2
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

2·3·52·19 Posts
Default

Starting Proth prime test of 123173*2^333333+1
Using all-complex FMA3 FFT length 30K, Pass1=640, Pass2=48, clm=2, a = 3
123173*2^333333+1 is prime! (100349 decimal digits) Time : 46.491 sec.

Starting Proth prime test of 182931*2^333333+1
Using all-complex FMA3 FFT length 30K, Pass1=640, Pass2=48, clm=2, a = 5
182931*2^333333+1 is prime! (100349 decimal digits) Time : 46.459 sec.

Starting Proth prime test of 1460231*2^333333+1
Using zero-padded FMA3 FFT length 32K, Pass1=512, Pass2=64, clm=2, a = 3
1460231*2^333333+1 is prime! (100350 decimal digits) Time : 49.041 sec.

Starting Proth prime test of 1569345*2^333333+1
Using zero-padded FMA3 FFT length 32K, Pass1=512, Pass2=64, clm=2, a = 11
1569345*2^333333+1 is prime! (100350 decimal digits) Time : 49.245 sec.

Starting Proth prime test of 1714923*2^333333+1
Using zero-padded FMA3 FFT length 32K, Pass1=512, Pass2=64, clm=2, a = 5
1714923*2^333333+1 is prime! (100350 decimal digits) Time : 48.322 sec.

Starting Proth prime test of 1751013*2^333333+1
Using zero-padded FMA3 FFT length 32K, Pass1=512, Pass2=64, clm=2, a = 5
1751013*2^333333+1 is prime! (100350 decimal digits) Time : 49.114 sec.

Starting Proth prime test of 1852761*2^333333+1
Using zero-padded FMA3 FFT length 32K, Pass1=512, Pass2=64, clm=2, a = 5
1852761*2^333333+1 is prime! (100350 decimal digits) Time : 49.546 sec.

Last fiddled with by ATH on 2019-05-19 at 16:49
ATH is online now   Reply With Quote
Old 2019-07-31, 06:05   #3
Chara34122
 
Nov 2018
Russia

7 Posts
Default

I'm interested. Besides, today I've found one: 305147*2^1030527+1 (310226 digits long) from http://irvinemclean.com/maths/sierpin3.htm . How can I check it for being a Fermat, GF, xGF divisor?
Chara34122 is offline   Reply With Quote
Old 2019-07-31, 12:23   #4
Dylan14
 
Dylan14's Avatar
 
"Dylan"
Mar 2017

3·7·23 Posts
Default

Quote:
Originally Posted by Chara34122 View Post
I'm interested. Besides, today I've found one: 305147*2^1030527+1 (310226 digits long) from http://irvinemclean.com/maths/sierpin3.htm . How can I check it for being a Fermat, GF, xGF divisor?
You could use pfgw to test the number for Fermat divisibility. You’ll want to use the -gxo flag (which does the tests without testing to see if the number is prime). An appropriate command line for Windows would be

Code:
pfgw64 -gxo -q”305147*2^1030527+1”
Dylan14 is offline   Reply With Quote
Old 2019-08-28, 17:47   #5
Chara34122
 
Nov 2018
Russia

7 Posts
Default

If anyone is interested : one more 285473*2^530921+1 is prime! (159829 decimal digits).
Chara34122 is offline   Reply With Quote
Old 2019-09-09, 23:17   #6
rudy235
 
rudy235's Avatar
 
Jun 2015
Vallejo, CA/.

16748 Posts
Default

A new prime has been discovered (pending verification) and has 5,269,954 digits.

It is 7 ·6 6772401 + 1 .

Although I am doubtful it was checked as a Proth Prime, it might be represented as such

[7*3**6772401* 2**6772401 +1 . https://primes.utm.edu/primes/page.php?id=129914

It is by far the largest Prime of 2019 and if verified it will rank as #18 in the list of Largest Primes kept by CC

Congratulations to Ryan Propper.

Edit: A Proth number is restricted to k k>2n N=k2n+1 so I ammend my previous statement.

Last fiddled with by rudy235 on 2019-09-10 at 00:15
rudy235 is offline   Reply With Quote
Old 2019-09-11, 09:23   #7
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

1,283 Posts
Default

Congratulations to Ryan Propper.
He really earn this prime: but I cannot even imagine what resources he has.
If we make initial sieve , then assume sieve depth, from last prime we have at least 100000 candidates from 2.8M digits and above :)
And he process 100000 those candidates in 34 days. Some supercomputer must be behind scene.
pepi37 is online now   Reply With Quote
Old 2019-09-17, 16:45   #8
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

8E416 Posts
Default

He mentioned a few years ago that he had access to a cluster: https://mersenneforum.org/showthread.php?t=17690

I imagine he still does.
ixfd64 is offline   Reply With Quote
Old 2020-02-15, 16:06   #9
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009
U.S.A.

32·137 Posts
Default

Quote:
Originally Posted by rudy235 View Post
...A Proth number is restricted to k k>2n N=k2n+1 so I ammend my previous statement.
Would the simple form of this not be k*2^n+1?
storm5510 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Proth and Riesel Primes lukerichards Number Theory Discussion Group 7 2018-01-20 16:47
(NEW) Proth Primes Section kar_bon Riesel Prime Data Collecting (k*2^n-1) 6 2010-11-25 13:39
some primes I found with Proth.exe last year ixfd64 Lounge 1 2005-09-07 23:42
64-bit proth sieve possible??? VJS Software 0 2005-05-27 17:32
Last possible proth tested! Deamiter PSearch 3 2003-03-03 03:19

All times are UTC. The time now is 00:06.

Mon Jul 6 00:06:50 UTC 2020 up 102 days, 21:39, 0 users, load averages: 1.30, 1.49, 1.57

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.