Maximum distance between consecutive primes and other related questions

2022/11/19 by Victor Volfson, Volfson, Victor
Mathematics · Computer Science · #Analytic Number Theory Research #Coding theory and cryptography #Advanced Mathematical Identities

paper · pdf · doi:10.48550/arxiv.2211.13255

Abstract

The paper considers the asymptotic of the ratio of the number of primes not exceeding the primorial and the number of residues in the reduced system of residues for the given primorial. We study the relationship between asymptotic lower bounds for the values of the Jacobstal function and the maximum distance between successive primes. One algorithm for computing the Jacobstal function is given. The substantiation of the conjectures about the upper estimate of the maximum distance between successive prime numbers is given.

Related

• Asymptotic of the greatest distance between adjacent primes and the Hardy-Littlewood conjecture
• A computational upper bound on Jacobsthal's function
• New conjectures in number theory - The distribution of prime numbers
• On a sequence involving the prime numbers
• New computational results on a conjecture of Jacobsthal