Bertrand's ballot theorem
theorem that, in an election where candidate A receives 𝑝 votes and candidate B receives 𝑞 votes (𝑝>𝑞), the probability that A will be strictly ahead of B throughout the count is (𝑝−𝑞)/(𝑝+𝑞)
Press Enter · cited answer in seconds
0 sources
Bertrand's ballot theorem
Summary
Bertrand's ballot theorem is a theorem[1]. It draws 89 Wikipedia views per month (theorem category, ranking #209 of 1,306).[2]
Key Facts
- Bertrand's ballot theorem's instance of is recorded as theorem[3].
- Joseph Bertrand is named after Bertrand's ballot theorem[4].
- Bertrand's ballot theorem's part of is recorded as list of theorems[5].
- Bertrand's ballot theorem's Commons category is recorded as Bertrand's ballot theorem[6].
- Bertrand's ballot theorem's Freebase ID is recorded as /m/040_g3[7].
- Bertrand's ballot theorem's proved by is recorded as William Allen Whitworth[8].
- Bertrand's ballot theorem's defining formula is recorded as \frac{p-q}{p+q}[9].
- Bertrand's ballot theorem's MathWorld ID is recorded as BallotProblem[10].
- Bertrand's ballot theorem's maintained by WikiProject is recorded as WikiProject Mathematics[11].
- Bertrand's ballot theorem's Microsoft Academic ID is recorded as 148139667[12].
Why It Matters
Bertrand's ballot theorem draws 89 Wikipedia views per month (theorem category, ranking #209 of 1,306).[2] It has Wikipedia articles in 8 language editions, a strong signal of global cultural recognition.[13]