Problemcore
Counting integer partitions
Also called partition function p(n).
Computing the number of ways to write n as an unordered sum of positive integers.
Computing the number of ways to write n as an unordered 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 0EN12C Edit this page History Report an error