Problemintro
Uniform random subset
Also called sampling without replacement, random k-subset.
Choose k distinct items from n so that every k-subset is equally likely.
Choose k distinct items from n so that every k-subset is equally likely.
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 FZMWQ7 Edit this page History Report an error