Imagine an election between two candidates.
A receives m votes, B receives n votes, and A wins (m>n).

If the ballots are cast one at a time, what is the probability that A will lead all the way throughout the voting process?

(In reply to re: Formula with partial proof by Ady TZIDON)

It's Bertrand's ballot theorem.

Posted by xdog on 2015-10-06 09:34:54