Math miscellaneousMedium
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
Consider the system of linear equations:x1 + 2x2 + x3 = 32x1 + 3x2 + x3 = 33x1 + 5x2 + 2x3 = 1The system has...The value of is...Let I = Then which one of the following is true?...The length of the projection of the line segment joining the points (5, -1, 4) and (4, -1, 3) on the plane, x + y + z = ...If a1, a2, .... , an are in H.P., then the expression a1a2 + a2a3 + .... + an-1an is equal to...