Determining Mills' Constant and a Note on Honaker's Problem
From MaRDI portal
Abstract: In 1947 Mills proved that there exists a constant such that is a prime for every positive integer . Determining requires determining an effective Hoheisel type result on the primes in short intervals - though most books ignore this difficulty. Under the Riemann Hypothesis, we show that there exists at least one prime between every pair of consecutive cubes and determine (given RH) that the least possible value of Mills' constant does begin with 1.3063778838. We calculate this value to 6850 decimal places by determining the associated primes to over 6000 digits and probable primes (PRPs) to over 60000 digits. We also apply the Cram'er-Granville Conjecture to Honaker's problem in a related context.
Recommendations
- scientific article; zbMATH DE number 7015143
- Formulas giving prime numbers under Cramér's conjecture
- Unconditional prime-representing functions, following Mills
- Some new results on gaps between consecutive primes
- Multiply perfect numbers of three different primes.
- scientific article; zbMATH DE number 3190408
- ON DIFFERENCES OF PRIMES IN SHORT INTERVALS UNDER THE RIEMANN HYPOTHESIS
- A Large Prime Gap
- On the Least Prime in Certain Arithmetic Progressions
Cited in
(9)- On Mill's method of concomitant variations
- Unconditional prime-representing functions, following Mills
- On Faster Integer Calculations Using Non-arithmetic Primitives
- A variation on Mills-like prime-representing functions
- A couple of transcendental prime-representing constants
- A topological property of certain Mills sets
- Topological properties and algebraic independence of sets of prime‐representing constants
- Transcendency of variants of Mills' constant
- Explicit estimate on primes between consecutive cubes
This page was built for publication: Determining Mills' Constant and a Note on Honaker's Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395409)