mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Conjectures 'R Us (https://www.mersenneforum.org/forumdisplay.php?f=81)
-   -   Double-Check (https://www.mersenneforum.org/showthread.php?t=21533)

wombatman 2016-08-29 18:57

Double-Check
 
Could someone double-check the primality of 63998*297^21888-1?

It passes 3, 5, 7, and 11 Fermat PRP but fails the N+1 BLS test via PFGW. I'd appreciate someone else confirming one way or the other.

Batalov 2016-08-29 19:15

It is prime.
[CODE]Using zero-padded FMA3 FFT length 28K, Pass1=448, Pass2=64, a = 3
...
Using zero-padded FMA3 FFT length 30K, Pass1=384, Pass2=80, a = 3
...
U((N+1)/11) is coprime to N!
U((N+1)/3) is coprime to N!
63998*297^21888-1 is prime! (54129 decimal digits, P = 3) Time : 56.775 sec.[/CODE]
Try -a1 -a2 (etc) options.
Also, try LLR (and optionally, add [B]FFT_Increment=1[/B] (or 2, or 3) to llr.ini

lalera 2016-08-29 20:25

./sllr64 -q63998*297^21888-1
63998*297^21888-1 is prime! (54129 decimal digits, P = 3) Time : 198.176 sec.

wombatman 2016-08-29 20:46

Thanks to both of you. For full clarification, here's what I get with PFGW's "-tp" switch:

[CODE]$ pfgw64.exe -f0 -a1 -tp -q"63998*297^21888-1"
PFGW Version 3.7.10.64BIT.20150809.Win_Dev [GWNUM 28.6]

No factoring at all, not even trivial division
Primality testing 63998*297^21888-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 2, base 2+sqrt(2)
63998*297^21888-1 is composite (240.1252s+0.0018s)[/CODE]

I went ahead and used LLR to confirm that it's prime.


All times are UTC. The time now is 07:18.

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