xu = ∑0≤v≤2e-1 sp(gLv + 2e+1u).
xu(i) = ∑v1≤v≤v2 sp(gLv + 2e+1u) for 0 ≤ u ≤ L-1,
where v1 = 2e×(i/4096), v2 = 2e×((i+1)/4096)-1. These had been computed in 2015, which required totally 45,700 hours using several personal computers.
We can execute the procedure of Lemma 1(I) by assembling partitioned data into G mod 2,
and computing GCD(G mod 2, Φ mod 2).
The result of i th part, xu(i)mod 2 (0 ≤ u ≤ L-1) were packed into a bit array.
Each 64 bits in the bit array were converted to a long integer (-263 ≤ l ≤ 263-1)
and stored in the data file "partiof4096.bitpoly".
In the table below, one can see the data file by clicking "D", and can see the corresponding computation log file.
by clicking "L".
One can also see these files by direct specification of URLs on browsers, e.g.
Obtained result is ¬(2 | h-p).
[computation log]
Data files
"http://fujima.sci.ibaraki.ac.jp/pcf2/e=49-L=524287/part123of4096.bitpoly"
and
"http://fujima.sci.ibaraki.ac.jp/pcf2/e=49-L=524287/part123of4096.bitpoly.log".
pcf2: Note on the class number of the p th cyclotomic field, II,
Shoichi Fujima and Humio Ichimura, 2015