Dusart's bound on
ProvedDusartFinite.pi_le_div_log_sub_one_point_onenumber-theoryprime-counting
For every real with , the number of primes up to satisfies , where is the natural logarithm.
Preamble
import Mathlib
Formal statement
namespace DusartFinite
theorem pi_le_div_log_sub_one_point_one {x : ℝ} (h1 : 60184 ≤ x) (h2 : x ≤ 2 * 10 ^ 6) :
(Nat.primeCounting ⌊x⌋₊ : ℝ) ≤ x / (Real.log x - 1.1) := by
sorry
end DusartFiniteSource
P. Dusart, Estimates of some functions over primes without R.H., arXiv:1002.0442, Theorem 6.9, restricted to x ≤ 2·10^6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.