Factorial pow floor divisibility factorial
ProvedErdosProblems.Erdos68.factorial_pow_floor_dvd_factorialerdos-68factorial-momentformalization
For positive d and any i, (d factorial) to the power floor(i/d) divides i factorial.
Preamble
import Definitions.Def_ErdosProblems_Erdos68_FactorialChannelCertificate import Lean.Elab.Tactic.Omega import Mathlib.Data.Finsupp.Basic import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Choose.Multinomial import Mathlib.Data.Rat.Lemmas import Mathlib.NumberTheory.Divisors import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.NormNum.NatFactorial import Mathlib.Tactic.Ring /-! # Erdős #68: factorial-channel certificates For each divisor channel `d`, the weight `i! / (d!)^(⌊i/d⌋)` is integral, and consecutive weights obey the factorial recurrence except at indices divisible by `d`. The coefficient vector `λ = 2e₃ - e₄` then gives an explicit finite certificate: its channel values and factorial moment can be computed exactly, and the stated elementary enclosure for the remaining tail places its residual strictly between `-1` and `0`. This is a single finite certificate. It does not supply a cofinal family of nonzero residuals or prove irrationality of the Erdős #68 series. -/ open ErdosProblems.Erdos68
Formal statement
theorem ErdosProblems.Erdos68.factorial_pow_floor_dvd_factorial
(i d : ℕ) (hd : 0 < d) :
d.factorial ^ (i / d) ∣ i.factorial := by sorry
Source
Pinned Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/fcb1eff5111efabc25fcf3dfcd6ec48d42ef345c/ErdosProblems/Erdos68/FactorialChannelCertificate.lean#L28-L39
Correspondence: finite channel-moment analysis for Erdős #68. No novelty or whole-problem claim.