Jeet planned his day of JEE well. On the day of the exam, he woke up early and decided to reach the exam hall as early as possible to attain peace of mind and soul in the exam hall. The path from his house to exam hall is a like a grid. Each black line represents one step he could take.
His house is at position A and the exam hall is at position B.In how many ways can he reach the exam hall if he has to take the shortest path and he is not allowed to pass through point M.
This is part of my set : Fun is a Student's Right
You would also like : Let's play with polygons & circles
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
14C6 (12C6 - 6C3* 6C3) + 1 + 13C5 ( 11C6 - 5C2 * 6C3) + 10C6 * 8C2 = 1 9 1 6 6 4 7