utpb.instructure.com ubmit IC 2.4-17 (Mar 1) Sign In or Sign Up i Ch D Question
ID: 3055622 • Letter: U
Question
utpb.instructure.com ubmit IC 2.4-17 (Mar 1) Sign In or Sign Up i Ch D Question 8 4 pts Let S be the set of sequences of seven cards, in which no card is repeated You can think of it as all the ways to deal seven cards, where the order of the deal matters. Each card has one of thirteen face value. A face value may be the number of pips', such as two or seven. In addition, there are four special face values: ace, king, queen and jack. Let C be the subset of sequences in which the seven cards have seven different face values. What is the size of C? (You may give your answer as a product.) 6 pts Question 9Explanation / Answer
The cards in the subset C can have any of the 13 face values, without repeatation. The possible combinations is equivalent to selecting 7 values out of the 13 values.
So size of C = C [13,7] = (13!) / (7!6!) = (13x12x11x10x9x8) / (6x5x4x3x2x1) = 1716
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.