Advertisements
Advertisements
प्रश्न
Evaluate `(n!)/((n-r)!)`, when n = 9, r = 5
उत्तर
When n = 9, r = 5 `(n!)/((n-r)!) = (9!)/((9 - 5)!) = (9!)/(4!) = (9 xx 8 xx 7 xx 6 xx 5 xx 4!)/(4!)`
= 9 x 8 x 7 x 6 x 5 = 15120
APPEARS IN
संबंधित प्रश्न
Evaluate 8!
Is 3! + 4! = 7!?
Compute `(8!)/(6! xx 2!)`
How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit is repeated?
Find x in each of the following:
If three six faced die each marked with numbers 1 to 6 on six faces, are thrown find the total number of possible outcomes ?
Three dice are rolled. Find the number of possible outcomes in which at least one die shows 5 ?
In how many ways can 4 prizes be distributed among 5 students, when
(i) no student gets more than one prize?
(ii) a student may get any number of prizes?
(iii) no student gets all the prizes?
Evaluate each of the following:
8P3
In how many ways 4 women draw water from 4 taps, if no tap remains unused?
The number of words that can be formed out of the letters of the word "ARTICLE" so that vowels occupy even places is
The number of different signals which can be given from 6 flags of different colours taking one or more at a time, is
The number of six letter words that can be formed using the letters of the word "ASSIST" in which S's alternate with other letters is
The number of arrangements of the word "DELHI" in which E precedes I is
Number of all four digit numbers having different digits formed of the digits 1, 2, 3, 4 and 5 and divisible by 4 is
If the letters of the word KRISNA are arranged in all possible ways and these words are written out as in a dictionary, then the rank of the word KRISNA is
The product of r consecutive positive integers is divisible by
Find the number of arrangements that can be made out of the letters of the word “ASSASSINATION”.
Find the rank of the word ‘CHAT’ in the dictionary.
The possible outcomes when a coin is tossed five times:
For all n > 0, nC1 + nC2 + nC3 + …… + nCn is equal to:
The number of ways to arrange the letters of the word “CHEESE”:
The number of words with or without meaning that can be formed using letters of the word “EQUATION”, with no repetition of letters is:
Find the distinct permutations of the letters of the word MISSISSIPPI?
How many ways can the product a2 b3 c4 be expressed without exponents?
In how many ways can the letters of the word SUCCESS be arranged so that all Ss are together?
How many strings are there using the letters of the word INTERMEDIATE, if all the vowels are together
Find the number of strings that can be made using all letters of the word THING. If these words are written as in a dictionary, what will be the 85th string?
In how many ways can 5 children be arranged in a line such that two particular children of them are never together.
Find the number of permutations of n different things taken r at a time such that two specific things occur together.
The number of signals that can be sent by 6 flags of different colours taking one or more at a time is ______.
A five-digit number divisible by 3 is to be formed using the numbers 0, 1, 2, 3, 4 and 5 without repetitions. The total number of ways this can be done is ______.
Using the digits 1, 2, 3, 4, 5, 6, 7, a number of 4 different digits is formed. Find
| C1 | C2 |
| (a) How many numbers are formed? | (i) 840 |
| (b) How many number are exactly divisible by 2? | (i) 200 |
| (c) How many numbers are exactly divisible by 25? | (iii) 360 |
| (d) How many of these are exactly divisible by 4? | (iv) 40 |
If the letters of the word 'MOTHER' be permuted and all the words so formed (with or without meaning) be listed as in a dictionary, then the position of the word 'MOTHER' is ______.
Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Determine the number of words which have at least one letter repeated.
If m+nP2 = 90 and m–nP2 = 30, then (m, n) is given by ______.
8-digit numbers are formed using the digits 1, 1, 2, 2, 2, 3, 4, 4. The number of such numbers in which the odd digits do no occupy odd places is ______.
