Difference between revisions of "2016 AIME I Problems/Problem 12"
(Created page with "==Problem == Find the least positive integer <math>m</math> such that <math>m^2 - m + 11</math> is a product of at least four not necessarily distinct primes. ==Solution== {{...") |
|||
Line 2: | Line 2: | ||
Find the least positive integer <math>m</math> such that <math>m^2 - m + 11</math> is a product of at least four not necessarily distinct primes. | Find the least positive integer <math>m</math> such that <math>m^2 - m + 11</math> is a product of at least four not necessarily distinct primes. | ||
==Solution== | ==Solution== | ||
− | + | We claim <math>m = 132</math>. Note <math>132^2 - 132 + 11 = 11^3 \cdot 13</math>. | |
+ | |||
+ | Suppose <math>m < 132</math> and <math>m^2 - m + 11 = pqrs</math> for primes <math>p, q, r, s</math>. We easily verify that <math>p, q, r, s \ge 11</math> using quadratic residue argument. But <math>p, q, r, s = 11</math> yields no integer solution for <math>m</math>. Thus <math>pqrs \ge 11^3 \cdot 13</math>. But this requires <math>m \ge 132</math> from solving the quadratic, contradiction. Hence <math>m = 132</math>. | ||
==See Also== | ==See Also== | ||
{{AIME box|year=2016|n=I|num-b=11|num-a=13}} | {{AIME box|year=2016|n=I|num-b=11|num-a=13}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 18:51, 4 March 2016
Problem
Find the least positive integer such that is a product of at least four not necessarily distinct primes.
Solution
We claim . Note .
Suppose and for primes . We easily verify that using quadratic residue argument. But yields no integer solution for . Thus . But this requires from solving the quadratic, contradiction. Hence .
See Also
2016 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.