All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Lazy Tennis (Posted on 2006-03-27)
In a game of tennis, the player who puts in the most effort in a match, and wins the majority of points, does not necessarily win the match as a whole.

Imagine two tennis players compete in a 5-set match, with each set following the scoring system of tennis, and a first to 7 point tie-break takes place if the score in a set is 6 games each. Let the total number of points won by the person who wins the match be represented by W, and let the total number of points won by the person who loses the match be represented by L.

If by the end of the match L-W is equal to a POSITIVE integer, then what is the maximum value this integer can be? Furthermore, develop an equation to determine the integer formed from L-W for a match of x number of sets.

Note: Enough information regarding the scoring system in tennis required to solve the problem, can be found at http://tennis.about.com/cs/beginners/a/beginnerscore.htm

 No Solution Yet Submitted by Chris, PhD Rating: 4.3333 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(4): Solution, Standing on the shoulders of about.com | Comment 6 of 24 |
(In reply to re(3): Solution, Standing on the shoulders of Tomarken. by Hugo)

From the about.com article (on the second page):

"In a standard '12-point tie break' (best of 12), one player must win seven points by a margin or two or more."

I know you have to win by 2, you can't win a tiebreaker 7-6.  The game continues at that point until someone has a 2-point lead.  Whether that turns out to be at 8-6 or 12-10 or whenever is irrelevant for this puzzle, though, since we're only looking for the difference and that will always be 2 points.

 Posted by tomarken on 2006-03-27 11:04:18

 Search: Search body:
Forums (0)