返回题库

AIME 2005 II · 第 13 题

AIME 2005 II — Problem 13

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Let P(x)P(x) be a polynomial with integer coefficients that satisfies P(17)=10P(17)=10 and P(24)=17.P(24)=17. Given that P(n)=n+3P(n)=n+3 has two distinct integer solutions n1n_1 and n2,n_2, find the product n1n2.n_1\cdot n_2.

解析

Solution

We define Q(x)=P(x)x+7Q(x)=P(x)-x+7, noting that it has roots at 1717 and 2424. Hence P(x)x+7=A(x17)(x24)P(x)-x+7=A(x-17)(x-24). In particular, this means that P(x)x3=A(x17)(x24)10P(x)-x-3=A(x-17)(x-24)-10. Therefore, x=n1,n2x=n_1,n_2 satisfy A(x17)(x24)=10A(x-17)(x-24)=10, where AA, (x17)(x-17), and (x24)(x-24) are integers. This cannot occur if x17x\le 17 or x24x\ge 24 because the product (x17)(x24)(x-17)(x-24) will either be too large or not be a divisor of 1010. We find that x=19x=19 and x=22x=22 are the only values that allow (x17)(x24)(x-17)(x-24) to be a factor of 1010. Hence the answer is 1922=41819\cdot 22=\boxed{418}.

Solution 2

We know that P(n)(n+3)=0P(n)-(n+3)=0 so P(n)P(n) has two distinct solutions so P(x)P(x) is at least quadratic. Let us first try this problem out as if P(x)P(x) is a quadratic polynomial. Thus P(n)(n+3)=an2+(b1)n+(c3)=0P(n)-(n+3)= an^2+(b-1)n+(c-3)=0 because P(n)=an2+bn+cP(n)=an^2+bn+c where a,b,ca,b,c are all integers. Thus P(x)=ax2+bx+cP(x)=ax^2+bx+c where a,b,ca,b,c are all integers. We know that P(17)P(17) or 289a+17b+c=10289a+17b+c=10 and P(24)P(24) or 576a+24b+c=17576a+24b+c=17. By doing P(24)P(17)P(24)-P(17) we obtain that 287a+7b=7287a+7b=7 or 41a+b=141a+b=1 or 41a=b1-41a=b-1. Thus P(n)=an2(41a)n+(c3)=0P(n)=an^2- (41a)n+(c-3)=0. Now we know that b=41a+1b=-41a+1, we have 289a+17(41a+1)+c=10289a+17(-41a+1)+c=10 or 408a=7+c408a=7+c which makes 408a10=c3408a-10=c-3. Thus P(n)=an2(41a)n+(408a10)=0P(n)=an^2-(41a)n+(408a-10)=0. By Vieta's formulas, we know that the sum of the roots(nn) is equal to 41 and the product of the roots(nn) is equal to 40810a408-\frac{10}{a}. Because the roots are integers 10a\frac{10}{a} has to be an integer, so a=1,2,5,10,1,2,5,10a=1,2,5,10,-1,-2,-5,-10. Thus the product of the roots is equal to one of the following: 398,403,406,407,409,410,413,418398,403,406,407,409,410,413,418. Testing every potential product of the roots, we find out that the only product that can have divisors that sum up to 4141 is 418\boxed{418}.

-David Camacho

Solution 3

We have P(n1)=n1+3P(n_1) = n_1+3. Using the property that abP(a)P(b)a - b \mid P(a) - P(b) whenever aa and bb are distinct integers, we get

n117P(n1)P(17)=(n1+3)10=n17,n_1 - 17 \mid P(n_1) - P(17) = (n_1+3) - 10 = n_1 - 7, and

n124P(n1)P(24)=(n1+3)17=n114.n_1 - 24 \mid P(n_1) - P(24) = (n_1+3)-17=n_1-14. Since n17=10+(n117)n_1 - 7 = 10 + (n_1-17) and n114=10+(n124)n_1-14 = 10 + (n_1-24), we must have

n11710  and  n12410.n_1 - 17 \mid 10 \; \text{and} \; n_1-24 \mid 10. We look for two divisors of 1010 that differ by 77; we find that {2,5}\{2, -5\} and {5,2}\{5, -2\} satisfies these conditions. Therefore, either n124=5n_1 - 24 = -5, giving n1=19n_1 = 19, or n124=2n_1 - 24 = -2, giving n1=22n_1 = 22. From this, we conclude that n1,n2=19,22n_1, n_2 = \boxed{19, 22} and that n1n2=418n_1\cdot n_2=\boxed{418}.

~ Alcumus (Solution)