mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Wagstaff PRP Search

Reply
 
Thread Tools
Old 2019-06-27, 10:11   #23
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

129B16 Posts
Default

Quote:
Originally Posted by lalera View Post
hi,
mmff does not (yet) run with nvidia turing cards
It does, but under Linux.
ET_ is online now   Reply With Quote
Old 2019-06-27, 13:36   #24
mathwiz
 
Mar 2019

22·17 Posts
Default

Perhaps the author of mmff could comment on the feasibility of modifying this program to find Double Wagstaff factors, and if so, how it would need to be changed?
mathwiz is offline   Reply With Quote
Old 2019-06-27, 15:06   #25
GP2
 
GP2's Avatar
 
Sep 2003

2,579 Posts
Default

Quote:
Originally Posted by mathwiz View Post
Perhaps the author of mmff could comment on the feasibility of modifying this program to find Double Wagstaff factors, and if so, how it would need to be changed?
I'm not the author, but I'm looking at the source code. The code special-cases each of the exponents 31, 61, 89,107, 127 for Mersenne, plus a bunch of specific Fermat exponents. Wagstaff shares the exponents 31, 61, 127 with Mersenne, but also has the new exponents 43, 79, 101. So new assembler code would have to be written.

It is not nearly as simple as the changes that were made to mfaktc to handle Wagstaff, which was a mere handful of #ifdef statements. The mfaktc code can handle any arbitrary exponent up to a certain limit, including MM31 (exponent = about 2.1 billion), but not the huge "double" exponents. I used it to test WW31 (exponent = about 715 million) up to TF=2^80 and found one small factor of about 62 bits. WW43 (exponent = about 2.9 trillion) is out of reach.

The Double Mersenne search hasn't had any results beyond MM31. The most recent of four factors of MM31 was found in 2005, so probably mmff was not used to find it. Since Double Mersenne hasn't had much success and seems to have only two currently active users, and Wagstaff has much less overall interest than Mersenne, and creating Double Wagstaff code would involve non-trivial specialized effort, it's kind of hard to make a case for doing Double Wagstaff.
GP2 is offline   Reply With Quote
Old 2019-11-15, 04:55   #26
Dylan14
 
Dylan14's Avatar
 
"Dylan"
Mar 2017

499 Posts
Default

I don't know if there has been any update to searching for factors of double Wagstaffs, but I searched for potential factors of W(W(42737)), using pfgw64 with the -f1 flag, and the following input:


Code:
ABC2 2*$a*((2^42737+1)/3)+1
a: from 1 to 50000
this yielded the following PRP's and potential factors:


Code:
2*21085*((2^42737+1)/3)+1
2*42289*((2^42737+1)/3)+1
Unfortunately I don't have a program that can test for divisibility, so I can't test if they are factors or not.
Although this is reasonably quick (a test takes about half a second), there's a lot of candidates with a factor of 3, so a sieve would be good for a serious search.
Dylan14 is offline   Reply With Quote
Old 2019-11-15, 06:11   #27
axn
 
axn's Avatar
 
Jun 2003

33·173 Posts
Default

Wagstaff factors must be 1 or 3 (mod 8). Your numbers are 7 (mod 8). So they can't divide.

But if you want to test them, you can use Pari/GP

Code:
? W=(2^42737+1)/3;
? N=2*21085*((2^42737+1)/3)+1;
? Mod(2,N)^W+1 == 0
%1 = 0
EDIT:- Only search k= 0 or 3 (mod 4) for double wagstaff factors

Last fiddled with by axn on 2019-11-15 at 06:19
axn is offline   Reply With Quote
Old 2019-11-17, 21:12   #28
Dylan14
 
Dylan14's Avatar
 
"Dylan"
Mar 2017

49910 Posts
Default

Thanks axn for the advice. I've updated the ABC2 header:


Code:
ABC2 2*(4*$a)*((2^42737+1)/3)+1 | 2*(4*$a+3)*((2^42737+1)/3)+1
a: from 0 to 62500
The first expression tests k's which are 0 mod 4, and the second tests k's which are 3 mod 4. I got the following PRP's:


Code:
2*(4*13918+3)*((2^42737+1)/3)+1
2*(4*18327+3)*((2^42737+1)/3)+1
2*(4*26962+3)*((2^42737+1)/3)+1
2*(4*34111)*((2^42737+1)/3)+1 
2*(4*38520)*((2^42737+1)/3)+1 
2*(4*45025)*((2^42737+1)/3)+1 
2*(4*54945)*((2^42737+1)/3)+1 
2*(4*58207)*((2^42737+1)/3)+1 
2*(4*58308+3)*((2^42737+1)/3)+1
Unfortunately, none of these divide W(W(42737)).
Dylan14 is offline   Reply With Quote
Old 2019-11-18, 02:49   #29
axn
 
axn's Avatar
 
Jun 2003

33×173 Posts
Default

I did a search of all k < 10^6. Here are the primes. No factors, natch.
Code:
2*55675*((2^42737+1)/3)+1
2*73311*((2^42737+1)/3)+1
2*107851*((2^42737+1)/3)+1
2*136444*((2^42737+1)/3)+1
2*154080*((2^42737+1)/3)+1
2*180100*((2^42737+1)/3)+1
2*219780*((2^42737+1)/3)+1
2*232828*((2^42737+1)/3)+1
2*233235*((2^42737+1)/3)+1
2*266260*((2^42737+1)/3)+1
2*284271*((2^42737+1)/3)+1
2*308163*((2^42737+1)/3)+1
2*319195*((2^42737+1)/3)+1
2*340684*((2^42737+1)/3)+1
2*341500*((2^42737+1)/3)+1
2*348316*((2^42737+1)/3)+1
2*367168*((2^42737+1)/3)+1
2*368020*((2^42737+1)/3)+1
2*406035*((2^42737+1)/3)+1
2*427771*((2^42737+1)/3)+1
2*464971*((2^42737+1)/3)+1
2*468720*((2^42737+1)/3)+1
2*470836*((2^42737+1)/3)+1
2*534735*((2^42737+1)/3)+1
2*535951*((2^42737+1)/3)+1
2*574444*((2^42737+1)/3)+1
2*576928*((2^42737+1)/3)+1
2*580056*((2^42737+1)/3)+1
2*623875*((2^42737+1)/3)+1
2*628611*((2^42737+1)/3)+1
2*639783*((2^42737+1)/3)+1
2*652996*((2^42737+1)/3)+1
2*691695*((2^42737+1)/3)+1
2*759304*((2^42737+1)/3)+1
2*771864*((2^42737+1)/3)+1
2*795195*((2^42737+1)/3)+1
2*813655*((2^42737+1)/3)+1
2*823683*((2^42737+1)/3)+1
2*902104*((2^42737+1)/3)+1
2*925608*((2^42737+1)/3)+1
2*953796*((2^42737+1)/3)+1
2*995536*((2^42737+1)/3)+1
axn is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Status of Wagstaff testing? and testing Mersenne primes for Wagstaff-ness GP2 Wagstaff PRP Search 386 2020-08-09 03:02
Large gaps between Wagstaff prime exponents Bobby Jacobs Wagstaff PRP Search 2 2019-03-03 19:37
Statistical odds for prime in Wagstaff vs Mersenne diep Math 27 2010-01-13 20:18
30th Wagstaff prime T.Rex Math 0 2007-09-04 07:10
Silverman & Wagstaff on Joint Distribution of Ultimate and Penultimate Prime Factors wblipp Math 12 2006-04-02 18:40

All times are UTC. The time now is 13:54.

Thu Aug 13 13:54:10 UTC 2020 up 10:29, 1 user, load averages: 1.31, 1.51, 1.63

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.