Question: For integers n, k > 0 let P1 be the number of partitions of n. P2 be the number of partitions of In

For integers n, k > 0 let
• P1 be the number of partitions of n.
• P2 be the number of partitions of In + k, where n + k is the greatest summand.
• P3 be the number of partitions of 2n + k into precisely n + k summands.
Using the concept of the Ferrers graph, prove that P1 = P2 and P2 = P3, thus concluding that the number of partitions of 2n + k into precisely n + k summands is the same for all k.

Step by Step Solution

3.50 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

For each partition of n place a row of n k dots above the top row in its Ferrers ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8058).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!