This preview shows page 1. Sign up to view the full content.
Unformatted text preview: concerns Chapter 3. 5 Without using any asymptotic bounds for p ( n ), prove that p ( n ) grows faster than any polynomial. That is, if f ( n ) is any polynomial, prove that there is some integer N such that p ( n ) > f ( n ) for all n > N . 6 Suppose that 1 k < n . Prove that the part k occurs a total of ( nk + 3)2 nk2 times among all the 2 n1 compositions of n . For example, if n = 4 and k = 2, then the part 2 occurs once in 2 + 1 + 1, 1 + 2 + 1, and 1 + 1 + 2, and twice in 2 + 2, for a total of 5 = (42 + 3)2 422 times. 1 Rooks can attack pieces in their same row or column only....
View
Full
Document
This note was uploaded on 12/10/2011 for the course MAD 4203 taught by Professor Vetter during the Fall '10 term at University of Florida.
 Fall '10
 Vetter

Click to edit the document details