@x
The output file is a short text file that reports large gaps.
Whenever the program discovers consecutive primes for which the gap
$p_{k+1}-p_k$ is greater than or equal to all previously seen gaps,
this gap is output (unless it is smaller than 256).
The smallest and largest
primes between $s_0$ and $s_t$ are also output, so that we can keep
track of gaps between primes that are
found by different instances of this program.
@y
The output file in this ``bootstrap'' version is a list of all
primes $\le s_t$, in a format suitable for use as the input file
in the regular version.
@z
@x
@;
@y
@z
@x
outfile=fopen(argv[4],"w");
if (!outfile) {
fprintf(stderr,"I can't open %s for text output!\n",argv[4]);
exit(-3);
}
st=s0+tt*del;
@y
outfile=fopen(argv[4],"wb");
if (!outfile) {
fprintf(stderr,"I can't open %s for binary output!\n",argv[4]);
exit(-3);
}
st=s0+tt*del;
if (st>0xffffffff) {
fprintf(stderr,"Sorry, s[t] = %llu exceeds 32 bits!\n",st);
exit(-69);
}
@z
@x
@;
@y
@