Metraipolis › archive › dc_f59ebd86b36f

Bertrand's ballot theorem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bertrand%27s_ballot_theorem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T21:35:54.567Z
SHA-256 of the archived text
24fd133cd8953fa999f3e10d4838b65b590ad637803d74e8a1b91f693a18188b
Stable URL of this page
https://metraipolis.com/documento/dc_f59ebd86b36f

How to cite

Bertrand's ballot theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bertrand%27s_ballot_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_f59ebd86b36f (Metraipolis archive dc_f59ebd86b36f, sha256 24fd133cd8953fa999f3e10d4838b65b590ad637803d74e8a1b91f693a18188b)
BibTeX
@misc{dcf59ebd86b36f,
  title = {Bertrand's ballot theorem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bertrand%27s_ballot_theorem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_f59ebd86b36f; sha256 24fd133cd8953fa999f3e10d4838b65b590ad637803d74e8a1b91f693a18188b},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bertrand%27s_ballot_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. In Bertrand's original paper, he sketches a proof based on a general formula for the number of favourable sequences using a recursion relation. He remarks that it seems probable that such a simple result could be proved by a more direct method. Such a proof was given by Désiré André, based on the observation that the unfavourable sequences can be divided into two equally probable cases, one of which (the case where B receives the first vote) is easily computed; he proves the equality by an explicit bijection. A variation of his method is popularly known as André's reflection method, although André did not use any reflections. Bertrand's ballot theorem is related to the cycle lemma. They give similar formulas, but the cycle lemma considers circular shifts of a given ballot counting order rather than all permutations.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»).
Fonte: Wikipedia in inglese, voce «Bertrand's ballot theorem» — https://en.wikipedia.org/wiki/Bertrand%27s_ballot_theorem
Wikidata Q2253746 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2253746
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bertrand%27s_ballot_theorem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376053911, consultata il 2026-10-07T21:06:56.358Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6adc31601b99a6dd9ad4fb66495b572d4721d3e76dd1913174c7bce5d2b46116