OAI/NumberTheory/TotientAsymptotic/RenewalInput.lean

GitHub source file

2 declarations, 0 contain sorry, 0 declared as axioms

Discharge of Ford Lemma 3.7 by the concrete transformed recurrence.

  1. lemma OAI.TotientAsymptotic.regular_tail_bound line 11
  2. theorem OAI.TotientAsymptotic.fordRenewalInput line 32

    Source documentation

    The bounded renewal error assumed throughout the conditional development is now proved. A coarse explicit constant suffices for every application.

    theorem fordRenewalInput : FordRenewalInput := by
…

    Mentions: OAI.TotientAsymptotic.FordRenewalInput