Problemcore
Enumerating combinations with repetition
Also called multisets of size k, multiset combinations.
List all multisets of size k drawn from an n-element set; there are C(n+k-1,k) of them.
List all multisets of size k drawn from an n-element set; there are C(n+k-1,k) of them.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag EGKQSH Edit this page History Report an error