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 = y + 3 > 0 and y (0) = 2 , then y (ln2) is equal to...If the system of linear equations x + ky + 3z = 0 3x + ky - 2z = 0 2x + 4y - 3z = 0 has a non-zero solution (x, y, z), t...The coefficient of x13 in the expansion of (1 - x)5 (1 + x + x2 + x3)4 is :-...The variance of first 50 even natural numbers is...The option(s) with the values of a and L that satisfy the following equation is(are) = L ?...