Counting outcomes of races with ties
This thesis is based on the article of Elliot Mendelson entitled Races with Ties , which appeared in Mathematics Magazine, 1982 wherein he established a formula for the number Jn of possible outcomes in a race of n runners, provided, any number of the runners are allowed in a tie for arbitrarily man...
Saved in:
Main Authors: | Diestro, Jude C., Sarmenta, Alfonso C.S. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1993
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16118 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Asymptotic formulas of r-Whitney numbers of the second kind with real parameters
by: Gasparin, Raylee J.
Published: (2014) -
Kaplansky's solution to a counting problem
by: Sy, Janel G.
Published: (1998) -
Counting neighboring pairs in permutations
by: Terrel, Randolph Anthony A., et al.
Published: (1994) -
On regular and 2-scored 2-orthogonal tournaments
by: Urbano, Reynaldo M.
Published: (1994) -
A comparison of the Maclaurin and Chebyshev series in the computation of tan-1x
by: Castro, Elizabeth, et al.
Published: (1993)