OAI/NumberTheory/TotientAsymptotic/LoglogGrid.lean

GitHub source file

6 declarations, 0 contain sorry, 0 declared as axioms

Integer cutoffs on the unit log-log grid used in Ford's counting argument.

  1. def OAI.TotientAsymptotic.loglogCutoff line 9
  2. lemma OAI.TotientAsymptotic.loglogCutoff_mono line 11
  3. lemma OAI.TotientAsymptotic.loglogCutoff_bounds line 15
  4. lemma OAI.TotientAsymptotic.loglogCutoff_lt_of_lt_B line 42
  5. lemma OAI.TotientAsymptotic.loglog_grid_index_bounds line 51
  6. lemma OAI.TotientAsymptotic.loglog_grid_prime line 66

    Source documentation

    Every sufficiently large prime coordinate has an integer cutoff strictly below the prime and loses at most three in its log-log coordinate.

    lemma loglog_grid_prime {p : ℕ} (hp : 1 < p) (hBp : 4 ≤ B p) :
    let k := ⌊B p⌋₊-1
…

    Mentions: OAI.TotientAsymptotic.B