Math miscellaneousHard
Question
A person wants to reach from A to B by moving upward or rightward direction only taking one unit step at time, then number of shortest path available to him if he must pass through C but not through D -
Options
A.2520
B.1200
C.1320
D.1560
Solution
Total number of desired paths =
(A → C, C → B) – (A → C, C → D, D → B)
⇒ 6C3. 9C4 - 6C3.4C2.5C2 = 1320
(A → C, C → B) – (A → C, C → D, D → B)
⇒ 6C3. 9C4 - 6C3.4C2.5C2 = 1320
Create a free account to view solution
View Solution FreeMore Math miscellaneous Questions
If makes an angle of π/3 with both and then can be...If I = & B = then (I + B)50 is:-...If A = and A2 = , then...If x = -1 and x = 2 are extreme points of f(x) = α log |x| + βx2 + x then...A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from the first five ...