nat_partition_bounded_count
def
The number of partitions of m all of whose parts are at most k. Equivalently, the number of partitions of m into parts of size at most k.
Statement
def nat_partition_bounded_count (k m : ℕ) : ℕ- Source
- step towards strict_counterexample_family_canonical_star_bound
- Verified
- 27 Oct 2026
- Axioms
- none listed
Lean source view module on GitHub
def nat_partition_bounded_count (k m : ℕ) : ℕ := Fintype.card {p : Nat.Partition m // ∀ x ∈ p.parts, x ≤ k}