[QUOTE=3.14159;237862]Prove it.[/QUOTE]

[CODE]PFGW Version 3.4.4.32BIT.20101104.Win_Dev [GWNUM 26.4]

Special modular reduction using zero-padded Pentium4 type-3 FFT length 32K, Pass1=128, Pass2=256 on 100010001*10^81741+1
100010001*10^81741+1 is 3-PRP! (133.1395s+0.0049s)

Done.
PFGW Version 3.4.4.32BIT.20101104.Win_Dev [GWNUM 26.4]

Primality testing 100010001*10^81741+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 17
Special modular reduction using zero-padded Pentium4 type-3 FFT length 32K, Pass1=128, Pass2=256 on 100010001*10^81741+1
Running N-1 test using base 29
Special modular reduction using zero-padded Pentium4 type-3 FFT length 32K, Pass1=128, Pass2=256 on 100010001*10^81741+1
Calling Brillhart-Lehmer-Selfridge with factored part 69.89%
100010001*10^81741+1 is prime! (392.8720s+0.0339s)

Done.
PFGW Version 3.4.4.32BIT.20101104.Win_Dev [GWNUM 26.4]

Factoring numbers to 100% of normal.

10001*10^81741+1 has factors: 3

Done.
PFGW Version 3.4.4.32BIT.20101104.Win_Dev [GWNUM 26.4]

Factoring numbers to 100% of normal.

10^81741+1 has factors: 7

Done.
[/CODE]