1992 AIME Problems

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 problems are used with official legal permission of the Mathematical Association of America (MAA).

Or jump straight to a single 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

Timed

3:00:00

1.

Find the sum of all positive rational numbers that are less than 1010 and that have denominator 3030 when written in lowest terms.

Answer: 400
Concepts:Euler’s Totient Functionfractionsummation
Difficulty rating: 1780
Small Hint:

Write every number as k30\frac{k}{30} and impose the condition gcd(k,30)=1\gcd(k,30)=1

Big Hint:

Group the eligible numerators into ten blocks of length 3030

Solution:

The numbers are k30\frac{k}{30} for 1k<3001\leq k\lt300 and gcd(k,30)=1.\gcd(k,30)=1. There are φ(30)=8\varphi(30)=8 eligible residues in each block of 30,30, and their sum is 30φ(30)2=120.\frac{30\varphi(30)}{2}=120. Thus the sum of all eligible numerators is q=09(830q+120)=83045+10120=12000.\begin{aligned}\sum_{q=0}^9(8\cdot30q+120)&=8\cdot30\cdot45\\&\quad+10\cdot120\\&=12000.\end{aligned} Dividing by 3030 gives 400.400.

2.

A positive integer is called ascending if, in its decimal representation, there are at least two digits and each digit is less than any digit to its right. How many ascending positive integers are there?

Answer: 502
Difficulty rating: 1700
Small Hint:

Once a set of nonzero digits is chosen, their order is forced

Big Hint:

Exclude subsets of sizes 00 and 11 from the subsets of {1,2,,9}\{1,2,\ldots,9\}

Solution:

The digit 00 cannot occur, because it would have to be the first digit and leading zeroes are not part of a decimal representation. Every subset of at least two digits from {1,,9}\{1,\ldots,9\} gives exactly one ascending integer when written in increasing order. Hence the number is 29(90)(91)=51219=502.\begin{aligned}2^9-\binom90-\binom91&=512-1-9\\&=502.\end{aligned}

3.

A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly 0.500.0.500. During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than 0.503.0.503. What’s the largest number of matches she could’ve won before the weekend began?

Answer: 164
Difficulty rating: 1640
Small Hint:

If she had ww wins initially, a 0.5000.500 ratio means she had played 2w2w matches

Big Hint:

Translate the final ratio into a strict inequality before taking the largest integer ww

Solution:

If she initially had ww wins, then she had played 2w2w matches. The final condition is w+32w+4>5031000.\frac{w+3}{2w+4}\gt\frac{503}{1000}. Cross-multiplication gives 1000w+3000>1006w+2012,1000w+3000\gt1006w+2012, so 6w<9886w\lt988 and w<16423.w\lt164\frac23. The largest possible integer is 164.164.

4.

In Pascal’s Triangle, each entry is the sum of the two entries above it. The first few rows of the triangle are shown below.

0:11:112:1213:13314:146415:151010516:1615201561\begin{array}{rl}0:&1\\1:&1\quad1\\2:&1\quad2\quad1\\3:&1\quad3\quad3\quad1\\4:&1\quad4\quad6\quad4\quad1\\5:&1\quad5\quad10\quad10\quad5\quad1\\6:&1\quad6\quad15\quad20\quad15\quad6\quad1\end{array}

In which row of Pascal’s Triangle do three consecutive entries occur that are in the ratio 3:4:5?3:4:5?

Answer: 62
Difficulty rating: 1940
Small Hint:

Represent the three entries as (nk),\binom nk, (nk+1),\binom n{k+1}, and (nk+2)\binom n{k+2}

Big Hint:

Use the ratios of consecutive binomial coefficients to obtain two linear equations in nn and kk

Solution:

For three consecutive entries beginning at position k,k, (nk+1)(nk)=nkk+1=43,(nk+2)(nk+1)=nk1k+2=54.\begin{aligned}\frac{\binom n{k+1}}{\binom nk}&=\frac{n-k}{k+1}=\frac43,\\\frac{\binom n{k+2}}{\binom n{k+1}}&=\frac{n-k-1}{k+2}=\frac54.\end{aligned} Thus 3n=7k+43n=7k+4 and 4n=9k+14.4n=9k+14. Solving gives k=26k=26 and n=62.n=62.

5.

Let SS be the set of all rational numbers r,r, 0<r<1,0\lt r\lt1, that have a repeating decimal expansion in the form 0.abcabcabc=0.abc,0.abcabcabc\ldots=0.\overline{abc}, where the digits a,a, b,b, and cc are not necessarily distinct. To write the elements of SS as fractions in lowest terms, how many different numerators are required?

Answer: 660
Difficulty rating: 2320
Small Hint:

Every element has the form N999\frac{N}{999}, and its reduced denominator must divide 999=3337999=3^3\cdot37

Big Hint:

Count numerators coprime to 999999, then check which additional multiples of 33 can occur with denominator 3737

Solution:

Every element is N999\frac{N}{999} for 1N998.1\leq N\leq998. Any aa coprime to 999999 occurs as a reduced numerator with denominator 999,999, giving φ(999)=648\varphi(999)=648 values. If aa is divisible by 33 but not 37,37, it can be coprime to a reduced denominator only when that denominator is 37;37; this adds the 1212 multiples of 33 below 37.37. A numerator divisible by 3737 would need a denominator dividing 2727 and larger than it, so no further values occur. Therefore the total is 648+12=660.648+12=660.

6.

For how many pairs of consecutive integers in {1000,1001,1002,,2000}\{1000,1001,1002,\ldots,2000\} is no carrying required when the two integers are added?

Answer: 156
Difficulty rating: 1780
Small Hint:

Write the smaller integer as 1abc1abc and separate cases by the number of trailing 99s

Big Hint:

A digit that is unchanged must be at most 44, and the digit increased by 11 must also pair without a carry

Solution:

Write the smaller number as 1abc.1abc. If c9,c\neq9, then c4c\leq4 and the unchanged digits aa and bb are each at most 4,4, giving 53=1255^3=125 pairs. If c=9c=9 but b9,b\neq9, then a4a\leq4 and b4,b\leq4, giving 2525 pairs. If b=c=9b=c=9 but a9,a\neq9, there are 55 choices for a.a. Finally, 1999+20001999+2000 also needs no carry. The total is 125+25+5+1=156.125+25+5+1=156.

7.

Faces ABCABC and BCDBCD of tetrahedron ABCDABCD meet at an angle of 30.30^\circ. The area of face ABCABC is 120,120, the area of face BCDBCD is 80,80, and BC=10.BC=10. Find the volume of the tetrahedron.

Answer: 320
Difficulty rating: 2040
Small Hint:

Find the altitudes from AA and DD to the common edge BCBC

Big Hint:

The height from DD to plane ABCABC is its face altitude multiplied by sin30\sin30^\circ

Solution:

The altitudes to BCBC in faces ABCABC and BCDBCD are 2(120)10=24\frac{2(120)}{10}=24 and 2(80)10=16,\frac{2(80)}{10}=16, respectively. Because the dihedral angle is 30,30^\circ, the perpendicular height from DD to plane ABCABC is 16sin30=8.16\sin30^\circ=8. Using face ABCABC as the base, the volume is 13(120)(8)=320.\frac13(120)(8)=320.

8.

For any sequence of real numbers A=(a1,a2,a3,),A=(a_1,a_2,a_3,\ldots), define ΔA\Delta A to be the sequence (a2a1,a3a2,a4a3,),(a_2-a_1,a_3-a_2,a_4-a_3,\ldots), whose nnth term is an+1an.a_{n+1}-a_n. Suppose that all of the terms of the sequence Δ(ΔA)\Delta(\Delta A) are 1,1, and that a19=a92=0.a_{19}=a_{92}=0. Find a1.a_1.

Answer: 819
Difficulty rating: 1980
Small Hint:

A sequence with constant second difference 11 is given by a quadratic with leading coefficient 12\frac{1}{2}

Big Hint:

Use the two zero terms to write the quadratic in factored form

Solution:

A quadratic sequence with second difference 11 has leading coefficient 12.\frac{1}{2}. Since its values vanish at indices 1919 and 92,92, an=12(n19)(n92).a_n=\frac12(n-19)(n-92). Therefore a1=12(18)(91)=819.a_1=\frac12(-18)(-91)=819.

9.

Trapezoid ABCDABCD has sides AB=92,AB=92, BC=50,BC=50, CD=19,CD=19, and AD=70,AD=70, with ABAB parallel to CD.CD. A circle with center PP on ABAB is drawn tangent to BCBC and AD.AD. Given that AP=mn,AP=\frac{m}{n}, where mm and nn are relatively prime positive integers, find m+n.m+n.

Answer: 164
Difficulty rating: 2230
Small Hint:

Put ABAB on the xx-axis and compare the distances from PP to the two legs

Big Hint:

The common trapezoid height cancels, leaving an equation involving APAP and PBPB divided by the leg lengths

Solution:

Put A=(0,0),A=(0,0), B=(92,0),B=(92,0), and let the height of the trapezoid be h.h. If P=(p,0),P=(p,0), its perpendicular distances to legs ADAD and BCBC are hp70\frac{hp}{70} and h(92p)50,\frac{h(92-p)}{50}, respectively. Tangency to both legs makes these equal, so p70=92p50.\frac p{70}=\frac{92-p}{50}. Hence 120p=6440120p=6440 and AP=p=1613.AP=p=\frac{161}{3}. Therefore m+n=161+3=164.m+n=161+3=164.

10.

Consider the region AA in the complex plane that consists of all points zz such that both z40\frac{z}{40} and 40z\frac{40}{\overline z} have real and imaginary parts between 00 and 1,1, inclusive. What is the integer that is nearest the area of A?A?

Answer: 572
Difficulty rating: 2650
Small Hint:

Write z=x+iyz=x+iy; the first condition gives a square, and the second gives two circle inequalities

Big Hint:

Subtract from the 4040-by-4040 square the union of two semicircles, accounting for their lens-shaped overlap

Solution:

Write z=x+iy.z=x+iy. The condition on z40\frac{z}{40} gives 0x400\leq x\leq40 and 0y40.0\leq y\leq40. Since 40z=40xx2+y2+i40yx2+y2,\frac{40}{\overline z}=\frac{40x}{x^2+y^2}+i\frac{40y}{x^2+y^2}, the other condition requires x2+y240xx^2+y^2\geq40x and x2+y240y.x^2+y^2\geq40y. Thus, within the square, we remove two semicircles of radius 20.20.

Their overlap is the lens formed by two radius-2020 circles whose centers are 20220\sqrt2 apart. Its area is 200π400.200\pi-400. Hence the removed union has area 400π(200π400)400\pi-(200\pi-400), or 200π+400.200\pi+400. Let KK denote the area of A.A. Then K=1600(200π+400)=1200200π571.68.\begin{aligned}K&=1600-(200\pi+400)\\&=1200-200\pi\\&\approx571.68.\end{aligned} The nearest integer is 572.572.

11.

Lines l1l_1 and l2l_2 both pass through the origin and make first-quadrant angles of π70\frac{\pi}{70} and π54\frac{\pi}{54} radians, respectively, with the positive xx-axis. For any line l,l, the transformation R(l)R(l) produces another line as follows: ll is reflected in l1,l_1, and the resulting line is reflected in l2.l_2. Let R(1)(l)=R(l)R^{(1)}(l)=R(l) and R(n)(l)=R(R(n1)(l)).R^{(n)}(l)=R(R^{(n-1)}(l)). Given that ll is the line y=(1992)x,y=(\frac{19}{92})x, find the smallest positive integer mm for which R(m)(l)=l.R^{(m)}(l)=l.

Answer: 945
Difficulty rating: 2230
Small Hint:

Two reflections in intersecting lines compose to a rotation through twice the angle between the lines

Big Hint:

An unoriented line returns to itself when its accumulated rotation is a multiple of π\pi

Solution:

The composition is rotation through 2(π54π70)=8π945.2\left(\frac{\pi}{54}-\frac{\pi}{70}\right)=\frac{8\pi}{945}. A line through the origin is unchanged by a rotation exactly when the rotation angle is a multiple of π.\pi. Thus mm must satisfy 8m945Z.\frac{8m}{945}\in\mathbb Z. Since gcd(8,945)=1,\gcd(8,945)=1, the least such mm is 945.945.

12.

In a game of Chomp, two players alternately take bites from a 55-by-77 grid of unit squares. To take a bite, a player chooses one of the remaining squares, then removes (“eats”) all squares in the quadrant defined by the left edge (extended upward) and the lower edge (extended rightward) of the chosen square. For example, the bite determined by the shaded square in the diagram would remove the shaded square and the four squares marked by ×.\times. (The squares with two or more dotted edges have been removed from the original board in previous moves.)

The object of the game is to make one’s opponent take the last bite. The diagram shows one of the many subsets of the set of 3535 unit squares that can occur during the game of Chomp. How many different subsets are there in all? Include the full board and empty board in your count.

Answer: 792
Difficulty rating: 2320
Small Hint:

A reachable set is determined by nonincreasing column heights between 00 and 55

Big Hint:

Encode the boundary of such a set as a lattice path with 55 vertical and 77 horizontal steps

Solution:

After any sequence of bites, the remaining squares form a lower-left order ideal: the seven column heights are nonincreasing integers between 00 and 5.5. Conversely, every such boundary can be produced and corresponds to a lattice path across a 55-by-77 rectangle. Each path consists of 55 vertical and 77 horizontal steps, so the number of states, including full and empty, is (125)=792.\binom{12}{5}=792.

13.

Triangle ABCABC has AB=9AB=9 and BC:AC=40:41.BC:AC=40:41. What’s the largest area that this triangle can have?

Answer: 820
Difficulty rating: 2510
Small Hint:

Set BC=40t,BC=40t, AC=41t,AC=41t, and use the Law of Cosines with AB=9AB=9

Big Hint:

Express the area as a function of cosC\cos C and maximize its square

Solution:

Set BC=40t,BC=40t, AC=41t,AC=41t, and x=cosC.x=\cos C. The Law of Cosines gives 81=t2(32813280x),81=t^2(3281-3280x), while the area is 820t21x2.820t^2\sqrt{1-x^2}. Hence it equals 820811x232813280x.820\cdot81\,\frac{\sqrt{1-x^2}}{3281-3280x}. Differentiating its logarithm shows the maximum occurs at x=32803281.x=\frac{3280}{3281}. Then 1x2=813281\sqrt{1-x^2}=\frac{81}{3281} and 32813280x=65613281,3281-3280x=\frac{6561}{3281}, so the maximum area is 820.820.

14.

In triangle ABC,ABC, A,A', B,B', and CC' are on the sides BC,BC, AC,AC, and AB,AB, respectively. Given that AA,AA', BB,BB', and CCCC' are concurrent at the point O,O, and that AOOA+BOOB+COOC=92,\frac{AO}{OA'}+\frac{BO}{OB'}+\frac{CO}{OC'}=92, find AOOABOOBCOOC.\frac{AO}{OA'}\cdot\frac{BO}{OB'}\cdot\frac{CO}{OC'}.

Answer: 94
Difficulty rating: 2350
Small Hint:

Let (α,β,γ)(\alpha,\beta,\gamma) be normalized barycentric coordinates of OO

Big Hint:

Write the three ratios as 1αα\frac{1-\alpha}{\alpha}, 1ββ\frac{1-\beta}{\beta}, and 1γγ\frac{1-\gamma}{\gamma}

Solution:

Let α+β+γ=1\alpha+\beta+\gamma=1 be the barycentric coordinates of O.O. Then x=AOOA=β+γα,y=BOOB=γ+αβ,z=COOC=α+βγ.\begin{aligned}x=\frac{AO}{OA'}&=\frac{\beta+\gamma}{\alpha},\\y=\frac{BO}{OB'}&=\frac{\gamma+\alpha}{\beta},\\z=\frac{CO}{OC'}&=\frac{\alpha+\beta}{\gamma}.\end{aligned} Expanding both sides using α+β+γ=1\alpha+\beta+\gamma=1 gives the standard identity xyz=x+y+z+2.xyz=x+y+z+2. Since x+y+z=92,x+y+z=92, the requested product is 94.94.

15.

Define a positive integer nn to be a factorial tail if there is some positive integer mm such that the decimal representation of m!m! ends with exactly nn zeroes. How many positive integers less than 19921992 are not factorial tails?

Answer: 396
Difficulty rating: 2650
Small Hint:

Let f(m)=j1m5jf(m)=\sum_{j\geq1}\lfloor \frac{m}{5^j}\rfloor, the number of trailing zeroes in m!m!

Big Hint:

Every positive value attained by ff first appears at a multiple 5k5k, where f(5k)=k+f(k)f(5k)=k+f(k)

Solution:

The number of trailing zeroes is f(m)=j1m5j.f(m)=\sum_{j\geq1}\lfloor \frac{m}{5^j}\rfloor. Its positive distinct values occur at the multiples 5k,5k, and f(5k)=k+f(k)f(5k)=k+f(k) is strictly increasing with k.k. Now f(1595)=319+63+12+2=396,\begin{aligned}f(1595)&=319+63\\&\quad+12+2=396,\end{aligned} so f(7975)=1595+396=1991.f(7975)=1595+396=1991. For k=1596,k=1596, the same calculation gives f(k)=396,f(k)=396, hence f(5k)=1992.f(5k)=1992. Therefore exactly 15951595 positive values through 19911991 are factorial tails. Of the 19911991 positive integers below 1992,1992, the number omitted is 19911595=396.1991-1595=396.