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
There are four balls of different colours and four boxes of colours same as those of the balls. The number of ways in wh...The total number of words which can be formed using letters of the word ′FAILURE′ so that consonants always ...In how many way can a game of tennis be played from 3 men and 4 women when each team contains one man and one woman-...If , then n equals-...A set contains (2n + 1) elements. If the number of subsets of this set which contain at most n elements is 4096, then th...