PrimeGrid
Please visit donation page to help the project cover running costs for this month

Toggle Menu

Join PrimeGrid

Returning Participants

Community

Leader Boards

Results

Other

drummers-lowrise

Advanced search

Message boards : Proth Prime Search : Testing Proth Primes for Fermat Divisibility

Author Message
John
Send message
Joined: 31 Dec 12
Posts: 4
ID: 187271
Credit: 148,696
RAC: 0
321 LLR Bronze: Earned 10,000 credits (11,222)Cullen LLR Bronze: Earned 10,000 credits (13,683)PPS LLR Bronze: Earned 10,000 credits (45,989)PSP LLR Bronze: Earned 10,000 credits (12,979)SR5 LLR Bronze: Earned 10,000 credits (18,541)TRP LLR Bronze: Earned 10,000 credits (11,417)PPS Sieve Bronze: Earned 10,000 credits (33,710)
Message 69793 - Posted: 9 Oct 2013 | 15:19:22 UTC

What is the best way to test, say, a .txt output file from LLR to see if any of the numbers in the file divide a Fermat number? I.e. I'm running n=70-100k for k=30k-40k, and wanting to see if any of the primes I've found are Fermat divisors, but they aren't big enough for Top-5000, so I can't rely on the site to test divisibility for me. Should I use PFGW with the -gxo flag, or what?
Thanks in advance!
J.

Profile Michael GoetzProject donor
Volunteer moderator
Project administrator
Project scientist
Avatar
Send message
Joined: 21 Jan 10
Posts: 11770
ID: 53948
Credit: 159,918,411
RAC: 184,271
The "Shut up already!" badge:  This loud mouth has mansplained on the forums over 10 thousand times!  Sheesh!!!Discovered the World's First GFN-19 prime!!!Discovered 1 mega primeFound 1 prime in the 2018 Tour de Primes321 LLR Ruby: Earned 2,000,000 credits (2,063,182)Cullen LLR Ruby: Earned 2,000,000 credits (2,005,249)ESP LLR Ruby: Earned 2,000,000 credits (2,001,789)Generalized Cullen/Woodall LLR Ruby: Earned 2,000,000 credits (2,004,898)PPS LLR Ruby: Earned 2,000,000 credits (2,082,200)PSP LLR Ruby: Earned 2,000,000 credits (2,632,269)SoB LLR Sapphire: Earned 20,000,000 credits (26,156,052)SR5 LLR Turquoise: Earned 5,000,000 credits (7,371,106)SGS LLR Ruby: Earned 2,000,000 credits (2,010,466)TRP LLR Ruby: Earned 2,000,000 credits (2,433,520)Woodall LLR Ruby: Earned 2,000,000 credits (2,176,414)321 Sieve (suspended) Silver: Earned 100,000 credits (200,576)Cullen/Woodall Sieve (suspended) Ruby: Earned 2,000,000 credits (4,170,256)Generalized Cullen/Woodall Sieve Turquoise: Earned 5,000,000 credits (5,059,304)PPS Sieve Sapphire: Earned 20,000,000 credits (20,110,788)Sierpinski (ESP/PSP/SoB) Sieve (suspended) Amethyst: Earned 1,000,000 credits (1,035,522)TRP Sieve (suspended) Ruby: Earned 2,000,000 credits (2,051,121)AP 26/27 Turquoise: Earned 5,000,000 credits (7,086,053)GFN Emerald: Earned 50,000,000 credits (57,229,526)PSA Jade: Earned 10,000,000 credits (10,038,118)
Message 69814 - Posted: 9 Oct 2013 | 20:55:51 UTC - in response to Message 69793.

What is the best way to test, say, a .txt output file from LLR to see if any of the numbers in the file divide a Fermat number? I.e. I'm running n=70-100k for k=30k-40k, and wanting to see if any of the primes I've found are Fermat divisors, but they aren't big enough for Top-5000, so I can't rely on the site to test divisibility for me. Should I use PFGW with the -gxo flag, or what?
Thanks in advance!
J.


Pfgw64 -gxo is how we test it on the server when someone finds a Proth prime. I'm not sure if pfgw can directly read the output from LLR or if you need to create some glue with a script.
____________
Please do not PM me with support questions. Ask on the forums instead. Thank you!

My lucky number is 75898524288+1

Post to thread

Message boards : Proth Prime Search : Testing Proth Primes for Fermat Divisibility

[Return to PrimeGrid main page]
DNS Powered by DNSEXIT.COM
Copyright © 2005 - 2019 Rytis Slatkevičius (contact) and PrimeGrid community. Server load 0.50, 0.86, 1.16
Generated 18 Jan 2019 | 1:34:37 UTC