Theorems · Theorem · number theory
Choose.primeFactors_gcd_choose_of_isPrimePow
∀ {n : ℕ}, IsPrimePow n → ((Finset.Icc 1 (n - 1)).gcd n.choose).primeFactors = {n.minFac}- Defined in
- Mathlib.Data.Nat.Choose.Lucas
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 114 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Factproof · cited by 2,726
- Nat.Primeproof · cited by 2,059
- Nat.choosestatement and proof · cited by 494
- Finset.Iccstatement and proof · cited by 348
- Nat.primeFactorsstatement and proof · cited by 129
- multiplicityproof · cited by 117
- IsPrimePowstatement and proof · cited by 77
- Nat.minFacstatement and proof · cited by 72
- Finset.gcdstatement and proof · cited by 49
- Nat.choose_one_rightproof · cited by 29
- Nat.minFac_dvdproof · cited by 24
Cited by1
Results whose statement or proof uses this declaration.
- Choose.gcd_choose_eq_minFac_of_isPrimePowproof · cited by 0