Guichard-Combinatorics-Graph-Theory · Problem 3.3.7
Generating Functions
Mathematics — Probability · partitions-ferrers-diagrams
Problem
A partition of n is self-conjugate if its Ferrers diagram is symmetric around the main diagonal, so that its conjugate is itself. Show that the number of self-conjugate partitions of n is equal to the number of partitions of n into distinct odd parts.