Theorems · Theorem · number theory
Nat.card_divisors
∀ {n : ℕ}, n ≠ 0 → n.divisors.card = ∏ x ∈ n.primeFactors, (n.factorization x + 1)- Cited by
- 0 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- Finset.prodstatement and proof · cited by 2,356
- Finset.cardstatement · cited by 2,327
- Finset.prod_congrproof · cited by 646
- Nat.factorizationstatement and proof · cited by 215
- Nat.divisorsstatement · cited by 137
- Nat.primeFactorsstatement and proof · cited by 129
- ArithmeticFunction.sigmaproof · cited by 40
- Nat.prime_of_mem_primeFactorsproof · cited by 29
- ArithmeticFunction.IsMultiplicative.multiplicative_factorizationproof · cited by 6
- ArithmeticFunction.isMultiplicative_sigmaproof · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.