The bounding prp's of a prime gap are
50491*(87811#)/6-657714 and 50491*(87811#)/6+420466.
The gap was first computed by Pierre Cami.
He used pfgw -f to trial factor to 12100565.
He then 3-prp tested the remaining 14882 numbers with PrimeForm/GW (pfgw).
All composites in the gap have been verified by Jens Kruse Andersen
or Hans Rosenthal.
Andersen made a partial verification of the gap.
He sieved to 200*10^9 with his own sieve. 9407 numbers remained unfactored.
He then 3-prp tested every 50th of these with pfgw -a1.
-a1 uses a larger and safer FFT size, and makes the check more independent.
All 188 prp test residues from Andersen's pfgw -a1 matched Cami's pfgw.
Andersen later continued sieving to 370*10^9.
Rosenthal then prp tested all unfactored numbers with
PFGW Version 20041129.Win_Stable (v1.2 RC1d) [FFT v23.8]
Rosenthal used an AMD cpu when Cami had used Intel, and vice versa.
All prp test residues matched. The slower -a1 was not used.
Files in verify1078180.zip:
verify1078180.txt This file.
factors1Mto370G.txt Andersen's found factors between 10^6 and 370*10^9.
Factors below 10^6 are not online.
unfactoredto370G.txt Andersen's 9211 numbers with no factor below 370*10^9.
All prp tested by Rosenthal.
minusres.txt Cami's prp test residues below 50491*(87811#)/6
plusres.txt Cami's prp test residues above 50491*(87811#)/6
These prp tests include numbers where Andersen found a factor.
more.txt 4 more prp tests by Andersen who noted Cami had not supplied them.
Cami also supplied output for factors found by pfgw. This is not online.
Rosenthal's pfgw output is not online.
Written by Jens Kruse Andersen March 1 2006. Updated April 14 2006.