Theorems · Definition · combinatorics
Nat.choose
ℕ → ℕ → ℕ
choose n k is the number of k-element subsets in an n-element set. Also known as binomial
coefficients. For the fact that this is the number of k-element-subsets of an n-element
set, see Finset.card_powersetCard.
- Defined in
- Mathlib.Data.Nat.Choose.Basic
- Cited by
- 494 results in Mathlib
- Foundations
- Depth 9 from the axioms, rests on 23 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by518
Results whose statement or proof uses this declaration.
- Nat.choose_zero_rightstatement and proof · cited by 55
- Complex.exp_addproof · cited by 55
- Nat.choose_selfstatement and proof · cited by 54
- Polynomial.bernoulliproof · cited by 41
- Nat.choose_eq_zero_of_ltstatement · cited by 35
- Nat.choose_one_rightstatement and proof · cited by 29
- bernsteinPolynomialproof · cited by 26
- Nat.centralBinomproof · cited by 24
- Nat.choose_succ_self_rightstatement · cited by 24
- add_powstatement · cited by 24
- bernoulli'proof · cited by 23
- Polynomial.hasseDerivproof · cited by 19
Showing the 200 most cited of 518.