Solved: Show that if n is a positive integer, then the
Chapter 7, Problem 7.4.55(choose chapter or problem)
Show that if n is a positive integer, then the number of partitions of n into distinct parts equals the number of partitions of n into odd parts with repetitions allowed; that is, po(n) = pd (n). [Hint: Show that the generating functions for po(n) and Pd (n) are equal.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer