RESEARCH COMMONS
LIBRARY

Tennis, Geometric Progression, Probability and Basketball

ResearchCommons/Manakin Repository

Tennis, Geometric Progression, Probability and Basketball

Show simple item record

dc.contributor.author Ghandehari, Mostafa en_US
dc.date.accessioned 2010-07-01T15:56:26Z en_US
dc.date.available 2010-07-01T15:56:26Z en_US
dc.date.issued 1999-03 en_US
dc.identifier.uri http://hdl.handle.net/10106/4827 en_US
dc.description.abstract The following problem about a tennis match is well—known. See Halmos [1, 2]. Consider 2n tennis players playing a single elimination match. Ask the question: what are the number of games played? The answer can be obtained in two ways. First using the geometric progression 2n-1 + 2n-2 + • • • -2+1 we find that the answer is 2n — 1. We can also explain the answer as follows: for each game played there is a loser. Thus the total number of games played is equal to the number of losers. Since there is only one winner the total number of games played is equal to 2n — 1, the number of losers. en_US
dc.language.iso en_US en_US
dc.publisher University of Texas at Arlington en_US
dc.relation.ispartofseries Technical Report;336 en_US
dc.subject Statistics en
dc.subject Probability en
dc.subject Game theory en
dc.subject.lcsh Mathematics Research en
dc.title Tennis, Geometric Progression, Probability and Basketball en_US
dc.type Technical Report en_US
dc.publisher.department Department of Mathematics en_US

Files in this item

Files Size Format View Description
MathTechReport336.pdf 100.0Kb PDF View/Open PDF

This item appears in the following Collection(s)

Show simple item record

Browse

My Account

Statistics

About Us