Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


There is an absolute c>0c>0 such that, for real y≥10y\ge10 and every interval I⊂[2,y]I\subset[2,y],

#{p∈I:p prime}=∫Idtlog⁡t+O ⁣(ye−clog⁡y).(1)\#\{p\in I:p\text{ prime}\} =\int_I\frac{dt}{\log t} +O\!\left(y e^{-c\sqrt{\log y}}\right). \tag{1}

The interval may be open, closed, half-open, empty or a singleton.

Proof. For endpoints 2≤a≤b≤y2\le a\le b\le y, subtract the two formulas in external PNT (1). Changing endpoint inclusion changes the prime count by at most two. The integral ignores single endpoints. The PNT error at an endpoint t≤yt\le y is bounded by O(ye−c′log⁡y)O(y e^{-c'\sqrt{\log y}}) with a possibly smaller fixed c′>0c'>0: the function te−clog⁡tt e^{-c\sqrt{\log t}} is increasing for all sufficiently large tt, and the remaining bounded range is absorbed into the constant. The error at t<10t<10 is also bounded and is absorbed for y≥10y\ge10. This proves (1), including degenerate intervals. □\square

This is a complete deduction from the specified external PNT, not a proof of the PNT itself.

Source. Tao, published paper, published p.799, Lemma 1.6. This page uses that published version.

Bears on. Problem 49.