Smoothly Undulating Palindromic Prime (SUPP)

http://www.worldofnumbers.com/undulat.htm

PFGW Version 3.4.8.64BIT.20110617.Win_Dev [GWNUM 26.6]

Primality testing (98*10^88595-89)/99 [N-1/N+1, Brillhart-Lehmer-Selfridge]

Running N-1 test using base 2

Generic modular reduction using generic reduction Core2 type-1 FFT length 40K, Pass1=32, Pass2=1280 on A 294313-bit number

Running N-1 test using base 13

Generic modular reduction using generic reduction Core2 type-1 FFT length 40K, Pass1=32, Pass2=1280 on A 294313-bit number

Running N+1 test using discriminant 19, base 1+sqrt(19)

Generic modular reduction using generic reduction Core2 type-1 FFT length 40K, Pass1=32, Pass2=1280 on A 294313-bit number

Calling N+1 BLS with factored part 0.01% and helper 0.00% (0.03% proof)

(98*10^88595-89)/99 is Fermat and Lucas PRP! (3373.8508s+0.0109s)

Done.

To be completed...