Work

A Global Verification Criterion for Firoozbakht's Conjecture for Prime Gaps up to 2072

Year: 2026
Type: preprint
Abstract: This paper investigates Firoozbakht's conjecture through explicit analytic bounds for the prime-counting function and their implications for gaps between consecutive primes. Starting from the equivalent logarithmic formulation of the conjecture, we derive sufficient conditions for its validity in terms of the preceding prime and the corresponding prime gap. Using explicit estimates due to Axler, we establish a monotone threshold function that permits rigorous comparisons between prime-gap sizes and analytic bounds. The study incorporates previously reported computational verification of Firoozbakht's conjecture below (2^64), together with published prime-gap data extending toward (10^20). These results are used to formulate a global verification criterion for consecutive-prime gaps of size at most 2072, subject to the explicitly stated assumption concerning exhaustive computational coverage near (10^20). The paper provides detailed algebraic derivations, numerical threshold calculations, and comparisons with earlier investigations by Kourbatov, Visser, and other researchers. Particular attention is given to the distinction between unconditional analytic implications and conclusions that depend on computational verification. The results do not constitute a proof of Firoozbakht's conjecture in full. Rather, they provide a conditional verification framework and identify the computational evidence required to establish the stated global gap criterion.
Language: English
Open Access status: green
OpenAlex ID: W7236709423
Cites:
Cited by:
Related to: 10