Counting outcomes of races with ties

• Main Authors: Diestro, Jude C., Sarmenta, Alfonso C.S.
• Format: text
• Language: English
• Published: Animo Repository 1993
• Subjects: Counting; Programming (Mathematics); Mathematics > Formulae; Numerical functions
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/16118
• Institution: De La Salle University

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 many places. A step by step presentation in finding this number was made, on the basis on suchs article. On investigating the terms of the expansion of the summation for Jn, the researchers were able to come up with a procedure, in a fashion different from Mendelson's. Moreover, they devised a program that computes the values of Jn, to avoid the messy computations involved in the summation.