184a_99w_fe

184a_99w_fe - Math 184A Final Exam 811AM Monday 12/13/99 1....

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

View Full Document Right Arrow Icon
Math 184A Final Exam 8–11AM Monday 12/13/99 1. AUTOMATIC contains 2 pairs of repeated letters and 7 distinct letters for a total of 9 letters. For 4 n 7, find a formula for the number of n -letter “words” that can be made from this collection of letters. Your answer should be a formula involving n , not 4 separate numbers for n =4 , 5 , 6 , 7. 2. Let P k ( n ) be the number of permutations of the set { 1 ,...,n } having no cycles of length greater than k .Thu s P 1 ( n ) = 1 for n> 0 since all cycles are of length 1. For later convenience, define P k ( n )= 0 , if n< 0 1 , if n =0. (a) By considering the cycle containing n +1, prove that P 2 ( n +1) = P 2 ( n )+ nP 2 ( n - 1) for n 0. (Be careful for small values of n .) (b) State and prove a similar recursion for P 3 ( n + 1). 3. Define a “special” tree to be a rooted plane tree which is either a single vertex (the root) or a root vertex that is joined to either a left tree or a right tree or both a left and right tree.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 2

184a_99w_fe - Math 184A Final Exam 811AM Monday 12/13/99 1....

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

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