1992 AIME Problems/Problem 3

From AoPSWiki

Revision as of 02:56, 12 November 2007 by Temperal (Talk | contribs)

(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly $.500$ . During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than $.503$ . What's the largest number of matches she could've won before the weekend began?

Solution

Let $n$ be the number of matches won, so that $\frac{n}{2n}=\frac{1}{2}$ , and $\frac{n+3}{2n+4}>\frac{503}{1000}$ . Cross multiplying, $1000n+3000>1006n+2012$ , and $n<\frac{988}{6}$ . Thus, the answer is $164$ .

1992 AIME (Problems • Resources)
Preceded by Problem 2	Followed by Problem 4
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Personal tools

Navigation

Search

Toolbox

1992 AIME Problems/Problem 3

From AoPSWiki

Problem

Solution