Published by:
CGP EDU Academic Team
Published on: August 14, 2026
The streets of a city are arranged like the lines of a chess board. There are m streets running North to South & 'n' streets running East to West. The number of ways in which a man can travel from NW to SE corner going the shortest possible distance is:
A
B
C
D
Text Solution
Verified by ExpertsThe correct answer is:
D
Here we should go (n –1) steps to east and (m –1)
steps to south so total steps which we have to go are (m + n – 2) ways.
Hence total no. of ways = m + n – 2C m–1 . n –1C n–1 = 
──────────────────────────────────────────────────────────────────────────────────────────
Prepare Smarter with CGP Edu
Get practice questions, solutions, and test series in one place.
Write a Review
Share your experience with this question and solution.
Commentary
Send your comment, doubt, correction, or feedback to admin.
Similar Questions
Explore conceptually related problems
There are 10 buses operating between places A and B. The number of ways a person can go from place …
How many three digit even numbers can be formed using the digits 1, 2, 3, 4, 5 (repetition allowed)?
In a 12 storey house 10 people enter the lift cabin. It is known that they will leave the lift in p…
The numbers 1, 2, 3, 4, 5 are written on five cards. How many 3 digit numbers can be formed by plac…
How many cricket teams of members eleven each can be formed from 15 persons if captain is included …
In a football championship, 153 matches were played. Every team played one match with each other. T…