Advertisements
Advertisements
प्रश्न
If (n+2)! = 60[(n–1)!], find n
उत्तर
Given that (n + 2)! = 60(n – 1)!
(n + 2) (n + 1) n (n – 1)! = 60(n – 1)!
Cancelling (n – 1)! we get,
(n + 2)(n + 1)n = 60
(n + 2)(n + 1)n = 5 × 4 × 3
Both sides we consecutive product of integers
∴ n = 3
APPEARS IN
संबंधित प्रश्न
Compute `(8!)/(6! xx 2!)`
In how many ways can the letters of the word PERMUTATIONS be arranged if the words start with P and end with S.
A customer forgets a four-digits code for an Automatic Teller Machine (ATM) in a bank. However, he remembers that this code consists of digits 3, 5, 6 and 9. Find the largest possible number of trials necessary to obtain the correct code.
How many natural numbers less than 1000 can be formed from the digits 0, 1, 2, 3, 4, 5 when a digit may be repeated any number of times?
Write the number of ways in which 7 men and 7 women can sit on a round table such that no two women sit together ?
The number of different ways in which 8 persons can stand in a row so that between two particular persons A and B there are always two persons, is
- In how many ways can 8 identical beads be strung on a necklace?
- In how many ways can 8 boys form a ring?
Determine the number of permutations of the letters of the word SIMPLE if all are taken at a time?
In how many ways can the letters of the word SUCCESS be arranged so that all Ss are together?
The number of permutations by taking all letters and keeping the vowels of the word ‘COMBINE’ in the odd places is ______.
