A probability problem by Akshat Sharda
Find the number of ways in which 1's and 2's can be arranged in row so that at any point in the row the number of 1's is more than or equal to the number of 2's.
Submit your answer for .
You may use a calculator for the final step of your calculation.
The answer is 16796.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
I found an interesting Wikipedia article around this problem, Bertrand's ballot theorem .