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...
محفوظ في:
المؤلفون الرئيسيون: | , |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Animo Repository
1993
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_bachelors/16118 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
الملخص: | 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. |
---|