Theorems · Definition · number theory
ArithmeticFunction.cardDistinctFactors
ArithmeticFunction ℕ
ω n is the number of distinct prime factors of n.
- Cited by
- 13 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ArithmeticFunctionstatement · cited by 290
- Nat.primeFactorsListproof · cited by 105
- List.dedupproof · cited by 47
Cited by13
Results whose statement or proof uses this declaration.
- ArithmeticFunction.cardDistinctFactors_applystatement · cited by 3
- Nat.card_finMulAntidiag_of_squarefreestatement and proof · cited by 1
- ArithmeticFunction.cardDistinctFactors_apply_prime_powstatement · cited by 1
- ArithmeticFunction.cardDistinctFactors_eq_one_iffstatement · cited by 1
- ArithmeticFunction.cardDistinctFactors_mulstatement · cited by 1
- ArithmeticFunction.cardDistinctFactors_onestatement · cited by 1
- Nat.card_pair_lcm_eqstatement · cited by 0
- ArithmeticFunction.cardDistinctFactors_apply_primestatement and proof · cited by 0
- ArithmeticFunction.cardDistinctFactors_eq_cardFactors_iff_squarefreestatement and proof · cited by 0
- ArithmeticFunction.cardDistinctFactors_eq_zerostatement · cited by 0
- ArithmeticFunction.cardDistinctFactors_posstatement · cited by 0
- ArithmeticFunction.cardDistinctFactors_prodstatement and proof · cited by 0