Problemintro
Counting integer compositions
Also called ordered partitions of an integer.
Counting ways to write n as an ordered sum of positive integers.
Counting ways to write n as an ordered sum of positive integers.
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 Q0TYY4 Edit this page History Report an error