I can show that $\sum\limits_{k=1}^m{P_k(n)} = P_m(n+m)$ with induction, but I can't figure out how to create an argument based on Ferrers diagrams which proves this equation.
Any hints in the right direction would be appreciated.
I can show that $\sum\limits_{k=1}^m{P_k(n)} = P_m(n+m)$ with induction, but I can't figure out how to create an argument based on Ferrers diagrams which proves this equation.
Any hints in the right direction would be appreciated.
Copyright © 2021 JogjaFile Inc.
HINT: Start with a Ferrers diagram for a partition of $n+m$ into $m$ parts and remove the leftmost column. What remains is a Ferrers diagram for what? Then show that the correspondence is reversible.