AoPSWiki
Preparing for MATHCOUNTS or the AMC contests, and having a tough time with number theory problems? Read Art of Problem Solving's Introduction to Number Theory by Mathew Crawford.
Personal tools

1987 AIME Problems/Problem 8

From AoPSWiki

Problem

What is the largest positive integer for which there is a unique integer such that \frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}?

Solution

Multiplying out all of the denominators, we get:

\begin{align*}104(n+k) &< 195n< 105(n+k)\\0 &< 91n - 104k < n + k\end{align*}

Since , . Also, , so . Thus, . is unique if it is within a maximum range of , so .

See also

1987 AIME (ProblemsResources)
Preceded by
Problem 7
Followed by
Problem 9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us