Counting outcomes of races with ties
Date of Publication
1993
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
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.
Abstract Format
html
Language
English
Format
Accession Number
TU06288
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
55 leaves
Keywords
Counting; Programming (Mathematics); Mathematics--Formulae; Numerical functions
Recommended Citation
Diestro, J. C., & Sarmenta, A. C. (1993). Counting outcomes of races with ties. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16118
