Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: ballot theorem

Sortuj według:

Ogranicz wyniki do:

Bertrand’s Ballot Theorem

100%

Pąk K.

Formalized Mathematics

2014

tom 22

nr 2

119-123

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 B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/.

Ograniczanie wyników

1 Formalized Mathematics

1 Pąk K.

1 2015

Wyniki wyszukiwania

Bertrand’s Ballot Theorem