Difference between revisions of "2015 AMC 12A Problems/Problem 18"
m (→Problem) |
(→Solution 6 (big fast)) |
||
(12 intermediate revisions by 7 users not shown) | |||
Line 3: | Line 3: | ||
The zeros of the function <math>f(x) = x^2-ax+2a</math> are integers. What is the sum of the possible values of <math>a</math>? | The zeros of the function <math>f(x) = x^2-ax+2a</math> are integers. What is the sum of the possible values of <math>a</math>? | ||
− | <math> \textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18</math> | + | <math>\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 16 \qquad\textbf{(D)}\ 17 \qquad\textbf{(E)}\ 18</math> |
==Solution 1== | ==Solution 1== | ||
Line 79: | Line 79: | ||
The quadratic formula gives <cmath>x = \frac{a \pm \sqrt{a(a-8)}}{2}</cmath>. For <math>x</math> to be an integer, it is necessary (and sufficient!) that <math>a(a-8)</math> to be a perfect square. So we have <math>a(a-8) = b^2</math>; this is a quadratic in itself and the quadratic formula gives <cmath>a = 4 \pm \sqrt{16 + b^2}</cmath> | The quadratic formula gives <cmath>x = \frac{a \pm \sqrt{a(a-8)}}{2}</cmath>. For <math>x</math> to be an integer, it is necessary (and sufficient!) that <math>a(a-8)</math> to be a perfect square. So we have <math>a(a-8) = b^2</math>; this is a quadratic in itself and the quadratic formula gives <cmath>a = 4 \pm \sqrt{16 + b^2}</cmath> | ||
− | We want <math>16 + b^2</math> to be a perfect square. From smartly trying small values of <math>b</math>, we find <math>b = 0, b = 3</math> as solutions, which correspond to <math>a = -1, 0, 8, 9</math>. These are the only ones; if we want to make sure then we must hand check up to <math>b=8</math>. Indeed, for <math>b \geq 9</math> we have that the differences between consecutive squares are greater than <math>16</math> so we can't have <math>b^2 + 16</math> be a perfect square. So summing our values for <math>a</math> we find | + | We want <math>16 + b^2</math> to be a perfect square. From smartly trying small values of <math>b</math>, we find <math>b = 0, b = 3</math> as solutions, which correspond to <math>a = -1, 0, 8, 9</math>. These are the only ones; if we want to make sure then we must hand check up to <math>b=8</math>. Indeed, for <math>b \geq 9</math> we have that the differences between consecutive squares are greater than <math>16</math> so we can't have <math>b^2 + 16</math> be a perfect square. So summing our values for <math>a</math> we find <math>\boxed{16 \textbf{ (C)}}</math>. as the answer. |
− | Additional note: You can use the quadratic and plug in squares for a (since for b^2 to be an integer a would have to be some square), and eventually you can notice a limit to get the answer~ | + | Additional note: You can use the quadratic and plug in squares for a (since for <math>b^2</math> to be an integer <math>a</math> would have to be some square), and eventually you can notice a limit to get the answer~ |
+ | |||
+ | |||
+ | ==Solution 5== | ||
+ | |||
+ | First of all, we know that <math>a</math> is the sum of the quadratic's two roots, by Vieta's formulas. Thus, <math>a</math> must be an integer. Then, we notice that the discriminant <math>a^2-8a</math> must be equal to a perfect square so that the roots are integers. Thus, <math>a(a-8)=b^2</math> where <math>b</math> is an integer. | ||
+ | |||
+ | We can complete the square and rearrange to get <math>(a-4)^2-b^2=16</math>. Let's define <math>m=a-4</math>, just to make things a little easier to write, so now we have <math>(m+b)(m-b)=16</math>. We can now list out the integer factor pairs of 16 and the resulting values of <math>m</math> and <math>b</math>. (Note that <math>m</math> and <math>b</math> must both be integers) | ||
+ | |||
+ | |||
+ | <math>(m+b)(m-b)=16</math> | ||
+ | |||
+ | <math>16*1=16</math> <math>\Rightarrow</math> Doesn't work | ||
+ | |||
+ | <math>8*2=16</math> <math>\Rightarrow</math> <math>m=5, b=3</math> | ||
+ | |||
+ | <math>4*4=16</math> <math>\Rightarrow</math> <math>m=4, b=0</math> | ||
+ | |||
+ | <math>2*8=16</math> <math>\Rightarrow</math> <math>m=5, b=-3</math> | ||
+ | |||
+ | <math>1*16=16</math> <math>\Rightarrow</math> Doesn't work | ||
+ | |||
+ | <math>-16*-1=16</math> <math>\Rightarrow</math> Doesn't work | ||
+ | |||
+ | <math>-8*-2=16</math> <math>\Rightarrow</math> <math>m=-5, b=-3</math> | ||
+ | |||
+ | <math>-4*-4=16</math> <math>\Rightarrow</math> <math>m=-4, b=0</math> | ||
+ | |||
+ | <math>-2*-8=16</math> <math>\Rightarrow</math> <math>m=-5, b=-3</math> | ||
+ | |||
+ | <math>-1*-16=16</math> <math>\Rightarrow</math> Doesn't work | ||
+ | |||
+ | |||
+ | We want the possible values of <math>m</math>, which are <math>-5,-4,4,</math> and <math>5</math>. As <math>m+4=a</math>, <math>a</math> can equal <math>-1,0,8,</math> or <math>9.</math> Adding all of that up gets us our answer, <math>\boxed{\textbf{(C) }16}</math>. | ||
+ | |||
+ | |||
+ | (Solution by Curious_crow) | ||
+ | |||
+ | == Solution 6 (big fast) == | ||
+ | Let our roots be <math>r</math> and <math>s</math>. By vieta's formulas, we have that <math>r+s=a</math> and <math>rs = 2a</math>. Thus, <math>rs = 2r+2s</math>, or <math>(r-2)(s-2) = 4</math>. | ||
+ | |||
+ | 4 can only be obtained from (2,2), (1,4), (-2,-2), or (-1,-4), giving us <math>-1,0,8</math> and <math>9</math>, which add up to <math>\boxed{\textbf{(C)}16}</math> | ||
+ | |||
+ | -skibbysiggy | ||
== See Also == | == See Also == | ||
{{AMC12 box|year=2015|ab=A|num-b=17|num-a=19}} | {{AMC12 box|year=2015|ab=A|num-b=17|num-a=19}} |
Latest revision as of 23:19, 16 September 2024
Contents
Problem
The zeros of the function are integers. What is the sum of the possible values of ?
Solution 1
The problem asks us to find the sum of every integer value of such that the roots of are both integers.
The quadratic formula gives the roots of the quadratic equation:
As long as the numerator is an even integer, the roots are both integers. But first of all, the radical term in the numerator needs to be an integer; that is, the discriminant equals , for some nonnegative integer .
From this last equation, we are given a hint of the Pythagorean theorem. Thus, must be a Pythagorean triple unless .
In the case , the equation simplifies to . From this equation, we have . For both and , yields two integers, so these values satisfy the constraints from the original problem statement. (Note: the two zero roots count as "two integers.")
If is a positive integer, then only one Pythagorean triple could match the triple because the only Pythagorean triple with a as one of the values is the classic triple. Here, and . Hence, . Again, yields two integers for both and , so these two values also satisfy the original constraints.
There are a total of four possible values for : and . Hence, the sum of all of the possible values of is .
Solution 2
By the quadratic formula, the roots can be represented by For , , since and will have different mantissas (mantissae?).
Now observe the discriminant and have two cases.
Positive
and , since gives imaginary roots. Testing positive values, quickly see that . After and , the difference between the closest nonzero factor pairs of perfect squares exceeds . For , . Checking both yields an integer.
Negative
We can instead test with . If , we have our original expression. Thus, for the same reasons, . (0 does not affect the answer).
(Solution by BJHHar)
Solution 3
Let and be the roots of
By Vieta's Formulas, and
Substituting gets us
Using Simon's Favorite Factoring Trick:
This means that the values for are giving us values of and . Adding these up gets .
Solution 4
The quadratic formula gives . For to be an integer, it is necessary (and sufficient!) that to be a perfect square. So we have ; this is a quadratic in itself and the quadratic formula gives
We want to be a perfect square. From smartly trying small values of , we find as solutions, which correspond to . These are the only ones; if we want to make sure then we must hand check up to . Indeed, for we have that the differences between consecutive squares are greater than so we can't have be a perfect square. So summing our values for we find . as the answer.
Additional note: You can use the quadratic and plug in squares for a (since for to be an integer would have to be some square), and eventually you can notice a limit to get the answer~
Solution 5
First of all, we know that is the sum of the quadratic's two roots, by Vieta's formulas. Thus, must be an integer. Then, we notice that the discriminant must be equal to a perfect square so that the roots are integers. Thus, where is an integer.
We can complete the square and rearrange to get . Let's define , just to make things a little easier to write, so now we have . We can now list out the integer factor pairs of 16 and the resulting values of and . (Note that and must both be integers)
Doesn't work
Doesn't work
Doesn't work
Doesn't work
We want the possible values of , which are and . As , can equal or Adding all of that up gets us our answer, .
(Solution by Curious_crow)
Solution 6 (big fast)
Let our roots be and . By vieta's formulas, we have that and . Thus, , or .
4 can only be obtained from (2,2), (1,4), (-2,-2), or (-1,-4), giving us and , which add up to
-skibbysiggy
See Also
2015 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 17 |
Followed by Problem 19 |
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 |