Asked by Anonymous
Show the number of partitions of n in which only odd parts may be repeated equals the number of partitions of n in which no part appears more than three times
Answers
Answered by
Steve
Take a look here:
http://math.stackexchange.com/questions/54961/the-number-of-partitions-of-n-into-distinct-parts-equals-the-number-of-partiti
and I think you will see how to build the proof you want.
http://math.stackexchange.com/questions/54961/the-number-of-partitions-of-n-into-distinct-parts-equals-the-number-of-partiti
and I think you will see how to build the proof you want.
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.