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
The number of ways in which six different prizes can be distributed among three children each receiving at least one pri...nPr is equal to -...Find the total number of ways of answering 5 objective type questions, each question having 4 choices....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...Eight chairs are numbered from 1 to 8. Two women and three men wish to occupy one chair each. First women choose the cha...