184a_99w_2e

184a_99w_2e - p 1 ( n ) = 1 for n 0, prove by induction...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Math 184A Second Midterm 3/10/99 Each problem is worth 12 points. Please start each problem on a new page. 1. Find a minimum weight spanning tree for the graph shown below. Vertices are indi- cated by letters and weights of edges are given numerically next to the edges. The graph was drawn by hand and is not available. 2. For k> 0, let p k ( n ) be the number of partitions of the integer n into at most k nonzero parts. Define p k (0) = 1 For example, p 3 (6) = 7 because 6=1+5=2+4=3+3=1+1+4=1+2+3=2+2+2 . (a) Prove that p k ( n )= p k - 1 ( n ) , if n<k , p k - 1 ( n )+ p k ( n - k ) , if n k . Hint : If there are k nonzero parts, decrease each part by 1. (b) Using the result in (a) and the fact that
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 7-leaf binary RP-tree 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.

Ask a homework question - tutors are online