2006 AIME I Solutions

Scroll down to view professionally curated solutions from LIVE by Po-Shen Loh, print PDF solutions, view answer key, or take the full timed exam.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

1.

In quadrilateral ABCD,ABCD, B\angle B is a right angle, diagonal AC\overline{AC} is perpendicular to CD,\overline{CD}, AB=18,AB = 18, BC=21,BC = 21, and CD=14.CD = 14. Find the perimeter of ABCD.ABCD.

Concepts:Pythagorean Theoremperimeter
Difficulty rating: 1790
Small Hint:

Diagonal AC\overline{AC} splits the quadrilateral into two right triangles that share ACAC

Big Hint:

Apply the Pythagorean theorem twice: DA2=(AB2+BC2)+CD2DA^2 = (AB^2 + BC^2) + CD^2

Solution:

Triangle ABCABC is right-angled at B,B, so AC2=182+212=765.AC^2 = 18^2 + 21^2 = 765. Triangle ACDACD is right-angled at C,C, so DA2=AC2+CD2DA^2 = AC^2 + CD^2 =765+196=961,= 765 + 196 = 961, giving DA=31.DA = 31.

The perimeter is 18+21+14+31=84.18 + 21 + 14 + 31 = 84.

2.

Let set A\mathcal{A} be a 9090-element subset of {1,2,3,,100},\{1, 2, 3, \ldots, 100\}, and let SS be the sum of the elements of A.\mathcal{A}. Find the number of possible values of S.S.

Difficulty rating: 1890
Small Hint:

Find the smallest and largest possible sums, then show every value between them occurs

Big Hint:

If the sum is not maximal, some element kk of A\mathcal{A} has k+1A;k + 1 \notin \mathcal{A}; replacing kk by k+1k + 1 raises the sum by exactly 11

Solution:

The smallest possible sum is 1+2++90=4095,1 + 2 + \cdots + 90 = 4095, and the largest is 11+12++100=4995.11 + 12 + \cdots + 100 = 4995.

Every integer in between also occurs. Suppose A\mathcal{A} has sum S4994,S \le 4994, and let kk be the smallest element of A\mathcal{A} with k+1A.k + 1 \notin \mathcal{A}. If kk were 100,100, then A\mathcal{A} would be a block of consecutive integers ending at 100,100, namely {11,,100},\{11, \ldots, 100\}, whose sum exceeds 4994.4994. So k100,k \ne 100, and replacing kk by k+1k + 1 produces a 9090-element subset with sum S+1.S + 1.

Hence SS takes every value from 40954095 to 4995,4995, for 49954095+1=9014995 - 4095 + 1 = 901 possible values.

3.

Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is 129\frac{1}{29} of the original integer.

Difficulty rating: 2020
Small Hint:

If the leftmost digit dd sits in the 10p10^p place and nn remains after deleting it, then d10p+n=29nd \cdot 10^p + n = 29n

Big Hint:

d10p=28nd \cdot 10^p = 28n forces dd to be divisible by 7,7, so d=7d = 7 and 10p=4n10^p = 4n

Solution:

Let dd be the leftmost digit and nn the integer that remains after deleting it, so the original integer is d10p+nd \cdot 10^p + n for some positive integer p.p. The condition says d10p+n=29n,d \cdot 10^p + n = 29n, so d10p=28n.d \cdot 10^p = 28n.

Since 28n28n is divisible by 77 but 10p10^p is not, the digit dd must be a multiple of 7,7, so d=7.d = 7. Then 10p=4n,10^p = 4n, giving n=2510p2,n = 25 \cdot 10^{p-2}, which requires p2.p \ge 2. The smallest case is p=2,p = 2, n=25.n = 25.

The least such integer is 725,725, and indeed 725=2925.725 = 29 \cdot 25.

4.

Let NN be the number of consecutive 00’s at the right end of the decimal representation of the product 1!2!3!4!99!100!.1!\,2!\,3!\,4! \cdots 99!\,100!. Find the remainder when NN is divided by 1000.1000.

Difficulty rating: 2400
Small Hint:

Count factors of 5:5: the integer jj appears as a factor in exactly 101j101 - j of the factorials

Big Hint:

Sum 101j101 - j over all multiples of 5,5, then add the same sum over multiples of 2525 for their second factor of 55

Solution:

Factors of 22 are plentiful, so NN is the exponent of 55 in the product. Each integer jj with 1j1001 \le j \le 100 appears as a factor in exactly 101j101 - j of the factorials, namely j!,(j+1)!,,100!.j!, (j+1)!, \ldots, 100!.

Every multiple of 55 contributes one factor of 55 per appearance, and every multiple of 2525 contributes one more. Over j=5,10,,100j = 5, 10, \ldots, 100 the appearances total 96+91++1=20972=970,96 + 91 + \cdots + 1 = \frac{20 \cdot 97}{2} = 970, and over j=25,50,75,100j = 25, 50, 75, 100 they total 76+51+26+1=154.76 + 51 + 26 + 1 = 154.

Hence N=970+154=1124,N = 970 + 154 = 1124, and the remainder upon division by 10001000 is 124.124.

5.

The number 1046+46810+14415+2006\small \sqrt{104\sqrt{6} + 468\sqrt{10} + 144\sqrt{15} + 2006} can be written as a2+b3+c5,a\sqrt{2} + b\sqrt{3} + c\sqrt{5}, where a,a, b,b, and cc are positive integers. Find abc.a \cdot b \cdot c.

Difficulty rating: 2270
Small Hint:

Square a2+b3+c5a\sqrt{2} + b\sqrt{3} + c\sqrt{5} and match the coefficients of 6,\sqrt{6}, 10,\sqrt{10}, and 15\sqrt{15}

Big Hint:

(abc)2=(ab)(ac)(bc),(abc)^2 = (ab)(ac)(bc), so you never need a,a, b,b, cc individually

Solution:

Squaring a2+b3+c5a\sqrt{2} + b\sqrt{3} + c\sqrt{5} gives 2a2+3b2+5c2+2ab6+2ac10+2bc15. \begin{aligned} &2a^2 + 3b^2 + 5c^2 \\ &\quad {}+ 2ab\sqrt{6} + 2ac\sqrt{10} \\ &\quad {}+ 2bc\sqrt{15}. \end{aligned} Matching coefficients yields 2ab=104,2ab = 104, 2ac=468,2ac = 468, 2bc=144,2bc = 144, that is ab=52,ab = 52, ac=234,ac = 234, bc=72,bc = 72, along with 2a2+3b2+5c2=2006.2a^2 + 3b^2 + 5c^2 = 2006.

Then (abc)2=(ab)(ac)(bc)=5223472=876096=9362, \begin{aligned} (abc)^2 &= (ab)(ac)(bc) \\ &= 52 \cdot 234 \cdot 72 \\ &= 876096 = 936^2, \end{aligned} so abc=936.abc = 936. As a check, a=abcbc=13,a = \frac{abc}{bc} = 13, b=abcac=4,b = \frac{abc}{ac} = 4, c=abcab=18,c = \frac{abc}{ab} = 18, and 2169+316+5324=338+48+1620=2006, \begin{aligned} &2 \cdot 169 + 3 \cdot 16 + 5 \cdot 324 \\ &= 338 + 48 + 1620 \\ &= 2006, \end{aligned} as required.

Therefore abc=936.a \cdot b \cdot c = 936.

6.

Let S\mathcal{S} be the set of real numbers that can be represented as repeating decimals of the form 0.abc0.\overline{abc} where a,a, b,b, cc are distinct digits. Find the sum of the elements of S.\mathcal{S}.

Difficulty rating: 2300
Small Hint:

0.abc=100a+10b+c999,0.\overline{abc} = \frac{100a + 10b + c}{999}, and there are 1098=72010 \cdot 9 \cdot 8 = 720 elements to add

Big Hint:

By symmetry each digit 00 through 99 appears exactly 7272 times in each of the three positions

Solution:

Each element equals 0.abc=100a+10b+c999,0.\overline{abc} = \frac{100a + 10b + c}{999}, and there are 1098=72010 \cdot 9 \cdot 8 = 720 ordered triples of distinct digits. By symmetry, each digit 00 through 99 appears in each of the three positions exactly 72010=72\frac{720}{10} = 72 times.

The numerators therefore total 72(0+1++9)(100+10+1)=7245111=359640, \begin{aligned} &72 (0 + 1 + \cdots + 9) \\ &\quad {}\cdot (100 + 10 + 1) \\ &= 72 \cdot 45 \cdot 111 = 359640, \end{aligned} so the sum of the elements is 359640999=360.\frac{359640}{999} = 360.

7.

An angle is drawn on a set of equally spaced parallel lines as shown. The ratio of the area of shaded region C\mathcal{C} to the area of shaded region B\mathcal{B} is 115.\frac{11}{5}. Find the ratio of the area of shaded region D\mathcal{D} to the area of shaded region A.\mathcal{A}.

Difficulty rating: 2500
Small Hint:

With unit spacing, every region is a difference of similar triangles, so areas scale as squares of distances from the vertex

Big Hint:

If xx is the vertex’s distance to the first line, then CB=2x+72x+3=115\frac{\mathcal{C}}{\mathcal{B}} = \frac{2x+7}{2x+3} = \frac{11}{5} determines xx

Solution:

Take the spacing between consecutive lines as the unit, and let xx be the distance from the vertex of the angle to the first line. The triangle cut off by the jjth line is similar to triangle A\mathcal{A} with ratio x+j1x,\frac{x + j - 1}{x}, so its area is proportional to (x+j1)2,(x + j - 1)^2, and the strip between lines jj and j+1j + 1 has area proportional to (x+j)2(x + j)^2 (x+j1)2=2x+2j1.- (x + j - 1)^2 = 2x + 2j - 1.

Regions B,\mathcal{B}, C,\mathcal{C}, and D\mathcal{D} are the strips beginning at lines 2,2, 4,4, and 6,6, with areas proportional to 2x+3,2x + 3, 2x+7,2x + 7, and 2x+11.2x + 11. The given ratio yields 2x+72x+3=115,\frac{2x+7}{2x+3} = \frac{11}{5}, so 10x+35=22x+3310x + 35 = 22x + 33 and x=16.x = \frac{1}{6}.

Since A\mathcal{A} has area proportional to x2,x^2, the requested ratio is 2x+11x2=343136=408.\frac{2x + 11}{x^2} = \frac{\frac{34}{3}}{\frac{1}{36}} = 408.

8.

Hexagon ABCDEFABCDEF is divided into five rhombuses, P,\mathcal{P}, Q,\mathcal{Q}, R,\mathcal{R}, S,\mathcal{S}, and T,\mathcal{T}, as shown. Rhombuses P,\mathcal{P}, Q,\mathcal{Q}, R,\mathcal{R}, and S\mathcal{S} are congruent, and each has area 2006.\sqrt{2006}. Let KK be the area of rhombus T.\mathcal{T}. Given that KK is a positive integer, find the number of possible values for K.K.

Difficulty rating: 2560
Small Hint:

All five rhombuses share the same side length, and the three angles meeting along AB\overline{AB} add to 180180^\circ

Big Hint:

If each congruent rhombus has area z2sinα,z^2 \sin\alpha, then K=22006cosα;K = 2\sqrt{2006}\,\cos\alpha; find which positive integers this can equal

Solution:

Since T\mathcal{T} shares a side with each of the other rhombuses, all five have the same side length z.z. Let YY be the vertex of T\mathcal{T} on AB,\overline{AB}, and let α\alpha be the angle of P\mathcal{P} at Y.Y. Then each congruent rhombus has area z2sinα=2006.z^2 \sin\alpha = \sqrt{2006}. The angles of P,\mathcal{P}, T,\mathcal{T}, and Q\mathcal{Q} at YY lie along the line AB,AB, and by symmetry Q\mathcal{Q}’s angle there also equals α,\alpha, so T\mathcal{T}’s angle is 1802α.180^\circ - 2\alpha. Hence K=z2sin(1802α)=z2sin2α=2z2sinαcosα=22006cosα. \begin{aligned} K &= z^2 \sin(180^\circ - 2\alpha) \\ &= z^2 \sin 2\alpha \\ &= 2 z^2 \sin\alpha \cos\alpha \\ &= 2\sqrt{2006}\,\cos\alpha. \end{aligned}

As α\alpha ranges over (0,90),(0^\circ, 90^\circ), the value cosα\cos\alpha takes every value in (0,1),(0, 1), so KK takes every value in (0,8024).\left(0, \sqrt{8024}\right). Since 892=792189^2 = 7921 <8024\lt 8024 <8100=902,\lt 8100 = 90^2, the possible positive integer values are 1,2,,89:1, 2, \ldots, 89: there are 8989 of them.

9.

The sequence a1,a_1, a2,a_2, \ldots is geometric with a1=aa_1 = a and common ratio r,r, where aa and rr are positive integers. Given that log8a1+log8a2++log8a12\log_8 a_1 + \log_8 a_2 + \cdots + \log_8 a_{12} =2006,= 2006, find the number of possible ordered pairs (a,r).(a, r).

Difficulty rating: 2450
Small Hint:

Combine the logs: the product of the twelve terms is a12r66,a^{12} r^{66}, which must equal 820068^{2006}

Big Hint:

Write a=2x,a = 2^x, r=2yr = 2^y and count nonnegative solutions of 2x+11y=1003;2x + 11y = 1003; parity forces yy odd

Solution:

The sum of the logarithms is log8(a1a2a12)=log8 ⁣(a12r66),\log_8 (a_1 a_2 \cdots a_{12}) = \log_8\!\left(a^{12} r^{66}\right), so a12r66=82006=26018,a^{12} r^{66} = 8^{2006} = 2^{6018}, which gives a2r11=21003.a^2 r^{11} = 2^{1003}.

Thus aa and rr are powers of 2:2: write a=2xa = 2^x and r=2yr = 2^y with integers x,y0x, y \ge 0 and 2x+11y=1003.2x + 11y = 1003. Since 2x2x is even and 10031003 is odd, yy must be odd, say y=2k1y = 2k - 1 for k1.k \ge 1. Then x=50711k0x = 507 - 11k \ge 0 exactly when k50711=46.k \le \lfloor \frac{507}{11} \rfloor = 46.

Each k=1,2,,46k = 1, 2, \ldots, 46 gives one pair, so there are 4646 ordered pairs (a,r).(a, r).

10.

Eight circles of diameter 11 are packed in the first quadrant of the coordinate plane as shown. Let region R\mathcal{R} be the union of the eight circular regions. Line ,\ell, with slope 3,3, divides R\mathcal{R} into two regions of equal area. Line \ell’s equation can be expressed in the form ax=by+c,ax = by + c, where a,a, b,b, and cc are positive integers whose greatest common divisor is 1.1. Find a2+b2+c2.a^2 + b^2 + c^2.

Difficulty rating: 2610
Small Hint:

Any line through the point where two congruent circles touch splits that pair’s area evenly

Big Hint:

The line through (1,12)\left(1, \frac{1}{2}\right) and (32,2)\left(\frac{3}{2}, 2\right) has slope 33 and leaves two whole circles on each side

Solution:

The circles have radius 12\frac{1}{2} and centers at (12,12),\left(\frac{1}{2}, \frac{1}{2}\right), (32,12),\left(\frac{3}{2}, \frac{1}{2}\right), (52,12),\left(\frac{5}{2}, \frac{1}{2}\right), (12,32),\left(\frac{1}{2}, \frac{3}{2}\right), (32,32),\left(\frac{3}{2}, \frac{3}{2}\right), (52,32),\left(\frac{5}{2}, \frac{3}{2}\right), (12,52),\left(\frac{1}{2}, \frac{5}{2}\right), and (32,52).\left(\frac{3}{2}, \frac{5}{2}\right). The pair of circles tangent at A=(1,12)A = \left(1, \frac{1}{2}\right) is symmetric about A,A, so any line through AA bisects that pair’s area; similarly for the pair tangent at B=(32,2).B = \left(\frac{3}{2}, 2\right). The line ABAB has slope 212321=3.\frac{2 - \frac{1}{2}}{\frac{3}{2} - 1} = 3.

Line ABAB misses the remaining four circles entirely, and exactly two of them lie on each side of it, so it divides R\mathcal{R} into two regions of equal area. Sliding a slope-33 line strictly shifts area from one side to the other, so \ell must be this line.

Its equation is y12=3(x1),y - \frac{1}{2} = 3(x - 1), that is, 6x=2y+5.6x = 2y + 5. With gcd(6,2,5)=1,\gcd(6, 2, 5) = 1, the answer is a2+b2+c2=36+4+25=65.a^2 + b^2 + c^2 = 36 + 4 + 25 = 65.

11.

A collection of 88 cubes consists of one cube with edge-length kk for each integer k,k, 1k8.1 \le k \le 8. A tower is to be built using all 88 cubes according to the rules:

• Any cube may be the bottom cube in the tower.

• The cube immediately on top of a cube with edge-length kk must have edge-length at most k+2.k + 2.

Let TT be the number of different towers that can be constructed. What is the remainder when TT is divided by 1000?1000?

Difficulty rating: 2760
Small Hint:

Build towers of the cubes 1,,n+11, \ldots, n + 1 by inserting the largest cube into a legal tower of the smaller ones

Big Hint:

For n2,n \ge 2, cube n+1n + 1 can go on the bottom, on cube n,n, or on cube n1n - 1 — the count triples at each step

Solution:

Let S(n)S(n) be the number of legal towers using the cubes of edge-lengths 1,,n.1, \ldots, n. Given a legal tower of n2n \ge 2 cubes, cube n+1n + 1 can be inserted in exactly three places: at the bottom, immediately on top of cube n,n, or immediately on top of cube n1n - 1 (anywhere else it would rest on a cube of edge-length at most n2,n - 2, violating the rule). Each insertion stays legal, because the cube that ends up on top of cube n+1n + 1 has edge-length at most n<(n+1)+2.n \lt (n+1) + 2. Conversely, deleting cube n+1n + 1 from a legal tower of n+1n + 1 cubes leaves a legal tower: the cube that was above it, of edge-length at most n,n, lands on a cube of edge-length at least n1.n - 1.

Hence S(n+1)=3S(n)S(n + 1) = 3 S(n) for n2.n \ge 2. Since S(2)=2S(2) = 2 (either of the two cubes may be on top), we get T=S(8)=236=1458,T = S(8) = 2 \cdot 3^6 = 1458, and the remainder is 458.458.

12.

Find the sum of the values of xx such that cos33x+cos35x\cos^3 3x + \cos^3 5x =8cos34xcos3x,= 8 \cos^3 4x \cos^3 x, where xx is measured in degrees and 100<x<200.100 \lt x \lt 200.

Difficulty rating: 2990
Small Hint:

Product-to-sum: 2cos4xcosx=cos5x+cos3x,2\cos 4x \cos x = \cos 5x + \cos 3x, so the equation reads y3+z3=(y+z)3y^3 + z^3 = (y + z)^3

Big Hint:

(y+z)3y3z3=3yz(y+z),(y+z)^3 - y^3 - z^3 = 3yz(y+z), so one of cos3x,\cos 3x, cos5x,\cos 5x, cos4xcosx\cos 4x \cos x must vanish

Solution:

By the product-to-sum identity, 2cos4xcosx=cos5x+cos3x,2 \cos 4x \cos x = \cos 5x + \cos 3x, so the right side is (cos5x+cos3x)3.(\cos 5x + \cos 3x)^3. Setting y=cos3xy = \cos 3x and z=cos5x,z = \cos 5x, the equation becomes y3+z3=(y+z)3,y^3 + z^3 = (y + z)^3, and since (y+z)3y3z3=3yz(y+z),(y+z)^3 - y^3 - z^3 = 3yz(y + z), it holds exactly when cos3x=0,cos5x=0, \begin{aligned} \cos 3x &= 0, \\ \cos 5x &= 0, \end{aligned} or cos4xcosx=0. \cos 4x \cos x = 0.

For 100<x<200100 \lt x \lt 200 in degrees: cos3x=0\cos 3x = 0 gives x=150;x = 150; cos5x=0\cos 5x = 0 gives x=126,x = 126, 162,162, 198;198; cos4x=0\cos 4x = 0 gives x=112.5,x = 112.5, 157.5;157.5; and cosx=0\cos x = 0 gives no solutions in the interval.

The sum is 150+126+162+198+112.5+157.5=906. \begin{aligned} &150 + 126 + 162 \\ &\quad {}+ 198 + 112.5 + 157.5 \\ &= 906. \end{aligned}

13.

For each even positive integer x,x, let g(x)g(x) denote the greatest power of 22 that divides x.x. For example, g(20)=4g(20) = 4 and g(16)=16.g(16) = 16. For each positive integer n,n, let Sn=k=12n1g(2k).S_n = \sum_{k=1}^{2^{n-1}} g(2k). Find the greatest integer nn less than 10001000 such that SnS_n is a perfect square.

Difficulty rating: 2990
Small Hint:

SnS_n sums gg over 2,4,,2n;2, 4, \ldots, 2^n; exactly 2n1i2^{n-1-i} of these numbers have g=2ig = 2^i

Big Hint:

Sn=(n+1)2n1,S_n = (n+1) 2^{n-1}, so nn must be odd and n+1n + 1 must be a perfect square

Solution:

SnS_n is the sum of gg over the even numbers 2,4,,2n.2, 4, \ldots, 2^n. Among these 2n12^{n-1} numbers, exactly 2n1i2^{n-1-i} are divisible by 2i2^i but not 2i+12^{i+1} (so have g=2ig = 2^i) for each 1in1,1 \le i \le n - 1, and the single number 2n2^n has g=2n.g = 2^n. Hence Sn=i=1n12i2n1i+2n=(n1)2n1+2n=(n+1)2n1. \begin{aligned} S_n &= \sum_{i=1}^{n-1} 2^i \cdot 2^{n-1-i} \\ &\quad {}+ 2^n \\ &= (n-1) 2^{n-1} + 2^n \\ &= (n+1) 2^{n-1}. \end{aligned}

If nn is even, then n+1n + 1 is odd and the exponent n1n - 1 is odd, so SnS_n has an odd number of factors of 22 and cannot be a perfect square. If nn is odd, then 2n12^{n-1} is already a perfect square, so SnS_n is a perfect square exactly when n+1n + 1 is.

For odd n,n, the number n+1n + 1 is even, and the greatest even perfect square at most 10001000 is 900=302.900 = 30^2. Thus the greatest valid n<1000n \lt 1000 is n=899.n = 899.

14.

A tripod has three legs each of length 55 feet. When the tripod is set up, the angle between any pair of legs is equal to the angle between any other pair, and the top of the tripod is 44 feet from the ground. In setting up the tripod, the lower 11 foot of one leg breaks off. Let hh be the height in feet of the top of the tripod from the ground when the broken tripod is set up. Then hh can be written in the form mn,\frac{m}{\sqrt{n}}, where mm and nn are positive integers and nn is not divisible by the square of any prime. Find m+n.\lfloor m + \sqrt{n} \rfloor. (The notation x\lfloor x \rfloor denotes the greatest integer that is less than or equal to x.x.)

Difficulty rating: 3270
Small Hint:

Set coordinates: top at (0,0,4)(0, 0, 4) and feet 33 from the origin; the broken leg now ends 45\frac{4}{5} of the way from top to old foot

Big Hint:

By symmetry hh is a 2D distance in the xzxz-plane: from (0,4)(0, 4) to the line through the broken tip and the midpoint of the other two feet

Solution:

Place the top at T=(0,0,4).T = (0, 0, 4). Each leg has length 5,5, so each foot is 33 from the origin: A=(3,0,0),A = (3, 0, 0), B=(32,332,0),B = \left(-\frac{3}{2}, \frac{3\sqrt{3}}{2}, 0\right), C=(32,332,0).C = \left(-\frac{3}{2}, -\frac{3\sqrt{3}}{2}, 0\right). The broken leg has length 4,4, so its tip is A=45(3,0,0)A' = \frac{4}{5}(3, 0, 0) +15(0,0,4)+ \frac{1}{5}(0, 0, 4) =(125,0,45),= \left(\frac{12}{5}, 0, \frac{4}{5}\right), and the tripod now stands on the plane ABC,A'BC, with hh equal to the distance from TT to that plane.

The plane ABCA'BC contains BC,\overline{BC}, which is parallel to the yy-axis and passes through the midpoint M=(32,0,0),M = \left(-\frac{3}{2}, 0, 0\right), so its distance from TT can be measured in the xzxz-plane: it is the distance from (0,4)(0, 4) to the line through (32,0)\left(-\frac{3}{2}, 0\right) and (125,45),\left(\frac{12}{5}, \frac{4}{5}\right), whose equation is 8x39z+12=0.8x - 39z + 12 = 0. Therefore h=80394+1282+392=1441585. \begin{aligned} h &= \frac{|8 \cdot 0 - 39 \cdot 4 + 12|}{\sqrt{8^2 + 39^2}} \\ &= \frac{144}{\sqrt{1585}}. \end{aligned}

Here m=144m = 144 and n=1585=5317n = 1585 = 5 \cdot 317 is squarefree. Since 392=1521<1585<1600,39^2 = 1521 \lt 1585 \lt 1600, we get 144+1585\lfloor 144 + \sqrt{1585} \rfloor =144+39=183.= 144 + 39 = 183.

15.

Given that a sequence satisfies x0=0x_0 = 0 and xk=xk1+3|x_k| = |x_{k-1} + 3| for all integers k1,k \ge 1, find the minimum possible value of x1+x2++x2006.|x_1 + x_2 + \cdots + x_{2006}|.

Difficulty rating: 3370
Small Hint:

Square the recurrence: xk2=(xk1+3)2.x_k^2 = (x_{k-1} + 3)^2. Summing over kk telescopes into a formula for x1++x2006.x_1 + \cdots + x_{2006}.

Big Hint:

Each xkx_k is a multiple of 33 with the parity of k,k, so choose x2007x_{2007} with square as close as possible to 920079 \cdot 2007

Solution:

Squaring the recurrence gives xk2=(xk1+3)2x_k^2 = (x_{k-1} + 3)^2 =xk12+6xk1+9.= x_{k-1}^2 + 6 x_{k-1} + 9. Summing for k=1k = 1 to 20072007 telescopes: x20072=x02+6k=02006xk+92007,x_{2007}^2 = x_0^2 + 6 \sum_{k=0}^{2006} x_k + 9 \cdot 2007, so with x0=0,x_0 = 0, x1+x2++x2006=x20072180636. \begin{aligned} &x_1 + x_2 + \cdots + x_{2006} \\ &= \frac{x_{2007}^2 - 18063}{6}. \end{aligned}

Induction shows each xkx_k is a multiple of 33 whose parity matches that of k,k, so x2007x_{2007} is an odd multiple of 3.3. To minimize x2007218063,\left|x_{2007}^2 - 18063\right|, take the odd multiple of 33 whose square is nearest 18063:18063: that is ±135,\pm 135, with 1352=18225,135^2 = 18225, giving 18225180636=27\frac{18225 - 18063}{6} = 27 (the neighbors 129129 and 141141 give 237237 and 303303).

This value is attained: take xk=3kx_k = 3k for k45,k \le 45, and thereafter alternate xk=138x_k = -138 for even kk and xk=135x_k = 135 for odd k;k; then x2007=135x_{2007} = 135 and the sum is 27.27. So the minimum is 27.27.