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
Number of different words that can be formed using all the letters of the word ″DEEPMALA″ if two vowels are ...If α = mC2, then αC2 is equal to -...The number of rectangles in the adjoining figure is -...Six persons A, B, C, D, E and F are to be seated at a circular table. The number of ways this can be done if A must have...The number of different seven digit numbers that can be written using only three digits 1, 2 & 3 under the condition tha...