In number theory, a partition of a positive integer \( n \) is a way of writing \( n \) as the sum of positive integers, where the order of the summands does not matter. For example, the integer \( 4 \) can be partitioned into the following distinct sums: 1. \( 4 \) 2. \( 3 + 1 \) 3. \( 2 + 2 \) 4.
