English

Determining Mills' Constant and a Note on Honaker's Problem

Number Theory 2013-01-28 v2

Abstract

In 1947 Mills proved that there exists a constant AA such that A3n\lfloor A^{3^n} \rfloor is a prime for every positive integer nn. Determining AA 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 AA 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.

Keywords

Cite

@article{arxiv.1010.4883,
  title  = {Determining Mills' Constant and a Note on Honaker's Problem},
  author = {Chris K. Caldwell and Yuanyou Furui Cheng},
  journal= {arXiv preprint arXiv:1010.4883},
  year   = {2013}
}

Comments

9 pages, published on Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.1

R2 v1 2026-06-21T16:33:10.832Z