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 box contains 2 white balls, 3 black balls & 4 red balls. In how many ways can three balls be drawn from the box if atl...The number of non-negative integral solutions of x1 + x2 + x3 + x4 ≤ n (where n is a positive integer) is...The number of 4 digits odd numbers formed with the digits 0,1,2,3,4 and 5 is (Rept.not allowed)...The number of words which can be formed from the letters of the word MAXIMUM, if two consonants cannot occur together, i...Out of seven consonants and four vowels, the number of words of six letters, formed by taking four consonants and two vo...