Solveeit Logo

Question

Question: A card is drawn at random from a well shuffled pack of \(52\) cards. The probability of getting a tw...

A card is drawn at random from a well shuffled pack of 5252 cards. The probability of getting a two of heart or two of diamonds is
1)$$$\dfrac{1}{{26}}$ 2)\dfrac{2}{{17}}$ $$3)\dfrac{1}{{13}}$
4)$$$$None{\text{ }}of{\text{ }}these

Explanation

Solution

Hint : We have to find the probability of getting two of hearts or a two of diamonds . We solve this question using the knowledge of cards and also the concept of permutation and combination . We first find the total possible arrangements and also the favourable outcomes using the formula of combination . The probability is given by favourable outcomes to the total possible arrangements .

Complete step-by-step answer :
Given :
Total number of cards = 52 = {\text{ }}52
Number of cards drawn = 1 = {\text{ }}1
Total number of favourable outcome = a two of heart or a two of black
( as in a deck of cards there is only one two of heart and only one two of diamond )
Total number of favourable outcome = 1 + 1 = {\text{ }}1{\text{ }} + {\text{ }}1
Total number of favourable outcome= 2 = {\text{ }}2
We have to choose only one card from the deck
So ,
The favourable outcomes = 2C1 = {\text{ }}{}^2{C_1}
Total possible outcome = 52C1 = {\text{ }}{}^{52}{C_1}
Now ,
The probability of getting a two of heart or a two of diamond = 2C1  52C1 = \dfrac{{{\text{ }}{}^2{C_1}{\text{ }}}}{{{\text{ }}{}^{52}{C_1}}}
Using the formula of combination
nCr= n!r! × (n  r)!{}^n{C_r} = {\text{ }}\dfrac{{n!}}{{r!{\text{ }} \times {\text{ }}\left( {n{\text{ }} - {\text{ }}r} \right)!}}
On solving , we get
The required probability = 252 = {\text{ }}\dfrac{2}{{52}}
After cancelling the term
The required probability = 126 = {\text{ }}\dfrac{1}{{26}}
Hence , the required probability of getting a two of heart or two of diamonds is126\dfrac{1}{{26}} .
Thus , the correct option is (1)\left( 1 \right)
So, the correct answer is “Option 1”.

Note : Corresponding to each combination of nCr{}^n{C_r} we have r!r! permutations, because rr objects in every combination can be rearranged in r!r! ways . Hence , the total number of permutations of nndifferent things taken rr at a time is nCr× r!{}^n{C_r} \times {\text{ }}r! . Thus   nPr = nCr × r! , 0< r n\;{}^n{P_r}{\text{ }} = {\text{ }}{}^n{C_r}{\text{ }} \times {\text{ }}r!{\text{ }},{\text{ }}0 < {\text{ }}r{\text{ }} \leqslant n
Also , some formulas used :
nC1= n{}^n{C_1} = {\text{ }}n
nC2 = n(n1)2{}^n{C_2}{\text{ }} = {\text{ }}\dfrac{{n\left( {n - 1} \right)}}{2}
nC0 = 1{}^n{C_0}{\text{ }} = {\text{ }}1
nCn= 1{}^n{C_n} = {\text{ }}1