返回题库

AIME 2011 I · 第 15 题

AIME 2011 I — Problem 15

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

For some integer mm, the polynomial x32011x+mx^3 - 2011x + m has the three integer roots aa, bb, and cc. Find a+b+c|a| + |b| + |c|.

解析

Solution 1

From Vieta's formulas, we know that a+b+c=0a+b+c = 0, and ab+bc+ac=2011ab+bc+ac = -2011. Thus a=(b+c)a = -(b+c). All three of aa, bb, and cc are non-zero: say, if a=0a=0, then b=c=±2011b=-c=\pm\sqrt{2011} (which is not an integer). \textscwlog\textsc{wlog}, let abc|a| \ge |b| \ge |c|. If a>0a > 0, then b,c<0b,c < 0 and if a<0a < 0, then b,c>0,b,c > 0, from the fact that a+b+c=0a+b+c=0. We have

2011=ab+bc+ac=a(b+c)+bc=a2+bc-2011=ab+bc+ac = a(b+c)+bc = -a^2+bc Thus a2=2011+bca^2 = 2011 + bc. We know that bb, cc have the same sign, so product bcbc is always positive. So a45=2011|a| \ge 45 = \lceil \sqrt{2011} \rceil.

Also, if we fix aa, b+cb+c is fixed, so bcbc is maximized when b=cb = c . Hence,

2011=a2bc>34a2a2<432011=2681+132011 = a^2 - bc > \tfrac{3}{4}a^2 \qquad \Longrightarrow \qquad a ^2 < \tfrac{4}{3}\cdot 2011 = 2681+\tfrac{1}{3} So a51|a| \le 51. Thus we have bounded aa as 45a5145\le |a| \le 51, i.e. 45b+c5145\le |b+c| \le 51 since a=(b+c)a=-(b+c). Let's analyze bc=(b+c)22011bc=(b+c)^2-2011. Here is a table:

a|a| bc=a22011bc=a^2-2011 4545 1414 4646 105105 4747 198198 4848 293293 4949 390390

We can tell we don't need to bother with 4545,

105=(3)(5)(7)105 = (3)(5)(7), So 4646 won't work. 198/47>4198/47 > 4,

198198 is not divisible by 55, 198/6=33198/6 = 33, which is too small to get 4747.

293/48>6293/48 > 6, 293293 is not divisible by 77 or 88 or 99, we can clearly tell that 1010 is too much.

Hence, a=49|a| = 49, a22011=390a^2 -2011 = 390. b=39b = 39, c=10c = 10.

Answer: 098\boxed{098}

Solution 2

Starting off like the previous solution, we know that a+b+c=0a + b + c = 0, and ab+bc+ac=2011ab + bc + ac = -2011.

Therefore, c=bac = -b-a.

Substituting, ab+b(ba)+a(ba)=abb2ababa2=2011ab + b(-b-a) + a(-b-a) = ab-b^2-ab-ab-a^2 = -2011.

Factoring the perfect square, we get: ab(b+a)2=2011ab-(b+a)^2=-2011 or (b+a)2ab=2011(b+a)^2-ab=2011.

Therefore, a sum (a+ba+b) squared minus a product (abab) gives 20112011..

We can guess and check different a+ba+b’s starting with 4545 since 442<201144^2 < 2011.

452=202545^2 = 2025 therefore ab=20252011=14ab = 2025-2011 = 14.

Since no factors of 1414 can sum to 4545 (1+141+14 being the largest sum), a + b cannot equal 4545.

462=211646^2 = 2116 making ab=105=357ab = 105 = 3 * 5 * 7.

57+3<465 * 7 + 3 < 46 and 357>463 * 5 * 7 > 46 so 4646 cannot work either.

We can continue to do this until we reach 4949.

492=240149^2 = 2401 making ab=390=23513ab = 390 = 2 * 3 * 5* 13.

313+25=493 * 13 + 2* 5 = 49, so one root is 1010 and another is 3939. The roots sum to zero, so the last root must be 49-49.

49+10+39=098|-49|+10+39 = \boxed{098}.

Solution 3

Let us first note the obvious that is derived from Vieta's formulas: a+b+c=0,ab+bc+ac=2011a+b+c=0, ab+bc+ac=-2011. Now, due to the first equation, let us say that a+b=ca+b=-c, meaning that a,b>0a,b>0 and c<0c<0. Now, since both aa and bb are greater than 0, their absolute values are both equal to aa and bb, respectively. Since cc is less than 0, it equals ab-a-b. Therefore, c=ab=a+b|c|=|-a-b|=a+b, meaning a+b+c=2(a+b)|a|+|b|+|c|=2(a+b). We now apply Newton's sums to get that a2+b2+ab=2011a^2+b^2+ab=2011,or (a+b)2ab=2011(a+b)^2-ab=2011. Solving, we find that 49239049^2-390 satisfies this, meaning a+b=49a+b=49, so 2(a+b)=0982(a+b)=\boxed{098}.

Solution 4 (Quadratic)

From Vieta's Formulas we have a+b+c=0a + b + c = 0 and a(b+c)+bc=2011.a(b + c) + bc = -2011. b+c=a    a2+bc=2011.b + c = -a \implies -a^2 + bc = -2011. a2=(b+c)2    bc+2011=(b+c)2.a^2 = (b + c)^2 \implies bc + 2011 = (b + c)^2. So now we have a simple looking two-variable quadratic equation. From here, we can solve for cc in terms of bb using the quadratic formula and see if we can do something with the discriminant. bc+2011=b2+2bc+c2.bc + 2011 = b^2 + 2bc + c^2. c2+(b)c+(b22011)=0.c^2 + (b)c + (b^2 - 2011) = 0. So c=b±80443b22.c = \frac{-b \pm \sqrt{8044 - 3b^2}}{2}. So 80443b28044 - 3b^2 must be a perfect square. 80448044 is around 89289^2, so we can start from here and work downwards. Immediately, we see that if 80443b2=882,b=10.8044 - 3b^2 = 88^2, b = 10. Will this work? If b=10,b = 10, then cc can be 49-49 or 3939. So we have two cases:

Case 1: c=49c = -49

b+c=39b + c = -39 and bc=490bc = -490

a(39)490=2011    a=39.a(-39) - 490 = -2011 \implies a = -39. But this doesn't satisfy the equation a+b+c=0,a + b + c = 0, so this case won't work.

Case 2: c=39c = 39

b+c=49b + c = 49 and bc=390bc = 390

a(49)+390=2011    a=49.a(49) + 390 = -2011 \implies a = -49. Since a+b+c=10+3949=0a + b + c = 10 + 39 - 49 = 0 this works.

So our answer is 10+39+49=98.10 + 39 + 49 = \boxed{98}.

~grogg007

Solution 5 (mod to help bash)

First, derive the equations a=bca=-b-c and ab+bc+ca=2011    b2+bc+c2=2011ab+bc+ca=-2011\implies b^2+bc+c^2=2011. Since the product is negative, aa is negative, and bb and cc positive. Now, a simple mod 3 testing of all cases shows that b{1,2}(mod3)b\equiv \{1,2\} \pmod{3}, and cc has the repective value. We can choose bb not congruent to 0, make sure you see why. Now, we bash on values of bb, testing the quadratic function to see if cc is positive. You can also use a delta argument like solution 4, but this is simpler. We get that for b=10b=10, c=39,49c=39, -49. Choosing cc positive we get a=49a=-49, so a+b+c=10+49+39=098|a|+|b|+|c|=10+49+39=\boxed{098} ~firebolt360

Solution 6

Note that c=b+a-c=b+a, so c2=a2+2ab+b2c^2=a^2+2ab+b^2, or c2+ab=a2abb2-c^2+ab=-a^2-ab-b^2. Also, ab+bc+ca=2011ab+bc+ca=-2011, so (a+b)c+ab=c2+ab=2011(a+b)c+ab=-c^2+ab=-2011. Substituting c2+ab=a2abb2-c^2+ab=-a^2-ab-b^2, we can obtain a2+ab+b2=2011a^2+ab+b^2=2011, or a3b3ab=2011\frac{a^3-b^3}{a-b}=2011. If it is not known that 20112011 is prime, it may be proved in 55 minutes or so by checking all primes up to 4343. If 20112011 divided either of a,ba, b, then in order for a3b3a^3-b^3 to contain an extra copy of 20112011, both a,ba, b would need to be divisible by 20212021. But then cc would also be divisible by 20112011, and the sum ab+bc+caab+bc+ca would clearly be divisible by 201122011^2.

By LTE, v2011(a3b3)=v2011(ab)v_{2011}(a^3-b^3)=v_{2011}(a-b) if aba-b is divisible by 20112011 and neither a,ba,b are divisible by 20112011. Thus, the only possibility remaining is if aba-b did not divide 20112011. Let a=k+ba=k+b. Then, we have (b+k)3b3=2011k(b+k)^3-b^3=2011k. Rearranging gives 3b(b+k)=2011k23b(b+k)=2011-k^2. As in the above solutions, we may eliminate certain values of kk by using mods. Then, we may test values until we obtain k=29k=29, and a=10a=10. Thus, b=39b=39, c=49c=-49, and our answer is 49+39+10=09849+39+10=098.

Solution 7

For the monic cubic x32011x+mx^3 - 2011x + m with integer roots a,b,ca,b,c, we have

a+b+c=0,ab+ac+bc=2011,abc=m.a+b+c=0,\quad ab+ac+bc=-2011,\quad abc=-m.

Set c=(a+b).c=-(a+b). Then

ab+a(ab)+b(ab)=2011,ab + a(-a-b) + b(-a-b) = -2011, which simplifies to

a2abb2=2011        a2+ab+b2=2011.-a^2 - ab - b^2 = -2011 \;\;\Longrightarrow\;\; a^2+ab+b^2=2011. Treat this as a quadratic in aa. Its discriminant must be a perfect square:

Δ=b24(b22011)=80443b2=k2for some integer k.\Delta = b^2 - 4(b^2 - 2011) = 8044 - 3b^2 = k^2 \quad \text{for some integer }k. Thus 3b2+k2=8044.3b^2 + k^2 = 8044. Checking integer bb with b51|b|\leq 51 (since 3b280443b^2 \leq 8044) yields solutions only when b=10,  39,  49(up to sign),b=10,\;39,\;49 \quad (\text{up to sign}), which produce the root triples (up to permutation)

(39,10,49)(39,\,10,\,-49) and the sign-permuted equivalent

(39,10,49).(-39,\,-10,\,49).

These satisfy a+b+c=0andab+ac+bc=2011.a+b+c=0 \quad \text{and} \quad ab+ac+bc=-2011. Therefore a+b+c=39+10+49=98|a|+|b|+|c| = 39+10+49 =\boxed{98}.

Video Solution

https://www.youtube.com/watch?v=QNbfAu5rdJI&t=26s ~ MathEx