Unformatted text preview: D ( n,m ) = D ( n-1 ,m ) + D ( n,m-1) (5) How many permutations are there of a poker deck, in which the second ace (that is, second in the order of the permutation) is at the k th position. ±or what k is this number the greatest? (I.e. if you want to bet that from a shu²ed poker deck, what is the position of the second ace, what would be the bet that maximizes the probability of winning?) 1...
View Full Document
This note was uploaded on 01/12/2012 for the course MATH 681 taught by Professor Wildstrom during the Fall '09 term at University of Louisville.
- Fall '09