Consider an ordinary deck of 52 playing cards with four suits (hearts, spades, diamonds, clubs) and 13 ranks in each suit (A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K). You pick cards from the deck one at a time without replacement. What is the minimum number of cards you must pick in order to guarantee that you get: a) a pair of any rank, b) two aces, and c) all four aces.

College Algebra
7th Edition
ISBN:9781305115545
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:James Stewart, Lothar Redlin, Saleem Watson
Chapter9: Counting And Probability
Section: Chapter Questions
Problem 3CC: (a) What is a combination of r elements of a set? How many combinations are there of n elements...
icon
Related questions
Question

Consider an ordinary deck of 52 playing cards with four suits (hearts, spades, diamonds,
clubs) and 13 ranks in each suit (A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K). You pick cards from the deck one
at a time without replacement. What is the minimum number of cards you must pick in order to
guarantee that you get:
a) a pair of any rank,
b) two aces, and
c) all four aces.

I'm really confused of how this would be solved. Please include detailed steps for this.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,