Get Answers to all your Questions

header-bg qa

Take into consideration a 5\times 6 grid with A as the starting point and B as the finishing point. Each step can either be an upward or a rightward movement. Find the total number of shortest paths that lead to endpoint B .

Option: 1

361


Option: 2

462


Option: 3

261


Option: 4

562


Answers (1)

best_answer

We must take 5 steps to the right and 6 steps up in order to go for the shortest distance to endpoint B . Let x and y each represent a step to the right and an upward step, respectively. Consequently, there are 5x steps and 6y steps in total.

These 5xs and 6ys  can be arranged in any way to find the shortest path. The binomial coefficient provides the number of possible arrangements for these steps:
{ }^n \mathrm{C}_r=\frac{n !}{r !(n-r) !}
where n denotes the overall number of steps, r the number of steps taken in one particular direction, in this case to the right, and (n-r) the number of steps taken in the opposite direction, in this case upwards.

Using this equation, we obtain:
\begin{aligned} & { }^{11} \mathrm{C}_6=\frac{11 !}{6 !(11-6) !} \\ = & \frac{11 !}{6 ! \times 5 !} \\ = & 462 \end{aligned}
Total number of ways : 462

Posted by

Ajit Kumar Dubey

View full answer

JEE Main high-scoring chapters and topics

Study 40% syllabus and score up to 100% marks in JEE