retagged by
2,218 views
2 votes
2 votes
retagged by

1 Answer

Best answer
5 votes
5 votes

This is an example of Permutation with repeated characters. 

To go to from (0,0) (consider, southeast corner) to (8,8) (consider northwest corner) we need to take 7 Up turn and 7 right turn. It means that its a forming a string like UUUUUUURRRRRRR (Whatever the way you go, you have to take 7 Up and 7 right to reach (8,8)). Now our job is it find the how many permutation can be formed from this string. Which is a very simple task. 

Total Number of permutation will be : ( factorial(14) / (factorial(7) * factorial(7))). Which is equivalent to 14C7.

Hence option B is correct

selected by

Related questions

0 votes
0 votes
1 answer
1
AKS1236 asked May 18, 2022
762 views
I solved the question using the logic first select two questions from each sections. ($\binom{5}{2} * \binom{5}{2}$). Then from remaining 6 questions choose any 2. theref...
8 votes
8 votes
6 answers
3
radha gogia asked Dec 3, 2015
5,844 views
For this I considered cases1. 1 job each to 2 people and then jobs to a single person2. 2 jobs each to 2 people and then 1 job to a single person For the first case I di...
1 votes
1 votes
1 answer
4
radha gogia asked Feb 25, 2016
4,460 views
we have to choose five chocolates,say, C1, C2, C3, C4 and C5. Now for C1 we can choose among three kinds of chocolates. Since the supply of chocolates is infinite, for C2...