A new theorem on the prime-counting function

Abstract: For

x > 0

let

p i (x)

denote the number of primes not exceeding

x

. For integers

a

and

m > 0

, we determine when there is an integer

n > 1

with

p i (n) = (n + a) / m

. In particular, we show that for any integers

m > 2

and

a l e l c e i l e^{m - 1} / (m - 1) c e i l

there is an integer

n > 1

with

p i (n) = (n + a) / m

. Consequently, for any integer

m > 4

there is a positive integer

n

with

p i (m n) = m + n

. We also pose several conjectures for further research; for example, we conjecture that for each

m = 1, 2, 3, l d o t s

there is a positive integer

n

such that

m + n

divides

p_{m} + p_{n}

, where

p_{k}

denotes the

k

-th prime.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: A new theorem on the prime-counting function