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

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

1 ...

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

View Full Document
2
3 Note. Can you explain why the right hand side of the equation is equal to 2 n ?

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

View Full Document
4
5

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

View Full Document
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.
7 Show that the number of partitions of a positive integer n where no summand appears more

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

View Full Document
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
Ask a homework question - tutors are online