Computing Jacobsthal’s Function on Primorials: Exact Values and Constructive Bounds
Version 1 / Oct 31, 2026 / CC BY 4.0
Abstract
Let h(x) = j(Px), where j is Jacobsthal’s function and Px is the product of the first x primes. We describe a parallel residue-covering search. Exhaustive exclusion runs, together with independently checked covering witnesses, establish h(65) = 1134, h(66) = 1160, h(67) = 1192, h(68) = 1216, h(69) = 1248, h(70) = 1274, and h(71) = 1298. Method 5B gives explicit certificates for h(100) ≥ 2054, h(150) ≥ 3558, and h(200) ≥ 5172, using partial coverings with five reserve primes. Exhaustive searches give h(100) ≤ 2798, h(150) ≤ 6898, and h(200) ≤ 11998. The search combines parity compression, descending endpoint restrictions, canonical deduplication, a sliding-window bootstrap, and dynamic prime selection related to Ziller and Morack’s Greedy Permutation Algorithm. We state the conditions needed for capacity bounds and conditional propagation, and organize extensions of complete or partial coverings in a five-tier framework. A catalog of 62 coverings at index 65 supports a verified multi-certificate envelope. The solver source, run evidence, certificates, and arithmetic verifiers are publicly available in the accompanying GitHub release v1.0-paper. Upper-bound conclusions depend on exhaustive execution of the search; the record audits do not independently repeat those searches or supply standalone unsatisfiability certificates
Provenance statement
References
- F. Costello and P. Watts, A computational upper bound on Jacobsthal's function , Preprint, arXiv:1208.5342 [math.NT] (2012).arXiv
- K. Ford, B. Green, S. Konyagin, J. Maynard, and T. Tao, Long gaps between primes , Journal of the American Mathematical Society 31 (2018), no. 1, 65--105; arXiv:1412.5029 [math.NT].arXiv
- K. Ford, B. Green, S. Konyagin, and T. Tao, Large gaps between consecutive prime numbers , Annals of Mathematics (2) 183 (2016), no. 3, 935--974.
- T. R. Hagedorn, Computation of Jacobsthal's function for , Mathematics of Computation 78 (2009), no. 266, 1073--1087.
- L. Hajdu and N. Saradha, Disproof of a conjecture of Jacobsthal , Mathematics of Computation 81 (2012), no. 280, 2461--2471. https://doi.org/10.1090/S0025-5718-2012-02581-6.DOI
- The OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences , entries A048670, A058989, and A072752, https://oeis.org/A048670, accessed October 24, 2026. A048670 was contributed by J. K. Haugland; extension credits are recorded in the entry.link
- H. Iwaniec, On the problem of Jacobsthal , Demonstratio Mathematica 11 (1978), no. 1, 225--231.
- E. Jacobsthal, Über Sequenzen ganzer Zahlen, von denen keine zu teilerfremd ist.\ I--III , Norske Vid.\ Selsk.\ Forh.\ (Trondheim) 33 (1960), 117--139.
- H. Maier and C. Pomerance, Unusually large gaps between consecutive primes , Transactions of the American Mathematical Society 322 (1990), no. 1, 201--237.
- M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an efficient SAT solver , Proceedings of the 38th Design Automation Conference (DAC), 2001, pp. 530--535.
Show all 13 referencesShow fewer references
- J. Pintz, Very large gaps between consecutive primes , Journal of Number Theory 63 (1997), no. 2, 286--301.
- M. Ziller, On differences between consecutive numbers coprime to primorials , Preprint, arXiv:2007.01808 [math.NT] (2020).arXiv
- M. Ziller and J. F. Morack, Algorithmic concepts for the computation of Jacobsthal's function , arXiv:1611.03310 [math.NT], first submitted 2016; version 2, May 31, 2017. https://arxiv.org/abs/1611.03310.arXiv
Version history
- v1 · 42 pagesSubmitted by Alben WeeksInitial depositCurrentOct 29, 2026