Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/3710
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Pąk, Karol | - |
dc.date.accessioned | 2015-12-09T20:40:51Z | - |
dc.date.available | 2015-12-09T20:40:51Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Formalized Mathematics, Volume 22, Issue 2, 2014, Pages 119-123 | - |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.issn | 1898-9934 | - |
dc.identifier.uri | http://hdl.handle.net/11320/3710 | - |
dc.description.abstract | 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/. | - |
dc.description.sponsorship | The paper has been financed by the resources of the Polish National Science Centre granted by decision no DEC-2012/07/N/ST6/02147. | - |
dc.language.iso | en | - |
dc.publisher | De Gruyter Open | - |
dc.subject | ballot theorem | - |
dc.subject | probability | - |
dc.title | Bertrand’s Ballot Theorem | - |
dc.type | Article | - |
dc.identifier.doi | 10.2478/forma-2014-0014 | - |
dc.description.Affiliation | Institute of Informatics University of Białystok Sosnowa 64, 15-887 Białystok Poland | - |
dc.description.references | Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990. | - |
dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990. | - |
dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990. | - |
dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990. | - |
dc.description.references | Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990. | - |
dc.description.references | Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990. | - |
dc.description.references | Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990. | - |
dc.description.references | Czesław Byliński. The sum and product of finite sequences of real numbers. Formalized Mathematics, 1(4):661–668, 1990. | - |
dc.description.references | Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990. | - |
dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990. | - |
dc.description.references | Artur Korniłowicz. On the real valued functions. Formalized Mathematics, 13(1):181–187, 2005. | - |
dc.description.references | Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887–890, 1990. | - |
dc.description.references | Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990. | - |
dc.description.references | Karol Pąk. Cardinal numbers and finite sets. Formalized Mathematics, 13(3):399–406, 2005. | - |
dc.description.references | Karol Pąk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153–159, 2006. doi:10.2478/v10037-006-0019-7. | - |
dc.description.references | Jan Popiołek. Introduction to probability. Formalized Mathematics, 1(4):755–760, 1990. | - |
dc.description.references | M. Renault. Four proofs of the ballot theorem. Mathematics Magazine, 80(5):345–352, December 2007. | - |
dc.description.references | Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1): 115–122, 1990. | - |
dc.description.references | Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25–34, 1990. | - |
dc.description.references | Andrzej Trybulec. On the decomposition of finite sequences. Formalized Mathematics, 5 (3):317–322, 1996. | - |
dc.description.references | Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329–334, 1990. | - |
dc.description.references | Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990. | - |
dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990. | - |
dc.description.references | Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825–829, 2001. | - |
dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990. | - |
dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990. | - |
Występuje w kolekcji(ach): | Artykuły naukowe (WInf) Formalized Mathematics, 2014, Volume 22, Issue 2 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma-2014-0014.pdf | 255,35 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL