Permutation and CombinationHard
Question
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:
Options
A.
B.
C.
D.
Solution
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 - 2Cm - 1 . n - 1Cn - 1 =
steps to south so total steps which we have to go
are (m + n - 2) ways.
Hence total no. of ways
= m + n - 2Cm - 1 . n - 1Cn - 1 =
Create a free account to view solution
View Solution FreeMore Permutation and Combination Questions
A building construction work can be completed by two masons A and B together in 22.5 days. Mason A alone can complete th...Shubham has to make a telephone call to his friend Nisheeth, Unfortunately he does not remember the 7 digit phone number...There are 10 students in a class in which three A, B, C are girls. The number of ways to arrange them in a row when any ...The total number of words formed with the letters of the word ″SERIES″ is-...50C36 is divisible by...