Imagine that you are drawing from a deck of 52 cards. Determine the number of ways you can achieve the following 5-card hands drawn from the deck without repeats. a) A Straight (5 cards of sequential rank; may be a Straight Flush as described in part D). When considering the Ace, a straight could be Ace, 2, 3, 4, 5 or 10, Jack, Queen, King, Ace, but no other wrap-around is allowed (e.g., Queen, King, Ace, 2, 3 is not allowed). b) A Flush (5 cards of the same suit; may be a Straight Flush as described in part D) c) A Full House (3 cards of one rank and 2 cards of a single other rank) d) A Straight Flush (5 cards of sequential rank of the same suit)

Imagine that you are drawing from a deck of 52 cards. Determine the number of ways you can achieve the following 5-card hands drawn from the deck without repeats. a) A Straight (5 cards of sequential rank; may be a Straight Flush as described in part D). When considering the Ace, a straight could be Ace, 2, 3, 4, 5 or 10, Jack, Queen, King, Ace, but no other wrap-around is allowed (e.g., Queen, King, Ace, 2, 3 is not allowed). b) A Flush (5 cards of the same suit; may be a Straight Flush as described in part D) c) A Full House (3 cards of one rank and 2 cards of a single other rank) d) A Straight Flush (5 cards of sequential rank of the same suit)

College Algebra

1st Edition

ISBN:9781938168383

Author:Jay Abramson

Publisher:Jay Abramson

Chapter9: Sequences, Probability And Counting Theory

Section9.5: Counting Principles

Problem 40SE: A family consisting of 2 parents and 3 children is to pose for a picture with 2 family members in...

See similar textbooks