9 - than twice equals the number of partitions of n where...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
1 ...
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2
Background image of page 2
3 Note. Can you explain why the right hand side of the equation is equal to 2 n ?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4
Background image of page 4
5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Using a Ferrers graph, show that the number of partitions of n is equal to the number of partitions of 2 n into n summands.
Background image of page 6
7 Show that the number of partitions of a positive integer n where no summand appears more
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: than twice equals the number of partitions of n where no summand is divisible by 3. 8 Find the generating function for the number of partitions of the nonnegative integer n into summands where a) each summand appears an even number of times. b) each summand is even....
View Full Document

This note was uploaded on 04/11/2011 for the course MACM 201 taught by Professor Marnimishna during the Spring '09 term at Simon Fraser.

Page1 / 8

9 - than twice equals the number of partitions of n where...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online