Home
Class 11
MATHS
Permutations and combinations lec 1...

Permutations and combinations lec 1

Promotional Banner

Similar Questions

Explore conceptually related problems

find the number of permutation and combination of 4 letters taken from the word ARYABHATTA

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.

The letters of the word COCHIN are permuted and all the permutations are arranged in an alphabetical order s in an English dictionary. The number of words that appear before the word COCHIN is a. 360 b. 192 c. 96 d. 48

The letters of the word COCHIN are permuted and all the permutations are arranged in an alphabetical order s in an English dictionary. The number of words that appear before the word COCHIN is a. 360 b. 192 c. 96 d. 48

How many permutations can be made out of the letters of the word TRIANGLE ? How many of these will begin with T and end with E ?

How many permutations can be made out of the letters of the word 'TRIANGLE ' ? How many of these will begin with T and end with E ?

Consider all possible permutations of the letters of the word ENDEANOEL . The number of permutations containing the word ENDEA is

STATEMENT-1 :The total number of combinations of n thing by taking some or all is 2^(n) . STATEMENT -2 : 5 identical balls can be distributed among 10 identical boxes in only one way if not more than one ball can go into a box. STATEMENT-3 : In the permutations of n things taken r at a time , the number of permutations in which m particular things occur together is ""^(n - m)P_(r - m) * ""^(r)P_(m)

In the permutations of n things r, taken together, the number of permutations in which m particular things occur together is ""^(n-m)P_(r-m)xx""^(r)P_(m) .

There are 4n things of which n are alike and the rest different. Find the number of permutations of 4n things taken 2n at a time, each permutation containing the n like things.