Exercise · ZW-PARTITION-GENERATING-FUNCTION-002 · ★☆☆ Basic

How many partitions does the integer 2 have?

Choose one option.

Show answer
  • A. 2

Explanation

The partitions of 2 are \(2\) and \(1+1\), two in total. Counting \(1+1\) twice gives 3, and forgetting \(2\) gives 1.

Study Enumerative combinatorics in ZWMath →

Review the concept: Partition generating function

The partition generating function is the formal series \(\sum_{n\ge 0} p(n)\,x^n\), where \(p(n)\) counts the partitions of the integer \(n\).

\[\sum_{n\ge 0} p(n)x^n=\prod_{k\ge 1}\frac{1}{1-x^k}\]

More practice problems: partition generating function

← ZW-PARTITION-GENERATING-FUNCTION-001 ZW-PARTITION-GENERATING-FUNCTION-003 →