# Number of Distinct Partitions

**Computer Science**Level 4

Find the number of different ways to write N = 36 as the sum of positive integers.

Two sums that differ by the order of these positive integers is counted once.

As an example, if N were equal to 4 then it can written as

4

3 + 1

1 + 1 + 2

2 + 2

1 + 1 + 1 + 1

So the number of partitions of N = 4 is 5 partitions.

An excellent article of how to compute the partitions is contained on this page