Theorems · Theorem · number theory
Chebyshev.choose_dvd_lcmUpto
∀ {n k : ℕ}, k ≤ n → n.choose k ∣ n.lcmUptolcmUpto n is divisible by choose n k for all k ≤ n
- Defined in
- Mathlib.NumberTheory.Chebyshev
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Nat.Primeproof · cited by 2,059
- Nat.choosestatement and proof · cited by 494
- Nat.factorizationproof · cited by 215
- Nat.lcmUptostatement · cited by 13
- Nat.choose_ne_zeroproof · cited by 4
- Nat.lcmUpto_ne_zeroproof · cited by 4
- Nat.factorization_lcmUptoproof · cited by 3
- Nat.factorization_choose_le_logproof · cited by 3
- Nat.factorization_prime_le_iff_dvdproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- Chebyshev.two_pow_le_mul_lcmUptoproof · cited by 1