ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let π(x)\pi(x) be the prime-counting function. For a positive integer cc, let Ik=[(k−1)c,kc)I_k=[(k-1)c,kc) and define χIk=1\chi_{I_k}=1 if IkI_k contains one or more primes, and χIk=0\chi_{I_k}=0 otherwise. Characteristic-function interval inequality. For any m2>m1>0m_2>m_1>0, with m2m_2 and m1m_1 sufficiently large, and any c>2c>2, one has

1c(π(m2c)−π(m1c))⩽∑k=m1m2χIk<π(m2c)−π(m1c).\frac{1}{c}\bigl(\pi(m_2c)-\pi(m_1c)\bigr)\leqslant\sum_{k=m_1}^{m_2}\chi_{I_k}<\pi(m_2c)-\pi(m_1c).

The inequality follows directly from counting prime-containing intervals, and the supplied text presents the claim without a conjectural status or resolution; its formulation is closely related to an elementary proposition earlier in the paper.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.