This preview shows page 1. Sign up to view the full content.
Unformatted text preview: proof. The idea of the proof is the “stars and bars” notation for a multichoice. The notation is that, if you are choosing elements from [ n ] , you should list a star for each time you choose 1, then a separator bar, then a star for each time you choose 2, then a separator, and so on. For example, if you choose { 1 , 1 , 2 , 4 } from [ 4 ] , then in stars and bars notation it is ??  ?  ? . Prove that the elements of (( n k )) can be expressed with a string of n1 bars and k stars, and then use that to prove the identity (1). 1...
View
Full
Document
This note was uploaded on 05/19/2010 for the course MATH mat 146 taught by Professor Gregkuperberg during the Spring '10 term at UC Davis.
 Spring '10
 GregKuperberg

Click to edit the document details