Bertrand’s Ballot Theorem
In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than...
Main Author: | Pąk Karol |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2014-06-01
|
Series: | Formalized Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.2478/forma-2014-0014 |
Similar Items
-
Euler’s Partition Theorem
by: Pąk Karol
Published: (2015-06-01) -
Niven’s Theorem
by: Korniłowicz Artur, et al.
Published: (2016-12-01) -
CHANGES IN BALLOT SECURITY IN THE RUSSIAN FEDERATION (1990S – 2000S)
by: L. D. Tikhonova
Published: (2014-02-01) -
About Vertex Mappings
by: Koch Sebastian
Published: (2019-10-01) -
About Graph Mappings
by: Koch Sebastian
Published: (2019-10-01)