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
Coefficient of x10 in the expansion of (1 + x)9 ln (1 + x), is (where |x|...If the system of linear equations x + 2ay + az = 0 x + 3by + bz = 0 x + 4cy + cz = 0 has a non - zero solution, then a, ...At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are 10 c...The value of|1 - x2|dx is...If f(x + y) = f(x) . f(y) ∀ x.y and f(5) = 2, f′(0) = 3 then f′(5)is...