1985 AMC 12 Problem 26

Attempt Problem 26 of the 1985 AMC 12 below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1985 AMC 12 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

26.

Find the least positive integer nn for which n−135n+6\frac{n-13}{5n+6} is a non-zero reducible fraction.
4545
6868
155155
226226
none of these
Answer: E
Concepts:greatest common divisormodular arithmetic
Small hint:
Any common divisor of n−13n-13 and 5n+65n+6 also divides a suitable linear combination
Big hint:
Compute (5n+6)−5(n−13)(5n+6)-5(n-13)
Solution:
Euclid’s algorithm gives gcd⁡(n−13,5n+6)=gcd⁡(n−13,71). \begin{aligned} &\gcd(n-13,5n+6)\\ &\quad=\gcd(n-13,71). \end{aligned} Since 7171 is prime, the nonzero fraction is reducible exactly when n−13n-13 is a nonzero multiple of 71.71. The least positive possibility is n=13+71=84,n=13+71=84, which is not among the four numerical choices.
Thus the correct answer is E.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.