Skip to main content
Have a personal or library account? Click to login
Bertrand’s Ballot Theorem Cover

Bertrand’s Ballot Theorem

Formalized Mathematics
Volume 22 (2014): Issue 2 (June 2014)
By:   
Open Access
|Jun 2014
References

References

  1. [1] Grzegorz Bancerek. Cardinal numbers., 1(2):377–382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The fundamental properties of natural numbers., 1(1):41–46, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. The ordinal numbers., 1(1):91–96, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1(1):107–114, 1990.
    Search in Google Scholar
  5. [5] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets., 1(3):529–536, 1990.
    Search in Google Scholar
  6. [6] Czesław Byliński. Functions and their basic properties., 1(1): 55–65, 1990.
    Search in Google Scholar
  7. [7] Czesław Byliński. Functions from a set to a set., 1(1):153–164, 1990.
    Search in Google Scholar
  8. [8] Czesław Byliński. The sum and product of finite sequences of real numbers., 1(4):661–668, 1990.
    Search in Google Scholar
  9. [9] Czesław Byliński. Some basic properties of sets., 1(1):47–53, 1990.
    Search in Google Scholar
  10. [10] Agata Darmochwał. Finite sets., 1(1):165–167, 1990.
    Search in Google Scholar
  11. [11] Artur Korniłowicz. On the real valued functions., 13(1):181–187, 2005.
    Search in Google Scholar
  12. [12] Rafał Kwiatek. Factorial and Newton coefficients., 1(5):887–890, 1990.
    Search in Google Scholar
  13. [13] Beata Padlewska. Families of sets., 1(1):147–152, 1990.
    Search in Google Scholar
  14. [14] Karol Pąk. Cardinal numbers and finite sets., 13(3):399–406, 2005.
    Search in Google Scholar
  15. [15] Karol Pąk. The Catalan numbers. Part II., 14(4):153–159, 2006. doi:10.2478/v10037-006-0019-7.
    Open DOISearch in Google Scholar
  16. [16] Jan Popiołek. Introduction to probability., 1(4):755–760, 1990.
    Search in Google Scholar
  17. [17] M. Renault. Four proofs of the ballot theorem., 80(5):345–352, December 2007.
    Open DOISearch in Google Scholar
  18. [18] Andrzej Trybulec. Domains and their Cartesian products., 1(1): 115–122, 1990.
    Search in Google Scholar
  19. [19] Andrzej Trybulec. Enumerated sets., 1(1):25–34, 1990.
    Search in Google Scholar
  20. [20] Andrzej Trybulec. On the decomposition of finite sequences., 5 (3):317–322, 1996.
    Search in Google Scholar
  21. [21] Andrzej Trybulec. Binary operations applied to functions., 1 (2):329–334, 1990.
    Search in Google Scholar
  22. [22] Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences., 1(3):569–573, 1990.
    Search in Google Scholar
  23. [23] Zinaida Trybulec. Properties of subsets., 1(1):67–71, 1990.
    Search in Google Scholar
  24. [24] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences., 9(4):825–829, 2001.
    Search in Google Scholar
  25. [25] Edmund Woronowicz. Relations and their basic properties., 1 (1):73–83, 1990.
    Search in Google Scholar
  26. [26] Edmund Woronowicz. Relations defined on sets., 1(1):181–186, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/forma-2014-0014 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 119 - 123
Submitted on: Jun 13, 2014
Published on: Jun 30, 2014
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Keywords:
ballot theorem,
probability
MSC:
60C05,
03B35
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2014 Karol Pąk, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.

Volume 22 (2014): Issue 2 (June 2014)
Previous article
Next article