Theorems · Theorem · number theory
Choose.minFac_sq_ndvd_gcd_choose_of_isPrimePow
∀ {n : ℕ}, IsPrimePow n → ¬n.minFac ^ 2 ∣ (Finset.Icc 1 (n - 1)).gcd n.choose- Defined in
- Mathlib.Data.Nat.Choose.Lucas
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatproof · cited by 4,985
- Nat.Primeproof · cited by 2,059
- Nat.choosestatement and proof · cited by 494
- Finset.Iccstatement · cited by 348
- pow_ne_zeroproof · cited by 208
- emultiplicityproof · cited by 156
- Nat.Prime.one_ltproof · cited by 118
- Nat.Prime.ne_zeroproof · cited by 109
- Nat.logproof · cited by 101
- IsPrimePowstatement and proof · cited by 77
- Nat.minFacstatement and proof · cited by 72
- Finset.gcdstatement · cited by 49
Cited by1
Results whose statement or proof uses this declaration.
- Choose.gcd_choose_eq_minFac_of_isPrimePowproof · cited by 0