Theorems · Theorem · number theory
Nat.factorization_lcmUpto
∀ (n : ℕ) {p : ℕ}, Nat.Prime p → n.lcmUpto.factorization p = Nat.log p n- Defined in
- Mathlib.NumberTheory.Chebyshev
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 99 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsuppstatement · cited by 5,255
- mul_oneproof · cited by 3,885
- LE.le.transproof · cited by 3,151
- Nat.cast_oneproof · cited by 2,501
- le_antisymmproof · cited by 2,068
- le_reflproof · cited by 2,061
- Nat.Primestatement and proof · cited by 2,059
- Nat.cast_zeroproof · cited by 1,870
- Finsupp.singleproof · cited by 943
- le_imp_le_of_le_of_leproof · cited by 576
- Finset.supproof · cited by 530
Cited by3
Results whose statement or proof uses this declaration.
- Nat.primeFactors_lcmUptoproof · cited by 2
- Nat.lcmUpto_eq_prod_pow_logproof · cited by 2
- Chebyshev.choose_dvd_lcmUptoproof · cited by 1