2006 AIME II 考试题目

Scroll down and press Start to try the exam! Or, go to the printable PDF, answer key, or professional solutions curated by LIVE by Po-Shen Loh.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Or jump straight to one problem with its solution: 1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11 · 12 · 13 · 14 · 15

Want to learn professionally through interactive video classes?

Learn LIVE

考试时间还剩下:

3:00:00

1.

In convex hexagon ABCDEF,ABCDEF, all six sides are congruent, A\angle A and D\angle D are right angles, and B,\angle B, C,\angle C, E,\angle E, and F\angle F are congruent. The area of the hexagonal region is 2116(2+1).2116(\sqrt{2} + 1). Find AB.AB.

Answer: 46
Concepts:area decompositionangle sumspecial right triangle

Difficulty rating: 2110

Solution:

The angles of a hexagon sum to 720,720^\circ, so each of the four congruent angles measures 7202904=135\frac{720 - 2 \cdot 90}{4} = 135 degrees. Let AB=x.AB = x. The diagonals BFBF and CECE cut off the right isosceles triangles FABFAB and CDE,CDE, each with legs xx and hypotenuse x2,x\sqrt{2}, and the 135135^\circ angles guarantee that the remaining piece BCEFBCEF is a rectangle with sides x2x\sqrt{2} and x.x.

Hence the area is 212x2+xx2=x2(1+2)=2116(2+1),2 \cdot \frac{1}{2}x^2 + x \cdot x\sqrt{2} = x^2(1 + \sqrt{2}) = 2116(\sqrt{2} + 1), so x2=2116x^2 = 2116 and AB=x=46.AB = x = 46.

2.

The lengths of the sides of a triangle with positive area are log1012,\log_{10} 12, log1075,\log_{10} 75, and log10n,\log_{10} n, where nn is a positive integer. Find the number of possible values for n.n.

Answer: 893

Difficulty rating: 1890

Solution:

The triangle inequality requires logn<log12+log75=log900\log n \lt \log 12 + \log 75 = \log 900 and log12+logn>log75,\log 12 + \log n \gt \log 75, that is logn>log75log12=log254.\log n \gt \log 75 - \log 12 = \log \frac{25}{4}. (The third inequality is the first one again.)

So 254<n<900,\frac{25}{4} \lt n \lt 900, which for integers means 7n899.7 \le n \le 899. That gives 8997+1=893899 - 7 + 1 = 893 possible values of n.n.

3.

Let PP be the product of the first 100100 positive odd integers. Find the largest integer kk such that PP is divisible by 3k.3^k.

Answer: 49

Difficulty rating: 2150

Solution:

P=135199,P = 1 \cdot 3 \cdot 5 \cdots 199, so kk is the total number of factors of 33 among the odd numbers up to 199.199. The odd multiples of 33 are 31,33,,365,3 \cdot 1, 3 \cdot 3, \ldots, 3 \cdot 65, and there are 3333 of them. The odd multiples of 99 are 91,,921:9 \cdot 1, \ldots, 9 \cdot 21: 1111 of them. The odd multiples of 2727 are 27,81,135,189:27, 81, 135, 189: 44 of them. The only odd multiple of 8181 at most 199199 is 8181 itself, and there are no multiples of 243.243.

Each layer contributes one additional factor of 3,3, so k=33+11+4+1=49.k = 33 + 11 + 4 + 1 = 49.

4.

Let (a1,a2,a3,,a12)(a_1, a_2, a_3, \ldots, a_{12}) be a permutation of (1,2,3,,12)(1, 2, 3, \ldots, 12) for which a1>a2>a3>a4>a5>a6anda6<a7<a8<a9<a10<a11<a12.a_1 \gt a_2 \gt a_3 \gt a_4 \gt a_5 \gt a_6 \quad \text{and} \quad a_6 \lt a_7 \lt a_8 \lt a_9 \lt a_{10} \lt a_{11} \lt a_{12}. An example of such a permutation is (6,5,4,3,2,1,7,8,9,10,11,12).(6, 5, 4, 3, 2, 1, 7, 8, 9, 10, 11, 12). Find the number of such permutations.

Answer: 462

Difficulty rating: 2180

Solution:

The term a6a_6 is smaller than every other term of the permutation, so a6=1.a_6 = 1. Now choose which five of the remaining 1111 numbers occupy positions 11 through 5:5: they must appear in decreasing order, so their arrangement is forced, and the other six numbers must fill positions 77 through 1212 in increasing order, which is also forced.

Every choice of the five numbers gives exactly one valid permutation, so the count is (115)=462.\binom{11}{5} = 462.

5.

When rolling a certain unfair six-sided die with faces numbered 1,1, 2,2, 3,3, 4,4, 5,5, and 6,6, the probability of obtaining face FF is greater than 16,\frac{1}{6}, the probability of obtaining the face opposite face FF is less than 16,\frac{1}{6}, the probability of obtaining each of the other faces is 16,\frac{1}{6}, and the sum of the numbers on each pair of opposite faces is 7.7. When two such dice are rolled, the probability of obtaining a sum of 77 is 47288.\frac{47}{288}. Given that the probability of obtaining face FF is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers, find m+n.m + n.

Answer: 29

Difficulty rating: 2350

Solution:

Let the probability of face FF be 16+x,\frac{1}{6} + x, so the face opposite FF has probability 16x\frac{1}{6} - x (the six probabilities must sum to 11). Since opposite faces sum to 7,7, a total of 77 occurs exactly when the two dice show a pair of opposite faces. Of the six ordered pairs that sum to 7,7, four use only ordinary faces, and two pair FF with its opposite. Thus 47288=4(16)2+2(16+x)(16x)=162x2.\frac{47}{288} = 4\left(\frac{1}{6}\right)^2 + 2\left(\frac{1}{6} + x\right)\left(\frac{1}{6} - x\right) = \frac{1}{6} - 2x^2.

Since 16=48288,\frac{1}{6} = \frac{48}{288}, this gives 2x2=1288,2x^2 = \frac{1}{288}, so x=124.x = \frac{1}{24}. The probability of face FF is 16+124=524,\frac{1}{6} + \frac{1}{24} = \frac{5}{24}, and m+n=5+24=29.m + n = 5 + 24 = 29.

6.

Square ABCDABCD has sides of length 1.1. Points EE and FF are on BC\overline{BC} and CD,\overline{CD}, respectively, so that AEF\triangle AEF is equilateral. A square with vertex BB has sides that are parallel to those of ABCDABCD and a vertex on AE.\overline{AE}. The length of a side of this smaller square is abc,\frac{a - \sqrt{b}}{c}, where a,a, b,b, and cc are positive integers and bb is not divisible by the square of any prime. Find a+b+c.a + b + c.

Answer: 12
Solution:

Place A=(0,0),A = (0, 0), B=(1,0),B = (1, 0), C=(1,1),C = (1, 1), D=(0,1).D = (0, 1). By the symmetry of the equilateral triangle across diagonal AC,\overline{AC}, we have BE=DF.BE = DF. Let BE=t,BE = t, so CE=CF=1t.CE = CF = 1 - t. Then AE2=1+t2AE^2 = 1 + t^2 and EF2=2(1t)2,EF^2 = 2(1 - t)^2, and setting them equal gives t24t+1=0,t^2 - 4t + 1 = 0, so t=23t = 2 - \sqrt{3} (taking the root less than 11).

Thus E=(1,23),E = (1,\, 2 - \sqrt{3}), and line AEAE is y=(23)x.y = (2 - \sqrt{3})x. If the smaller square has side q,q, its vertex opposite BB is (1q,q),(1 - q,\, q), which must lie on line AE:AE: q=(23)(1q)q=2333=(23)(3+3)6=336.q = (2 - \sqrt{3})(1 - q) \quad \Longrightarrow \quad q = \frac{2 - \sqrt{3}}{3 - \sqrt{3}} = \frac{(2 - \sqrt{3})(3 + \sqrt{3})}{6} = \frac{3 - \sqrt{3}}{6}.

So a=3,a = 3, b=3,b = 3, c=6,c = 6, and a+b+c=12.a + b + c = 12.

7.

Find the number of ordered pairs of positive integers (a,b)(a, b) such that a+b=1000a + b = 1000 and neither aa nor bb has a zero digit.

Answer: 738

Difficulty rating: 2510

Solution:

There are 999999 pairs in all (a=1,,999a = 1, \ldots, 999); count the forbidden ones. If aa has units digit 0,0, so does b,b, and writing a=10r,a = 10r, b=10sb = 10s gives r+s=100r + s = 100 with 1r99:1 \le r \le 99: that is 9999 forbidden pairs.

Now suppose both units digits are nonzero. Then a number in the pair has a zero digit exactly when it is a three-digit number of the form h0uh0u with h,u{1,,9}h, u \in \{1, \ldots, 9\} (a one- or two-digit number with nonzero units digit has no zero digit). If a=h0u,a = h0u, then b=1000a=100(9h)+90+(10u)b = 1000 - a = 100(9 - h) + 90 + (10 - u) has tens digit 9,9, so bb is not also of that form. Hence the forbidden pairs here are those where exactly one of a,ba, b equals h0u:h0u: 81+81=16281 + 81 = 162 pairs.

The total number of forbidden pairs is 99+162=261,99 + 162 = 261, so the answer is 999261=738.999 - 261 = 738.

8.

There is an unlimited supply of congruent equilateral triangles made of colored paper. Each triangle is a solid color with the same color on both sides of the paper. A large equilateral triangle is constructed from four of these paper triangles as shown. Two large triangles are considered distinguishable if it is not possible to place one on the other, using translations, rotations, and/or reflections, so that their corresponding small triangles are of the same color. Given that there are six different colors of triangles from which to choose, how many distinguishable large equilateral triangles can be constructed?

Answer: 336

Difficulty rating: 2390

Solution:

The rotations and reflections of the large triangle realize every permutation of the three corner triangles while fixing the center triangle. So two large triangles are indistinguishable exactly when they have the same center color and the same multiset of three corner colors.

Count the multisets of corner colors from six colors: all three the same (66 ways), exactly two the same (65=306 \cdot 5 = 30 ways, choosing the repeated color and then the different one), or all three different ((63)=20\binom{6}{3} = 20 ways). That is 6+30+20=566 + 30 + 20 = 56 multisets.

With 66 independent choices for the center color, the total is 656=336.6 \cdot 56 = 336.

9.

Circles C1,\mathcal{C}_1, C2,\mathcal{C}_2, and C3\mathcal{C}_3 have their centers at (0,0),(0, 0), (12,0),(12, 0), and (24,0),(24, 0), and have radii 1,1, 2,2, and 4,4, respectively. Line t1t_1 is a common internal tangent to C1\mathcal{C}_1 and C2\mathcal{C}_2 and has a positive slope, and line t2t_2 is a common internal tangent to C2\mathcal{C}_2 and C3\mathcal{C}_3 and has a negative slope. Given that lines t1t_1 and t2t_2 intersect at (x,y),(x, y), and that x=pqr,x = p - q\sqrt{r}, where p,p, q,q, and rr are positive integers and rr is not divisible by the square of any prime, find p+q+r.p + q + r.

Answer: 27
Solution:

A common internal tangent meets the segment between the centers at the point dividing it in the ratio of the radii. For C1\mathcal{C}_1 and C2\mathcal{C}_2 that point is (4,0),(4, 0), at distance 44 from (0,0).(0,0). If t1t_1 makes angle θ\theta with the xx-axis, then sinθ=14,\sin\theta = \frac{1}{4}, so tanθ=115\tan\theta = \frac{1}{\sqrt{15}} and t1t_1 is y=115(x4).y = \frac{1}{\sqrt{15}}(x - 4). For C2\mathcal{C}_2 and C3\mathcal{C}_3 the point is (16,0),(16, 0), at distance 44 from (12,0);(12, 0); here sinθ=24=12,\sin\theta = \frac{2}{4} = \frac{1}{2}, so the slope is 13-\frac{1}{\sqrt{3}} and t2t_2 is y=13(x16).y = -\frac{1}{\sqrt{3}}(x - 16).

Setting the two expressions equal and multiplying by 15\sqrt{15} gives x4=5(x16),x - 4 = -\sqrt{5}\,(x - 16), so x(1+5)=4+165x(1 + \sqrt{5}) = 4 + 16\sqrt{5} and x=4+1651+5=(4+165)(51)4=761254=1935.x = \frac{4 + 16\sqrt{5}}{1 + \sqrt{5}} = \frac{(4 + 16\sqrt{5})(\sqrt{5} - 1)}{4} = \frac{76 - 12\sqrt{5}}{4} = 19 - 3\sqrt{5}.

Thus p+q+r=19+3+5=27.p + q + r = 19 + 3 + 5 = 27.

10.

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a 50%50\% chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded 11 point and the loser gets 00 points. The total points are accumulated to decide the ranks of the teams. In the first game of the tournament, team AA beats team B.B. The probability that team AA finishes with more points than team BB is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 831

Difficulty rating: 2650

Solution:

Teams AA and BB each have 55 games left, none against each other, so all 2525=10242^5 \cdot 2^5 = 1024 outcomes are equally likely. Since AA already leads by one point, AA finishes with more points exactly when AA wins at least as many remaining games as BB does.

The number of outcomes with equal win counts is k=05(5k)2=(105)=252.\sum_{k=0}^{5} \binom{5}{k}^2 = \binom{10}{5} = 252. By symmetry, the other 1024252=7721024 - 252 = 772 outcomes split evenly between AA winning more and BB winning more.

So the probability is 252+3861024=6381024=319512,\frac{252 + 386}{1024} = \frac{638}{1024} = \frac{319}{512}, and m+n=319+512=831.m + n = 319 + 512 = 831.

11.

A sequence is defined as follows: a1=a2=a3=1,a_1 = a_2 = a_3 = 1, and, for all positive integers n,n, an+3=an+2+an+1+an.a_{n+3} = a_{n+2} + a_{n+1} + a_n. Given that a28=6090307,a_{28} = 6090307, a29=11201821,a_{29} = 11201821, and a30=20603361,a_{30} = 20603361, find the remainder when k=128ak\sum_{k=1}^{28} a_k is divided by 1000.1000.

Answer: 834

Difficulty rating: 2840

Solution:

Let Sn=a1++an.S_n = a_1 + \cdots + a_n. We claim 2Sn=an+2+an,2S_n = a_{n+2} + a_n, which holds for n=1n = 1 since 2=1+1.2 = 1 + 1. If it holds for n,n, then 2Sn+1=2Sn+2an+1=an+2+2an+1+an=an+3+an+12S_{n+1} = 2S_n + 2a_{n+1} = a_{n+2} + 2a_{n+1} + a_n = a_{n+3} + a_{n+1} by the recurrence, completing the induction.

Therefore S28=a30+a282=20603361+60903072=13346834,S_{28} = \frac{a_{30} + a_{28}}{2} = \frac{20603361 + 6090307}{2} = 13346834, whose remainder upon division by 10001000 is 834.834.

12.

Equilateral ABC\triangle ABC is inscribed in a circle of radius 2.2. Extend AB\overline{AB} through BB to point DD so that AD=13,AD = 13, and extend AC\overline{AC} through CC to point EE so that AE=11.AE = 11. Through D,D, draw a line 1\ell_1 parallel to AE,\overline{AE}, and through E,E, draw a line 2\ell_2 parallel to AD.\overline{AD}. Let FF be the intersection of 1\ell_1 and 2.\ell_2. Let GG be the point on the circle that is collinear with AA and FF and distinct from A.A. Given that the area of CBG\triangle CBG can be expressed in the form pqr,\frac{p\sqrt{q}}{r}, where p,p, q,q, and rr are positive integers, pp and rr are relatively prime, and qq is not divisible by the square of any prime, find p+q+r.p + q + r.

Answer: 865
Solution:

By construction ADFEADFE is a parallelogram with AD=13,AD = 13, DF=AE=11,DF = AE = 11, and ADF=180DAE=120.\angle ADF = 180^\circ - \angle DAE = 120^\circ. Hence [ADF]=121311sin120=14334,[ADF] = \frac{1}{2} \cdot 13 \cdot 11 \sin 120^\circ = \frac{143\sqrt{3}}{4}, and by the law of cosines, AF2=132+11221311cos120=169+121+143=433.AF^2 = 13^2 + 11^2 - 2 \cdot 13 \cdot 11 \cos 120^\circ = 169 + 121 + 143 = 433.

Since GG lies on the circle, inscribed angles give GCB=GAB=FAD\angle GCB = \angle GAB = \angle FAD (both subtend arc GBGB) and CBG=CAG\angle CBG = \angle CAG (both subtend arc CGCG); and CAG=AFD\angle CAG = \angle AFD because AEDF.\overline{AE} \parallel \overline{DF}. So CBGAFD\triangle CBG \sim \triangle AFD with ratio CBAF.\frac{CB}{AF}. The side of an equilateral triangle inscribed in a circle of radius 22 is BC=23.BC = 2\sqrt{3}.

Therefore [CBG]=(23433)214334=1243314334=4293433,[CBG] = \left(\frac{2\sqrt{3}}{\sqrt{433}}\right)^2 \cdot \frac{143\sqrt{3}}{4} = \frac{12}{433} \cdot \frac{143\sqrt{3}}{4} = \frac{429\sqrt{3}}{433}, and p+q+r=429+3+433=865.p + q + r = 429 + 3 + 433 = 865.

13.

How many integers NN less than 10001000 can be written as the sum of jj consecutive positive odd integers for exactly 55 values of j1?j \ge 1?

Answer: 15

Difficulty rating: 3160

Solution:

The sum of the (k+1)(k+1)th through mmth positive odd integers is m2k2=(mk)(m+k).m^2 - k^2 = (m - k)(m + k). Writing a=mka = m - k and b=m+k,b = m + k, the representations of NN correspond exactly to the factorizations N=abN = ab with aba \le b and a,ba, b of the same parity (then m=a+b2,m = \frac{a + b}{2}, k=ba2k = \frac{b - a}{2}). So we need NN to have exactly 55 such factorizations.

If NN is odd, every divisor pair works, so NN needs 99 or 1010 divisors, i.e. N=p8,N = p^8, p9,p^9, p2q2,p^2q^2, or pq4pq^4 with p,qp, q distinct odd primes. Below 1000,1000, p8p^8 and p9p^9 are impossible, p2q2p^2 q^2 gives 225225 and 441,441, and pq4pq^4 gives 345,3^4 \cdot 5, 347,3^4 \cdot 7, 3411:3^4 \cdot 11: five odd values.

If NN is even, both factors must be even, so N=4MN = 4M and the factorizations correspond to divisor pairs of M,M, with no parity restriction; we need M<250M \lt 250 with 99 or 1010 divisors. With 99 divisors: 36,36, 100,100, 196,196, 225.225. With 1010 divisors (pq4pq^4): 324,3 \cdot 2^4, 524,5 \cdot 2^4, 724,7 \cdot 2^4, 1124,11 \cdot 2^4, 1324,13 \cdot 2^4, 234.2 \cdot 3^4. That is 4+6=104 + 6 = 10 even values, for a total of 5+10=15.5 + 10 = 15.

14.

Let SnS_n be the sum of the reciprocals of the nonzero digits of the integers from 11 to 10n,10^n, inclusive. Find the smallest positive integer nn for which SnS_n is an integer.

Answer: 63

Difficulty rating: 3060

Solution:

Write the integers from 00 to 10n110^n - 1 as nn-digit strings with leading zeros. Each of the nn digit positions takes each digit value equally often, so each nonzero digit appears n10n1n \cdot 10^{n-1} times. Adding the digit 11 of 10n10^n itself, Sn=1+n10n1(1+12++19)=1+71292520n10n1.S_n = 1 + n \cdot 10^{n-1}\left(1 + \frac{1}{2} + \cdots + \frac{1}{9}\right) = 1 + \frac{7129}{2520}\, n \cdot 10^{n-1}.

Since gcd(7129,2520)=1,\gcd(7129, 2520) = 1, the sum is an integer exactly when 2520n10n1.2520 \mid n \cdot 10^{n-1}. Now 2520=233257,2520 = 2^3 \cdot 3^2 \cdot 5 \cdot 7, and for n4n \ge 4 the factor 10n110^{n-1} supplies 235,2^3 \cdot 5, leaving the condition 63n63 \mid n (a power of 1010 has no factors of 33 or 77). For n=1,2,3n = 1, 2, 3 the products 1,20,3001, 20, 300 are not multiples of 2520.2520.

The smallest solution is therefore n=63.n = 63.

15.

Given that x,x, y,y, and zz are real numbers that satisfy x=y2116+z2116,x = \sqrt{y^2 - \frac{1}{16}} + \sqrt{z^2 - \frac{1}{16}}, y=z2125+x2125,y = \sqrt{z^2 - \frac{1}{25}} + \sqrt{x^2 - \frac{1}{25}}, z=x2136+y2136,z = \sqrt{x^2 - \frac{1}{36}} + \sqrt{y^2 - \frac{1}{36}}, and that x+y+z=mn,x + y + z = \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.m + n.

Answer: 9

Difficulty rating: 3370

Solution:

Each radical y2116\sqrt{y^2 - \frac{1}{16}} is the leg of a right triangle with hypotenuse yy and other leg 14.\frac{1}{4}. So the first equation says: in a triangle XYZXYZ with x=YZ,x = YZ, y=ZX,y = ZX, z=XY,z = XY, the altitude from XX has length 14,\frac{1}{4}, and its foot splits YZYZ into the two radical lengths. The other equations say the altitudes to sides yy and zz are 15\frac{1}{5} and 16.\frac{1}{6}.

If KK is the area of this triangle, then K=12x14K = \frac{1}{2} \cdot x \cdot \frac{1}{4} gives x=8K,x = 8K, and likewise y=10Ky = 10K and z=12K.z = 12K. These are proportional to 8,10,12,8, 10, 12, and 82+102>122,8^2 + 10^2 \gt 12^2, so the triangle is acute and the altitude feet do land inside the sides. Heron's formula with s=15Ks = 15K gives K2=15K7K5K3K=1575K4,K^2 = 15K \cdot 7K \cdot 5K \cdot 3K = 1575K^4, so K2=11575K^2 = \frac{1}{1575} and K=1157.K = \frac{1}{15\sqrt{7}}.

Then x+y+z=30K=27,x + y + z = 30K = \frac{2}{\sqrt{7}}, so m+n=2+7=9.m + n = 2 + 7 = 9.