Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1987 AIME Problems/Problem 8"

m (cat etc)
(→‎Solution)
Line 2: Line 2:
 
What is the largest positive integer <math>n</math> for which there is a unique integer <math>k</math> such that <math>\frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}</math>?
 
What is the largest positive integer <math>n</math> for which there is a unique integer <math>k</math> such that <math>\frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}</math>?
 
== Solution ==
 
== Solution ==
 +
 +
'''Solution 1'''
 
Multiplying out all of the [[denominator]]s, we get:
 
Multiplying out all of the [[denominator]]s, we get:
  
Line 8: Line 10:
  
 
Since <math>91n - 104k < n + k</math>, <math>k > \frac{6}{7}n</math>. Also, <math>0 < 91n - 104k</math>, so <math>k < \frac{7n}{8}</math>. Thus, <math>48n < 56k < 49n</math>. <math>k</math> is unique if it is within a maximum [[range]] of <math>112</math>, so <math>n = 112</math>.
 
Since <math>91n - 104k < n + k</math>, <math>k > \frac{6}{7}n</math>. Also, <math>0 < 91n - 104k</math>, so <math>k < \frac{7n}{8}</math>. Thus, <math>48n < 56k < 49n</math>. <math>k</math> is unique if it is within a maximum [[range]] of <math>112</math>, so <math>n = 112</math>.
 +
 +
'''Solution 2'''
 +
Flip all of the fractions for
 +
 +
<math>\frac{15}{8} > \frac{k + n}{n} > \frac{13}{7}</math>
 +
 +
<math>105n > 56 (k + n) > 104n</math>
 +
 +
<math>49n > 56k > 48n</math>
 +
 +
Continue as in Solution 1.
  
 
== See also ==
 
== See also ==

Revision as of 16:25, 15 March 2011

Problem

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

Solution

Solution 1 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 $91n - 104k < n + k$, $k > \frac{6}{7}n$. Also, $0 < 91n - 104k$, so $k < \frac{7n}{8}$. Thus, $48n < 56k < 49n$. $k$ is unique if it is within a maximum range of $112$, so $n = 112$.

Solution 2 Flip all of the fractions for

$\frac{15}{8} > \frac{k + n}{n} > \frac{13}{7}$

$105n > 56 (k + n) > 104n$

$49n > 56k > 48n$

Continue as in Solution 1.

See also

1987 AIME (Problems • Answer Key • Resources)
Preceded by
Problem 7 		Followed by
Problem 9
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1987_AIME_Problems/Problem_8&oldid=37382"