Bertrand's ballot theorem

In combinatorics, Bertrand's ballot problem is the question: "In an election where candidate A receives p votes and candidate B receives q votes with p > q, what is the probability that A will be strictly ahead of B throughout the count under the assumption that votes are counted in a randomly picked order? " The answer is p − q p + q . {\displaystyle {\frac {p-q}{p+q}}.} The result was first published by W. A. Whitworth in 1878, but is named after Joseph Louis François Bertrand who rediscovered it in 1887.

Source: Wikipedia — Bertrand's ballot theorem (CC BY-SA 4.0)

Bertrand's ballot theorem

In combinatorics, Bertrand's ballot problem is the question: "In an election where candidate A receives p votes and candidate B receives q votes with p > q, what is the probability that A will be strictly ahead of B throughout the count under the assumption that votes are counted in a randomly picked order? " The answer is p − q p + q . {\displaystyle {\frac {p-q}{p+q}}.} The result was first published by W. A. Whitworth in 1878, but is named after Joseph Louis François Bertrand who rediscovered it in 1887.

This neuron ends here.

Source: Wikipedia "Bertrand's ballot theorem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy