Difference between revisions of "2013 AMC 12B Problems/Problem 22"
(→See also) |
IMOJonathan (talk | contribs) m |
||
Line 4: | Line 4: | ||
is the smallest possible integer. What is <math>m+n</math>? | is the smallest possible integer. What is <math>m+n</math>? | ||
− | <math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D | + | <math> \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 272 </math> |
==Solution== | ==Solution== |
Revision as of 23:15, 5 April 2015
Problem
Let and be integers. Suppose that the product of the solutions for of the equation is the smallest possible integer. What is ?
Solution
Rearranging logs, the original equation becomes
By Vieta's Theorem, the sum of the possible values of is . But the sum of the possible values of is the logarithm of the product of the possible values of . Thus the product of the possible values of is equal to .
It remains to minimize the integer value of . Since , we can check that and work. Thus the answer is .
See also
2013 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 21 |
Followed by Problem 23 |
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 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.