Explanation
It is a fundamental property.
It is obvious and can be checked by putting the values. Since other three sets do not hold good.
Each question can be answered in 4 ways and all question can be answered correctly in only one way, so, required number of ways = 43 - 1 = 63
Required number = 10C5 x 8C4 .
Since 5 are always to be excluded and 6 always to be included, therefore 5 players to be chosen from 14.Hence required number of ways are 14C5 = 2002.
The arrangement can be make as .+.+.+.+.+.+. i.e., the (-) signs can be put in 7 vacant (pointed) place. Hence required number of ways = 7C4 + 35.
A voter can vote in 5C1 + 5C2 + 5C3 = 25 ways.
Required number of ways = 30C3 - 15C3 = 3605.
Required number of ways = 210 - 1.
[Since the case that no friend be invited i.e., 10C0 is excluded]
Since the total number of selections of r things from n things where each thing can be repeated as many times as one can, is n + r - 1Cr.
Therefore the required number of ways = 3 + 6 - 1C6 = 28
The required number of ways = 3 + 35 - 1C3 - 1 = 37C2 = 666.
Alilter : The required number = Coefficient of x35 in (1 + x + x2 + .......+ x35)3.
12C5 x 2 = 1584
210
Each place two values.
Since each ring has 15 positions.
∴ total no. of attempts that can be made to open the lock = 153
Out of these, there is just one attempt in which the lock will open.
∴ N = 153 – 1 = (15 – 1) (152 + 15 + 1)
= 2.7.241
Clearly 482/N and N is a product of three distinct prime nos.
1729 = 13 + 123 = 93 + 103
If n is a + ve integer, then
1729 n3 = n3 (12n)3 = (9n)3 (10n)3
∴ reqd. no. of ways = ∞.
Please disable the adBlock and continue. Thank you.