OAI/NumberTheory/CubicMoment/Estimates/PrimaryPrimeUpper.lean

GitHub source file

2 declarations, 0 contain sorry, 0 declared as axioms

The elementary counting upper bound needed in the smooth-number Rankin argument, derived from the existing ordinary prime PNT input.

  1. lemma OAI.CubicFirstMoment.primaryPrimeCount_mono line 11
  2. theorem OAI.CubicFirstMoment.primaryPrimeCount_upper line 19