
From the pack of 52 playing cards, all the king and queen of the black and red suit are removed. A card is drawn randomly for the pack. Find the probability that the card is drawn is not a jack.
Answer
577.2k+ views
Hint: Here, we will use the formula to calculate combination is \[{}^n{C_r}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen. Then we will take \[n = 52\] and \[r = 5\] in the above way of combinations to find the distinct poker hands.
Complete step by step solution: We are given that the five-card stud is a poker game, in which a player is dealt 5 cards from an ordinary deck of 52 playing cards.
For this problem, it would be impractical for us to list all of the possible poker hands.
We know that the number of possible poker hands can be calculated using combinations.
We also know that the formula to calculate combinations is \[{}^n{C_r}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen.
Since we have 52 cards in the deck, so \[n = 52\].
Now we want to arrange them in unordered groups of 5, so here we have \[r = 5\].
Substituting these values of \[n\] and \[r\] in the above formula of combinations, we get
\[ \Rightarrow {}^{52}{C_5}\]
Therefore, there are \[{}^{52}{C_5}\] distinct poker hands.
Hence, option A is correct.
Note: In this problem, we need to remember that the order in which cards are dealt is not important, for example, if you dealt the ace, king, queen, jack, ten of spades, that is the same as being dealt the ten, jack, queen, king, ace of spades. The students can also make errors by calculating the combinations but we just have to find the way of calculating the required value. Here, students must take care while simplifying the conditions given in the question into the combinations.
Complete step by step solution: We are given that the five-card stud is a poker game, in which a player is dealt 5 cards from an ordinary deck of 52 playing cards.
For this problem, it would be impractical for us to list all of the possible poker hands.
We know that the number of possible poker hands can be calculated using combinations.
We also know that the formula to calculate combinations is \[{}^n{C_r}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen.
Since we have 52 cards in the deck, so \[n = 52\].
Now we want to arrange them in unordered groups of 5, so here we have \[r = 5\].
Substituting these values of \[n\] and \[r\] in the above formula of combinations, we get
\[ \Rightarrow {}^{52}{C_5}\]
Therefore, there are \[{}^{52}{C_5}\] distinct poker hands.
Hence, option A is correct.
Note: In this problem, we need to remember that the order in which cards are dealt is not important, for example, if you dealt the ace, king, queen, jack, ten of spades, that is the same as being dealt the ten, jack, queen, king, ace of spades. The students can also make errors by calculating the combinations but we just have to find the way of calculating the required value. Here, students must take care while simplifying the conditions given in the question into the combinations.
Recently Updated Pages
Master Class 11 Computer Science: Engaging Questions & Answers for Success

Master Class 11 Business Studies: Engaging Questions & Answers for Success

Master Class 11 Economics: Engaging Questions & Answers for Success

Master Class 11 Social Science: Engaging Questions & Answers for Success

Master Class 11 Chemistry: Engaging Questions & Answers for Success

Master Class 11 English: Engaging Questions & Answers for Success

Trending doubts
One Metric ton is equal to kg A 10000 B 1000 C 100 class 11 physics CBSE

Discuss the various forms of bacteria class 11 biology CBSE

Draw a diagram of a plant cell and label at least eight class 11 biology CBSE

State the laws of reflection of light

Explain zero factorial class 11 maths CBSE

10 examples of friction in our daily life

