Solve it ans is 1170
Attachments:
Answers
Answered by
7
Queries in comment section.
Attachments:
ZiaAzhar89:
by solving it is 1152
Answered by
6
heyy sis or di ✌✌✌✌❤✌✌✌✌
11 players can be selected out of 15 in 15C11ways = 15C4 = (15.14.13.12) / (1.2.3.4) = 1365 ways.
Since a particular player must be included, we have to select 10 more out of remaining 14 players. This can be done in 14C10 = 14C4 = (14.13.12.11)/(1.2.3.4) = 1001 ways.
Since a particular player must be always excluded, we have to choose 11 players out of remaining 14. This can be done in14C11 ways = 14C3 = (14.13.12)/(1.2.3) = 364 ways.
One leg spinner can be chosen out of 2 in² C1= 2 ways. Then we have to select 10 more players out of 13 (because second leg spinner can't be included). This can be done in13C10ways = 13C3 = (13.12.11)/(1.2.3) = 286 ways. Thus required number of combinations = 2×286 = 572
HOPE IT HELPS U ❤❤❤✌❤❤❤
11 players can be selected out of 15 in 15C11ways = 15C4 = (15.14.13.12) / (1.2.3.4) = 1365 ways.
Since a particular player must be included, we have to select 10 more out of remaining 14 players. This can be done in 14C10 = 14C4 = (14.13.12.11)/(1.2.3.4) = 1001 ways.
Since a particular player must be always excluded, we have to choose 11 players out of remaining 14. This can be done in14C11 ways = 14C3 = (14.13.12)/(1.2.3) = 364 ways.
One leg spinner can be chosen out of 2 in² C1= 2 ways. Then we have to select 10 more players out of 13 (because second leg spinner can't be included). This can be done in13C10ways = 13C3 = (13.12.11)/(1.2.3) = 286 ways. Thus required number of combinations = 2×286 = 572
HOPE IT HELPS U ❤❤❤✌❤❤❤
Similar questions