The upper-bound conjecture for primes between nn and knkn

From papers

Let kk be a positive integer, and let nn be a positive integer. The upper-bound conjecture for primes between nn and knkn. The number of primes between nn and knkn is at most

kn9+k2.\frac{kn}{9}+k^{2}.

The source presents this as an empirically motivated upper bound based on plotting and curve fitting; no proof or resolution is supplied.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Adway Mitra, Goutam Paul and Ushnish Sarkar, “Some Conjectures on the Number of Primes in Certain Intervals”, arXiv:0906.0104 (2009).

Solutions 0

No solutions have been posted yet.