Similarly, if we start off we a partition of n into parts whose largest addend is r, s1+s2+· · ·+sm,
then we can make the new partition, t1 +t2 +· · ·+th, where each ti represents the number of (sj )’s
as large as i. Since the largest addend is r, we will have exactly r terms in this partition.