Large prime gaps and probabilistic models
From MaRDI portal
Abstract: We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we obtain heuristic upper and lower bounds for the size of the largest prime gap in the interval . Our results are stated in terms of the extremal bounds in the interval sieve problem. The same methods also allow us to rigorously relate the validity of the Hardy-Littlewood conjectures for an arbitrary set (such as the actual primes) to lower bounds for the largest gaps within that set.
Recommendations
Cites work
- A heuristic for the prime number theorem
- A large sieve density estimate near \(\sigma = 1\)
- A Note on the Large Sieve
- An explicit bound for the least prime ideal in the Chebotarev density theorem
- Conversations on the Exceptional Character
- Cramér vs. Cramér. On Cramér's probabilistic model for primes
- Density functions for prime and relatively prime numbers
- Harald Cramér and the distribution of prime numbers
- Heuristic Reasoning in the Theory of Numbers
- scientific article; zbMATH DE number 3531490 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 3107107 (Why is no real title available?)
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- Large Intervals Between Consecutive Primes
- Large prime gaps and progressions with few primes
- Long gaps between primes
- Multiplicative number theory. I. Classical theory
- New maximal prime gaps and first occurrences
- On the distribution of primes in short intervals
- On the error term in the linear sieve
- Opera de cribro
- Positive proportion of short intervals containing a prescribed number of primes
- Primes in intervals
- Primes in short intervals
- Primes in short intervals
- Primes in Short Intervals: Heuristics and Calculations
- Primes in tuples. I
- Probability Inequalities for the Sum of Independent Random Variables
- Sieving intervals and Siegel zeros
- The difference between consecutive primes. II
- THE DISTRIBUTION OF PRIME NUMBERS
- The distribution of prime numbers
- The large sieve
- Upper bounds for prime \(k\)-tuples of size \(\log N\) and oscillations
- Weighted sums of certain dependent random variables
Cited in
(6)- Sieving intervals and Siegel zeros
- Maximal gaps between prime k-tuples: a statistical approach
- Prime avoiding numbers form a basis of order 2
- Local dynamical entropies and their applications in number theory
- Are prime numbers and quadratic residues random?
- Repellent properties of perfect powers on partition functions: a heuristic approach
This page was built for publication: Large prime gaps and probabilistic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113258)