返回题库

AIME 1992 · 第 3 题

AIME 1992 — Problem 3

专题
Contest Math
难度
L4
来源
AIME

题目详情

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.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.503. What's the largest number of matches she could've won before the weekend began?

解析

Solution 1

Let nn be the number of matches won, so that n2n=12\frac{n}{2n}=\frac{1}{2}, and n+32n+4>5031000\frac{n+3}{2n+4}>\frac{503}{1000}.

Cross multiplying, 1000n+3000>1006n+20121000n+3000>1006n+2012, so n<9886=16446=16423n<\frac{988}{6}=164 \dfrac {4}{6}=164 \dfrac{2}{3}. Thus, the answer is 164\boxed{164}.

Solution 2 (same as solution 1)

Let nn be the number of matches she won before the weekend began. Since her win ratio started at exactly .500=12,500 = \tfrac{1}{2}, she must have played exactly 2n2n games total before the weekend began. After the weekend, she would have won n+3n+3 games out of 2n+42n+4 total. Therefore, her win ratio would be (n+3)/(2n+4).(n+3)/(2n+4). This means that

n+32n+4>.503=5031000.\frac{n+3}{2n+4} > .503 = \frac{503}{1000}. Cross-multiplying, we get 1000(n+3)>503(2n+4),1000(n+3) > 503(2n+4), which is equivalent to n<9886=164.6.n < \frac{988}{6} = 164.\overline{6}. Since nn must be an integer, the largest possible value for nn is 164.\boxed{164}.