Partitions of Integers
Ways to write n as a sum of positive integers.
Key idea
Ways to write n as a sum of positive integers.
In depth
A partition writes n as a sum of positive integers, ignoring order. The count p(n) grows quickly and has no simple formula, but generating functions describe it.
Worked example
p(5) = 7: 5, 4+1, 3+2, 3+1+1, 2+2+1, 2+1+1+1, 1+1+1+1+1.
Real-world uses
- Counting ways to make change from coins or to split a total into parts in combinatorics
Common mistake
Counting 3+2 and 2+3 as different.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Partitions of Integers?
Ways to write n as a sum of positive integers. It is a topic at the expert level in Discrete Math & Number Theory.
Where is Partitions of Integers used in real life?
Real-world examples: Counting ways to make change from coins or to split a total into parts in combinatorics.
What should I learn before Partitions of Integers?
Make sure you are comfortable with Stirling Numbers, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Partitions of Integers?
Counting 3+2 and 2+3 as different.
How can I practise Partitions of Integers?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Partitions of Integers?
Move on to Generating Functions next.
Related expert topics in Discrete Math & Number Theory
- Strong Induction – Assume all earlier cases to prove the next.
- Well-Ordering Principle – Every nonempty set of positive integers has a least element.
- Partial Orders – Reflexive, antisymmetric, transitive relations.
- Cardinality of Sets – Comparing sizes of infinite sets.
- Countable and Uncountable Sets – ℕ and ℚ are countable; ℝ is not.
- Cantor’s Diagonal Argument – Proof that real numbers are uncountable.