Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa

Think about a 7\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

1716


Option: 2

1736


Option: 3

2716


Option: 4

1816


Answers (1)

best_answer

We must take 7 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 7x steps and 6y steps in total.

These 7xs 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 \left ( n-r \right ) the number of steps taken in the opposite direction, in this case upwards.

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

Posted by

Kuldeep Maurya

View full answer

JEE Main high-scoring chapters and topics

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

Similar Questions

Trending Articles/News

anam-khan

JEE Main 2025 session 1 exam in the last week of January; registration details
anam-khan

Over 656 UPSC, JEE, NEET, other coaching aspirants refunded more than Rs 1 crore: Govt
anam-khan

NTA Exam Calendar 2025: JEE Main, NEET, CUET, UGC NET dates soon; websites to check

Latest Question