1985 AHSME Problems/Problem 26
Revision as of 00:44, 20 March 2024 by Sevenoptimus (talk | contribs) (Fixed answer choices and improved formatting)
Problem
Find the least positive integer for which is a non-zero reducible fraction.
Solution
For the fraction to be reducible, the greatest common factor of the numerator and the denominator must be greater than . Using the Euclidean algorithm, we compute Since is prime, it follows that this GCD will be unless is a multiple of , which first occurs when , so the answer is .
See Also
1985 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 25 |
Followed by Problem 27 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.