The number of ways of dividing 52 cards among | vedclass

Name: PDF Generator App | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(a) For the first set number of ways $^{52}{C_{17}}$.

Now out of $35$ cards left $17$ cards can be put for second in $^{35}{C_{17}}$ ways similarly

Vedclass · Accepted Answer

$\frac{{52\;!}}{{{{(17\;!)}^3}}}$

Vedclass · Answer

(a) For the first set number of ways $^{52}{C_{17}}$.

Now out of $35$ cards left $17$ cards can be put for second in $^{35}{C_{17}}$ ways similarly for $3$ rd in $^{18}{C_{17}}$.

One card for the last set can be put in only one way.

Therefore the required number of ways for the proper distribution

$ = \frac{{52\,!}}{{35\,!\,17\,!}} 	imes \frac{{35\,!}}{{18\,!\,17\,!}} 	imes \frac{{18\,!}}{{17\,!\,1\,!}} 	imes 1\,! = \frac{{52\,!}}{{{{(17\,!)}^3}}}$.

The number of ways of dividing $52$ cards amongst four players so that three players have $17$ cards each and the fourth player just one card, is

Similar Questions

Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-

The English alphabet has $5$ vowels and $21$ consonants. How many words with two different vowels and $2$ different consonants can be formed from the alphabet?

Number of different words that can be formed from all letters of word $APPLICATION$ such that two vowels never come together is -

$^n{C_r}{ + ^{n - 1}}{C_r} + ......{ + ^r}{C_r}$ =

Six ‘$+$’ and four ‘$-$’ signs are to placed in a straight line so that no two ‘$-$’ signs come together, then the total number of ways are