## 21356Re: Third mega-trit prime

Expand Messages
• Mar 1, 2010
Many congrats for this third success!

But, this time LLR needed one more restart...

>cllr -d -a68 -q"2*3^1175232+1"
Base prime factor(s) taken : 3
Starting N-1 prime test of 2*3^1175232+1
Using all-complex FFT length 96K, a = 3
2*3^1175232+1 may be prime, trying to compute gcd's
2*3^1175232+1 may be prime, but N divides 3^((N-1)/3))-1, restarting with a=5 Time : 8983.686 sec.
Restarting N-1 prime test of 2*3^1175232+1
Using all-complex FFT length 96K, a = 5
2*3^1175232+1 may be prime, trying to compute gcd's
5^((N-1)/3)-1 is coprime to N!
2*3^1175232+1 is prime! Time : 8834.941 sec.

Best Regards,
Jean

>
>
>
> "jpyah2001" <jpenne@> wrote:
>
> > 2*3^1086112+1 is prime! Time : 7392.541 sec.
>
> Here's a third, according to OpenPFGW:
>
> Primality testing 2*3^1175232+1 [N-1, Brillhart-Lehmer-Selfridge]
> Running N-1 test using base 2
> Running N-1 test using base 3
> Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
> 2*3^1175232+1 is prime! (12689.9371s+0.0402s)
>
> David
>
• Show all 16 messages in this topic