首页> 重点归纳 > 考题18-19 2015 AMC 12A

考题18-19 2015 AMC 12A

2018-08-22 重点归纳

AMC12是针对高中学生的数学测验，该竞赛开始于2000年，分A赛和B赛，于每年的2月初和2月中举行，学生可任选参加一项即可。其主要目的在于激发学生对数学的兴趣，参予AMC12的学生应该不难发现测验的问题都很具挑战性，但测验的题型都不会超过学生的学习范围。这项测验希望每个考生能从竞赛中享受数学。那么接下来跟随小编来看一下AMC12的官方真题以及官方解答吧：

Problem 18

The zeros of the function $f(x) = x^2-ax+2a$ are integers. What is the sum of the possible values of $a$ ?

$\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

Solution 1

The problem asks us to find the sum of every integer value of $a$ such that the roots of $x^2 - ax + 2a = 0$ are both integers.

The quadratic formula gives the roots of the quadratic equation: $amc12$

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 $a^2 - 8a$ equals $k^2$ , for some nonnegative integer $k$ .

$a^2-8a=k^2$

$a(a-8)=k^2$

$amc12$

$(a-4)^2-4^2=k^2$

$(a-4)^2=k^2+4^2$

From this last equation, we are given a hint of the Pythagorean theorem. Thus, $(k,4,|a-4|)$ must be a Pythagorean triple unless $k = 0$ .

In the case $k=0$ , the equation simplifies to $|a-4|=4$ . From this equation, we have $a=0,8$ . For both $a=0$ and $a=8$ , $\frac{a\pm\sqrt{a^2-8a}}{2}$ yields two integers, so these values satisfy the constraints from the original problem statement. (Note: the two zero roots count as "two integers.")

If $k$ is a positive integer, then only one Pythagorean triple could match the triple $(k,4,|a - 4|)$ because the only Pythagorean triple with a $4$ as one of the values is the classic $(3,4,5)$ triple. Here, $k=3$ and $|a-4|=5$ . Hence, $a=-1,9$ . Again, $amc数学竞赛官网$ yields two integers for both $a=-1$ and $a=9$ , so these two values also satisfy the original constraints.

There are a total of four possible values for $a$ : $-1,0,8,$ and $9$ . Hence, the sum of all of the possible values of $a$ is $\boxed{\textbf{(C) }16}$ .

Solution 2

Let $m$ and $n$ be the roots of $x^2-ax+2a$

By Vieta's Formulas, $n+m=a$ and $mn=2a$

Substituting gets us $n+m=\frac{mn}{2}$

$2n-mn+2m=0$

Using Simon's Favorite Factoring Trick:

$n(2-m)+2m=0$

$-n(2-m)-2m=0$

$-n(2-m)-2m+4=4$

$(2-n)(2-m)=4$

This means that the values for $(m,n)$ are $(0,0),(4,4),(3,6),(1,-2)$ giving us $a$ values of $-1,0,8,$ and $9$ . Adding these up gets $\boxed{\textbf{(C) }16}$ .

Solution 3

The quadratic formula gives $x = \frac{a \pm \sqrt{a(a-8)}}{2}$ . For $x$ to be an integer, it is necessary (and sufficient!) that $a(a-8)$ to be a perfect square. So we have $a(a-8) = b^2$ ; this is a quadratic in itself and the quadratic formula gives $amc数学竞赛试题及答案$

We want $16 + b^2$ to be a perfect square. From smartly trying small values of $b$ , we find $b = 0, b = 3$ as solutions, which correspond to $a = -1, 0, 8, 9$ . These are the only ones; if we want to make sure then we must hand check up to $b=8$ . Indeed, for $b \geq 9$ we have that the differences between consecutive squares are greater than $16$ so we can't have $b^2 + 16$ be a perfect square. So summing our values for $a$ we find 16 (C) as the answer.

Problem 19

For some positive integers $p$ , there is a quadrilateral $ABCD$ with positive integer side lengths, perimeter $p$ , right angles at $B$ and $C$ , $AB=2$ , and $CD=AD$ . How many different values of $p<2015$ are possible?

$\textbf{(A) }30\qquad\textbf{(B) }31\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$

Solution

Let $BC = x$ and $CD = AD = y$ be positive integers. Drop a perpendicular from $A$ to $CD$ to show that, using the Pythagorean Theorem, that $x^2 + (y - 2)^2 = y^2.$ Simplifying yields $x^2 - 4y + 4 = 0$ , so $x^2 = 4(y - 1)$ . Thus, $y$ is one more than a perfect square.

The perimeter $p = 2 + x + 2y = 2y + 2\sqrt{y - 1} + 2$ must be less than 2015. Simple calculations demonstrate that $y = 31^2 + 1 = 962$ is valid, but $y = 32^2 + 1 = 1025$ is not. On the lower side, $y = 1$ does not work (because $x > 0$ ), but $y = 1^2 + 1$ does work. Hence, there are 31 valid $y$ (all $y$ such that $y = n^2 + 1$ for $1 \le n \le 31$ ), and so our answer is $\boxed{\textbf{(B) } 31}$