This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n letters into a colored permutation on n-1 letters, and some colored object for which there are 1 + x + x 2 + + x n-1 choices. (Hint: It looks scary, but it is a lot like the proof that the number of permutations is n !, which is the x = 1 case of the problem.) GK3.2. Prove that the ordinary generating function for Bell numbers, L ( x ) = n = 1 b ( n ) x n , has 0 radius of convergence. (Hint: There are several ways to do this. One way is to show that b ( 2 n ) n ! with an explicit injection from permutations on n letters to partitions of 2 n letters.) *GK3.3. Find a counting proof of this fact for positive integers n and ` : ` k = 1 n k ` ! ( `-k ) ! = ` n . (Starred problems are extra credit, and I do not usually give hints for those.) 1...
View Full Document
- Spring '10