RESEARCH COMMONS
LIBRARY

Tennis, Geometric Progression, Probability and Basketball

ResearchCommons/Manakin Repository

Tennis, Geometric Progression, Probability and Basketball

Show full item record

Title: Tennis, Geometric Progression, Probability and Basketball
Author: Ghandehari, Mostafa
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.
URI: http://hdl.handle.net/10106/4827
Date: 1999-03

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 full item record

Browse

My Account

Statistics

About Us