This preview shows page 1. Sign up to view the full content.
Unformatted text preview: p 1 ( n ) = 1 for n 0, prove by induction that p 2 ( n ) = n + 2 2 , if n is even, n + 1 2 , if n is odd. Hint : Do n = 0 and n = 1 separately before starting the induction. 3. Consider the (strictly) decreasing functions from 3 to 11 . (a) Show that there are 165 of them. (b) If these functions are arranged in lex order, nd the function that is in the exact middle of the list. 4. (a) Find the 7leaf binary RPtree whose rank is 77. (b) Find the rank of the tree END OF EXAM...
View
Full
Document
This note was uploaded on 06/18/2009 for the course MATH 184a taught by Professor Staff during the Winter '08 term at UCSD.
 Winter '08
 staff
 Math

Click to edit the document details