Problemintro
Enumerating k-subsets (combinations)
Also called generating combinations, k-combinations enumeration, listing all k-element subsets.
List all C(n,k) ways to choose k elements from an n-set, each exactly once.
List all C(n,k) ways to choose k elements from an n-set, each exactly once.
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 9TN7DN Edit this page History Report an error