Remember that ballot's theorem for k>=1 works only to calculate the no. of arrangements where votes of A are strictly greater than k times of that of B. For the case when votes of A are equal to greater than that of k times of B the formula changes. In fact right now we have only got that formula for k=1. Let votes of A be n and that of B be m then for votes(A)>=votes(B) at every point the no. of arrangements is:
1/(n+1)*(m+n)C(n) provided n>=m.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.