Combinatorics and Graph Theory · Problem 3.3.7

Generating Functions — David Guichard

Mathematics — Combinatorics · partitions-ferrers-diagrams

Problem

A partition of nn 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 nn is equal to the number of partitions of nn into distinct odd parts.

Related theory

Browse the problem library