Advertisements
Advertisements
प्रश्न
Find n, if: `((2"n")!)/(7!(2"n" - 7)!) : ("n"!)/(4!("n" - 4)!)` = 24:1
Advertisements
उत्तर
`((2"n")!)/(7!(2"n" - 7)!) : ("n"!)/(4!("n" - 4)!)` = 24:1
∴ `((2"n")!)/(7!(2"n" - 7)!) : (4!("n" - 4)!)/("n"!)` = 24
`∴((2"n")(2"n" - 1)(2"n" - 2)(2"n" - 3)(2"n" - 4)(2"n" - 5)(2"n" - 6)(2"n" - 7)!)/(7xx6xx5xx4!(2"n"-7)!)xx(4!("n" - 4)!)/("n"("n" -1)("n" - 2)("n" - 3)("n" - 4)!)=24`
`∴((2"n")(2"n" - 1)(2"n" - 2)(2"n" - 3)(2"n" - 4)(2"n" - 5)(2"n" - 6))/(7 xx 6 xx 5)xx1/("n"("n" -1)("n" - 2)("n" - 3))=24`
`∴((2"n")(2"n" - 1)2("n" - 2)(2"n" - 3)2("n" - 2)(2"n" - 5)2("n" - 3))/(7 xx 6 xx 5)xx1/("n"("n" -1)("n" - 2)("n" - 3))=24`
∴ `(16(2"n" - 1)(2"n" - 3)(2"n" - 5))/(7xx6xx5)` = 24
∴ (2n – 1) (2n – 3) (2n – 5) = `(24xx7xx6xx5)/16`
∴ (2n – 1) (2n – 3) (2n – 5) = 9 × 7 × 5
Comparing on both sides, we get
∴ 2n – 1 = 9
∴ n = 5
APPEARS IN
संबंधित प्रश्न
A teacher wants to select the class monitor in a class of 30 boys and 20 girls. In how many ways can he select a student if the monitor can be a boy or a girl?
A teacher wants to select the class monitor in a class of 30 boys and 20 girls, in how many ways can the monitor be selected if the monitor must be a boy? What is the answer if the monitor must be a girl?
How many five-digit numbers formed using the digit 0, 1, 2, 3, 4, 5 are divisible by 3 if digits are not repeated?
Evaluate: 6!
Compute: `(12!)/(6!)`
Compute: 3! × 2!
Compute: `(9!)/(3! 6!)`
Write in terms of factorial:
5 × 6 × 7 × 8 × 9 × 10
Write in terms of factorial:
5 × 10 × 15 × 20 × 25
Evaluate: `("n"!)/("r"!("n" - "r"!)` For n = 8, r = 6
Find n, if `"n"/(6!) = 4/(8!) + 3/(6!)`
Find n, if (n + 3)! = 110 × (n + 1)!
Find n if: `("n"!)/(3!("n" - 3)!) : ("n"!)/(5!("n" - 5)!)` = 5:3
Find n, if: `((15 - "n")!)/((13 - "n")!)` = 12
Show that
`("n"!)/("r"!("n" - "r")!) + ("n"!)/(("r" - 1)!("n" - "r" + 1)!) = (("n" + 1)!)/("r"!("n" - "r" + 1)!`
A hall has 12 lamps and every lamp can be switched on independently. Find the number of ways of illuminating the hall.
A question paper has 6 questions. How many ways does a student have if he wants to solve at least one question?
