A student is allowed to select at most n books from a collection of (2n+1) books. If the total number of ways in which a student selects at least one book is 63. then n equals to -

A person is permitted to selected at least one and at most n coins from a collection of (2n+1) distinct coins. If the total number o ways in which he can select coins is 255, find the value of ndot

Find the total number of way in which n distinct objects can be put into two different boxes

A team of four students is to be selected from a total of 12 students. The total number of ways in which the team can be selected such that two particular students refuse to be together and other two particular students wish to be together only is equal to a. 220 b. 182 c. 226 d. none of these

A library has a copies of one book, b copies each of two books, c copies each of three books, a single copy of d books. The total number of ways in which these books can be arranged in a shelf is equal to a. ((a+2b+3c+d)!)/(a !(b !)^2(c !)^3) b. ((a+2b+3c+d)!)/(a !(2b !)^(c !)^3) c. ((a+b+3c+d)!)/((c !)^3) d. ((a+2b+3c+d)!)/(a !(2b !)^(c !)^)

There are 'n' different books and 'p' copies of each. The number of ways in which a selection can be made from them is

There are two bags each of which contains n balls. A man has to select an equal number of balls from both the bags. Prove that the number of ways in which a man can choose at least one ball from each bag is^(2n)C_n-1.

Find the number of ways of selection of at least one vowel and one consonant from the word TRIPLE.

Two players P_1a n dP_2 play a series of 2n games. Each game can result in either a win or a loss for P_1dot the total number of ways in which P_1 can win the series of these games is equal to a. 1/2(2^(2n)-^ "^(2n)C_n) b. 1/2(2^(2n)-2xx^"^(2n)C_n) c. 1/2(2^n-^"^(2n)C_n) d. 1/2(2^n-2xx^"^(2n)C_n)

The total number of terms which are dependent on the value of x in the expansion of (x^2-2+1/(x^2))^n is equal to

In a certain an algebraical exercise book there and 4 examples on arithmetical progression, 5 examples on permutation and combination, and 6 examples on binomial theorem. Find the number of ways a teacher can select or his pupils at least one but not more than 2 examples from each of these sets.