Advertisements
Advertisements
Question
If (n + 1)! = 90 [(n − 1)!], find n.
Advertisements
Solution
(n + 1)! = 90 [(n − 1)!]
n = 9
APPEARS IN
RELATED QUESTIONS
Convert the following products into factorials:
5 · 6 · 7 · 8 · 9 · 10
Convert the following products into factorials:
1 · 3 · 5 · 7 · 9 ... (2n − 1)
If (n + 2)! = 60 [(n − 1)!], find n.
If P (5, r) = P (6, r − 1), find r ?
If 5 P(4, n) = 6. P (5, n − 1), find n ?
If P (n, 5) = 20. P(n, 3), find n ?
If P (n, 5) : P (n, 3) = 2 : 1, find n.
Four letters E, K, S and V, one in each, were purchased from a plastic warehouse. How many ordered pairs of letters, to be used as initials, can be formed from them?
How many three-digit numbers are there, with distinct digits, with each digit odd?
How many words, with or without meaning, can be formed by using all the letters of the word 'DELHI', using each letter exactly once?
How many 6-digit telephone numbers can be constructed with digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 if each number starts with 35 and no digit appears more than once?
If a denotes the number of permutations of (x + 2) things taken all at a time, b the number of permutations of x things taken 11 at a time and c the number of permutations of x − 11 things taken all at a time such that a = 182 bc, find the value of x.
How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit is repeated?
In how many ways can the letters of the word 'STRANGE' be arranged so that
the vowels come together?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the letter G always occupies the first place?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the letters P and I respectively occupy first and last place?
How many permutations can be formed by the letters of the word, 'VOWELS', when
each word begins with O and ends with L?
How many permutations can be formed by the letters of the word, 'VOWELS', when
all consonants come together?
How many words (with or without dictionary meaning) can be made from the letters in the word MONDAY, assuming that no letter is repeated, if all letters are used but first is vowel.
Find the number of words formed by permuting all the letters of the following words:
INTERMEDIATE
Find the number of words formed by permuting all the letters of the following words:
CONSTANTINOPLE
How many words can be formed with the letters of the word 'PARALLEL' so that all L's do not come together?
How many words can be formed by arranging the letters of the word 'MUMBAI' so that all M's come together?
How many numbers greater than 1000000 can be formed by using the digits 1, 2, 0, 2, 4, 2, 4?
The letters of the word 'SURITI' are written in all possible orders and these words are written out as in a dictionary. Find the rank of the word 'SURITI'.
If the letters of the word 'MOTHER' are written in all possible orders and these words are written out as in a dictionary, find the rank of the word 'MOTHER'.
Find the total number of ways in which six ‘+’ and four ‘−’ signs can be arranged in a line such that no two ‘−’ signs occur together.
In how many ways can the letters of the word
"INTERMEDIATE" be arranged so that:the vowels always occupy even places?
In how many ways can the letters of the word "INTERMEDIATE" be arranged so that:
the relative order of vowels and consonants do not alter?
For all positive integers n, show that 2nCn + 2nCn − 1 = `1/2` 2n + 2Cn+1
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
How many words, with or without meaning can be formed from the letters of the word 'MONDAY', assuming that no letter is repeated, if (i) 4 letters are used at a time
Find the number of permutations of n distinct things taken r together, in which 3 particular things must occur together.
If 35Cn +7 = 35C4n − 2 , then write the values of n.
Write the value of\[\sum^6_{r = 1} \ ^{56 - r}{}{C}_3 + \ ^ {50}{}{C}_4\]
Write the number of ways in which 12 boys may be divided into three groups of 4 boys each.
