This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: r = n, x i > m i y i Σ i = 1 r = n – Σ i = 1 r m r k 8 3 4 3 + 2 1 4 2 = 896 possible committees n – 1 r–k – 1 = n – 1 n – r + k P21 : Each path is a string of 7 characters, 4R’s(Right) and 3 U’s(Up). The number of paths corresponds to the number of ways of selecting the character positions for either the 4R’s (or equivalently the 3U’s). e.g., RRUURUR. P22 : There are Therefore there are P32: (a) Number of nonnegative solutions to is (b) Professor Heffes 7 4 = 35 4 2 paths from A to the circle and 3 2 paths from the circle to B. 4 2 3 2 = 18 paths from A to B passing through the circlethe circle x i Σ i = 1 6 = 8 13 5 # nonnegative solutions to x i Σ i = 1 6 = 5 # nonnegative solutions to y i Σ i = 1 6 = 3 = 10 5 8 5...
View
Full Document
 Spring '08
 sss
 Probability, Stochastic process, nonnegative solutions

Click to edit the document details