Remove Watermark Wondershare

PDFelement

1 Binomial Expansion and Equations

1.1 Binomial Expansion

1.2 Equations

1.3 Systems of Equations

1983 AIME, Problem #1

Let x, y, and z all exceed 1 and let w be a positive number such that logx w = 24, logy w = 40, and
logxyz w = 12. Find logz w.

1986 AIME, Problem #1

√ 12
What is the sum of the solutions to the equation 4
x= √ ?
7− 4x

1989 AIME, Problem #1

p
Compute (31)(30)(29)(28) + 1.

1983 AIME, Problem #3

√
What is the product of the real roots of the equation x2 + 18x + 30 = 2 x2 + 18x + 45?

1986 AIME, Problem #2

√ √ √ √ √ √ √ √ √ √ √ √
Evaluate the product ( 5 + 6 + 7)(− 5 + 6 + 7)( 5 − 6 + 7)( 5 + 6 − 7).

1991 AIME, Problem #1

Find x2 + y 2 if x and y are positive integers such that

xy + x + y = 71
2 2
x y + xy = 880.

1990 AIME, Problem #2

√ √
Find the value of (52 + 6 43)3/2 − (52 − 6 43)3/2 .

3
 Remove Watermark Wondershare
PDFelement

1996 AIME, Problem #1

In a magic square, the sum of the three entries in any row, column, or diagonal is the same value. The figure
shows four of the entries of a magic square. Find x.

x 19 96

1986 AIME, Problem #4

Determine 3x4 + 2x5 if x1 , x2 , x3 , x4 , and x5 satisfy the system of equations below.

2x1 + x2 + x3 + x4 + x5 =6
x1 + 2x2 + x3 + x4 + x5 = 12
x1 + x2 + 2x3 + x4 + x5 = 24
x1 + x2 + x3 + 2x4 + x5 = 48
x1 + x2 + x3 + x4 + 2x5 = 96

1993 AIME, Problem #3

The table below displays some of the results of last summer’s Frostbite Falls Fishing Festival, showing how
many contestants caught n fish for various values of n.
n 0 1 2 3 ... 13 14 15
number of contestants who caught n fish 9 5 7 23 . . . 5 2 1
In the newspaper story covering the event, it was reported that
(a) the winner caught 15 fish;
(b) those who caught 3 or more fish averaged 6 fish each;
(c) those who caught 12 or fewer fish averaged 5 fish each.
What was the total number of fish caught during the festival?

1995 AIME, Problem #2

Find the last three digits of the product of the positive roots of
√
1995xlog1995 x = x2 .

4
 Remove Watermark Wondershare
PDFelement

1990 AIME, Problem #4

Find the positive solution to

1 1 2
+ − =0
x2 − 10x − 29 x2 − 10x − 45 x2 − 10x − 69

1992 AIME, Problem #4

In Pascal’s Triangle, each entry is the sum of the two entries above it. In which row of Pascal’s Triangle do
three consecutive entries occur that are in the ratio 3 : 4 : 5?

1993 AIME, Problem #4

How many ordered four-tuples of integers (a, b, c, d) with 0 < a < b < c < d < 500 satisfy a + d = b + c and
bc − ad = 93?

2001 AIME I, Problem #2

A finite set S of distinct real numbers has the following properties: the mean of S ∪ {1} is 13 less than the
mean of S, and the mean of S ∪ {2001} is 27 more than the mean of S. Find the mean of S.

2004 AIME I, Problem #2

Set A consists of m consecutive integers whose sum is 2m, and set B consists of 2m consecutive integers
whose sum is m. The absolute value of the difference between the greatest element of A and the greatest
element of B is 99. Find m.

2008 AIME I, Problem #1

Of the students attending a school party, 60% of the students are girls, and 40% of the students like to
dance. After these students are joined by 20 more boy students, all of whom like to dance, the party is now
58% girls. How many students now at the party like to dance?

2008 AIME II, Problem #1

Let N = 1002 + 992 − 982 − 972 + 962 + · · · + 42 + 32 − 22 − 12 , where the additions and subtractions alternate
in pairs. Find the remainder when N is divided by 1000.

2009 AIME II, Problem #1

Before starting to paint, Bill had 130 ounces of blue paint, 164 ounces of red paint, and 188 ounces of white
paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe,
and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished,
he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had
left.

5
 Remove Watermark Wondershare
PDFelement

1988 AIME, Problem #6

It is possible to place positive integers into the vacant twenty-one squares of the 5 × 5 square shown below
so that the numbers in each row and column form arithmetic sequences. Find the number that must occupy
the vacant square marked by the asterisk (*).

74

186

103

2000 AIME I, Problem #3

In the expansion of (ax + b)2000 , where a and b are relatively prime positive integers, the coefficients of x2
and x3 are equal. Find a + b.

2007 AIME I, Problem #2

A 100 foot long moving walkway moves at a constant rate of 6 feet per second. Al steps onto the start of the
walkway and stands. Bob steps onto the start of the walkway two seconds later and strolls forward along
the walkway at a constant rate of 4 feet per second. Two seconds after that, Cy reaches the start of the
walkway and walks briskly forward beside the walkway at a constant rate of 8 feet per second. At a certain
time, one of these three persons is exactly halfway between the other two. At that time, find the distance in
feet between the start of the walkway and the middle person.

2008 AIME II, Problem #2

Rudolph bikes at a constant rate and stops for a five-minute break at the end of every mile. Jennifer bikes at
a constant rate which is three-quarters the rate that Rudolph bikes, but Jennifer takes a five-minute break
at the end of every two miles. Jennifer and Rudolph begin biking at the same time and arrive at the 50-mile
mark at exactly the same time. How many minutes has it taken them?

2011 AIME I, Problem #1

Jar A contains four liters of a solution that is 45% acid. Jar B contains five liters of a solution that is 48%
acid. Jar C contains one liter of a solution that is k% acid. From jar C, mn liters of the solution is added to
jar A, and the remainder of the solution in jar C is added to jar B. At the end, both jar A and jar B contain
solutions that are 50% acid. Given that m and n are relatively prime positive integers, find k + m + n.

6
 Remove Watermark Wondershare
PDFelement

2011 AIME II, Problem #1

Gary purchased a large beverage, but drank only m/n of this beverage, where m and n are relatively prime
positive integers. If Gary had purchased only half as much and drunk twice as much, he would have wasted
only 29 as much beverage. Find m + n.

2013 AIME I, Problem #1

The AIME Triathlon consists of a half-mile swim, a 30-mile bicycle, and an eight-mile run. Tom swims,
bicycles, and runs at constant rates. He runs five times as fast as he swims, and he bicycles twice as fast as
he runs. Tom completes the AIME Triathlon in four and a quarter hours. How many minutes does he spend
bicycling?

2013 AIME II, Problem #1

Suppose that the measurement of time during the day is converted to the metric system so that each day has
10 metric hours, and each metric hour has 100 metric minutes. Digital clocks would then be produced that
would read 9:99 just before midnight, 0:00 at midnight, 1:25 at the former 3:00 am, and 7:50 at the former
6:00 pm. After the conversion, a person who wanted to wake up at the equivalent of the former 6:36 am
would have to set his new digital alarm clock for A:BC, where A, B, and C are digits. Find 100A + 10B + C.

2014 AIME II, Problem #1

Abe can paint the room in 15 hours, Bea can paint 50 percent faster than Abe, and Coe can paint twice as
fast as Abe. Abe begins to paint the room and works alone for the first hour and a half. Then Bea joins
Abe, and they work together until half the room is painted. Then Coe joins Abe and Bea, and they work
together until the entire room is painted. Find the number of minutes after Abe begins for the three of them
to finish painting the room.

1989 AIME, Problem #7

If the integer k is added to each of the numbers 36, 300, and 596, one obtains the squares of three consecutive
terms of an arithmetic series. Find k.

1990 AIME, Problem #6

A biologist wants to calculate the number of fish in a lake. On May 1 she catches a random sample of 60
fish, tags them, and releases them. On September 1 she catches a random sample of 70 fish and finds that 3
of them are tagged. To calculate the number of fish in the lake on May 1, she assumes that 25% of these fish
are no longer in the lake on September 1 (because of death and emigrations), that 40% of the fish were not
in the lake May 1 (because of births and immigrations), and that the number of untagged fish and tagged
fish in the September 1 sample are representative of the total population. What does the biologist calculate
for the number of fish in the lake on May 1?

7
 Remove Watermark Wondershare
PDFelement

2008 AIME I, Problem #3

Ed and Sue bike at equal and constant rates. Similarly, they jog at equal and constant rates, and they
swim at equal and constant rates. Ed covers 74 kilometers after biking for 2 hours, jogging for 3 hours, and
swimming for 4 hours, while Sue covers 91 kilometers after jogging for 2 hours, swimming for 3 hours, and
biking for 4 hours. Their biking, jogging, and swimming rates are all whole numbers of kilometers per hour.
Find the sum of the squares of Ed’s biking, jogging, and swimming rates.

1989 AIME, Problem #8

Assume that x1 , x2 , . . . , x7 are real numbers such that

x1 + 4x2 + 9x3 + 16x4 + 25x5 + 36x6 + 49x7 = 1

4x1 + 9x2 + 16x3 + 25x4 + 36x5 + 49x6 + 64x7 = 12
9x1 + 16x2 + 25x3 + 36x4 + 49x5 + 64x6 + 81x7 = 123

Find the value of 16x1 + 25x2 + 36x3 + 49x4 + 64x5 + 81x6 + 100x7 .

2004 AIME II, Problem #5

In order to complete a large job, 1000 workers were hired, just enough to complete the job on schedule.
All the workers stayed on the job while the first quarter of the work was done, so the first quarter of the
work was completed on schedule. Then 100 workers were laid off, so the second quarter of the work was
completed behind schedule. Then an additional 100 workers were laid off, so the third quarter of the work
was completed still further behind schedule. Given that all workers work at the same rate, what is the
minimum number of additional workers, beyond the 800 workers still on the job at the end of the third
quarter, that must be hired after three-quarters of the work has been completed so that the entire project
can be completed on schedule or before?

2007 AIME II, Problem #4

The workers in a factory produce widgets and whoosits. For each product, production time is constant
and identical for all workers, but not necessarily equal for the two products. In one hour, 100 workers can
produce 300 widgets and 200 whoosits. In two hours, 60 workers can produce 240 widgets and 300 whoosits.
In three hours, 50 workers can produce 150 widgets and m whoosits. Find m.

2010 AIME I, Problem #3

Suppose that y = 34 x and xy = y x . The quantity x + y can be expressed as a rational number r

s, where r
and s are relatively prime positive integers. Find r + s.

2013 AIME II, Problem #3

A large candle is 119 centimeters tall. It is designed to burn down more quickly when it is first lit and
more slowly as it approaches its bottom. Specifically, the candle takes 10 seconds to burn down the first
centimeter from the top, 20 seconds to burn down the second centimeter, and 10k seconds to burn down the
k-th centimeter. Suppose it takes T seconds for the candle to burn down completely. Then T2 seconds after
it is lit, the candle’s height in centimeters will be h. Find 10h.

8
 Remove Watermark Wondershare
PDFelement

2006 AIME I, Problem #5

The number
√ √ √
q
104 6 + 468 10 + 144 15 + 2006
√ √ √
can be written as a 2 + b 3 + c 5, where a, b, and c are positive integers. Find a · b · c.

2012 AIME I, Problem #4

Butch and Sundance need to get out of Dodge. To travel as quickly as possible, each alternates walking and
riding their only horse, Sparky, as follows. Butch begins walking as Sundance rides. When Sundance reaches
the first of their hitching posts that are conveniently located at one-mile intervals along their route, he ties
Sparky to the post and begins walking. When Butch reaches Sparky, he rides until he passes Sundance, then
leaves Sparky at the next hitching post and resumes walking, and they continue in this manner. Sparky,
Butch, and Sundance walk at 6, 4, and 2.5 miles per hour, respectively. The first time Butch and Sundance
meet at a milepost, they are n miles from Dodge, and have been traveling for t minutes. Find n + t.

2014 AIME I, Problem #4

Jon and Steve ride their bicycles on a path that parallels two side-by-side train tracks running in the east/west
direction. Jon rides east at 20 miles per hour, and Steve rides west at 20 miles per hour. Two trains of equal
length traveling in opposite directions at constant but different speeds, each pass the two riders. Each train
takes exactly 1 minute to go past Jon. The westbound train takes 10 times as long as the eastbound train
to go past Steve. The length of each train is m n , where m and n are relatively prime positive integers. Find
m + n.

1987 AIME, Problem #10

Al walks down to the bottom of an escalator that is moving up and he counts 150 steps. His friend, Bob,
walks up to the top of the escalator and counts 75 steps. If Al’s speed of walking (in steps per unit time)
is three times Bob’s walking speed, how many steps are visible on the escalator at a given time? (Assume
that this value is constant.)

2000 AIME I, Problem #7

Suppose that x, y, and z are three positive numbers that satisfy the equations xyz = 1, x + z1 = 5, and
y + x1 = 29. Then z + y1 = m
n , where m and n are relatively prime positive integers. Find m + n.

2000 AIME II, Problem #7

Given that
1 1 1 1 1 1 1 1 N
+ + + + + + + =
2!17! 3!16! 4!15! 5!14! 6!13! 7!12! 8!11! 9!10! 1!18!
N
find the greatest integer that is less than 100 .

9
 Remove Watermark Wondershare
PDFelement

2002 AIME I, Problem #7

The Binomial Expansion is valid for exponents that are not integers. That is, for all real numbers x, y, and
r with |x| > |y|,

r(r − 1) r−2 2 r(r − 1)(r − 2) r−3 3

(x + y)r = xr + rxr−1 y + x y + x y + ···
2 3!

10/7
What are the first three digits to the right of the decimal point in the decimal representation of 102002 + 1 ?

2013 AIME I, Problem #5

√ √
3 a+ 3 b+1
The real root of the equation 8x3 − 3x2 − 3x − 1 = 0 can be written in the form c , where a, b, and
c are positive integers. Find a + b + c.

2012 AIME I, Problem #7

At each of the sixteen circles in the network below stands a student. A total of 3360 coins are distributed
among the sixteen students. All at once, all students give away all their coins by passing an equal number of
coins to each of their neighbors in the network. After the trade, all students have the same number of coins
as they started with. Find the number of coins the student standing at the center circle had originally.

2013 AIME II, Problem #7

A group of clerks is assigned the task of sorting 1775 files. Each clerk sorts at a constant rate of 30 files
per hour. At the end of the first hour, some of the clerks are reassigned to another task; at the end of the
second hour, the same number of the remaining clerks are also reassigned to another task, and a similar
reassignment occurs at the end of the third hour. The group finishes the sorting in 3 hours and 10 minutes.
Find the number of files sorted during the first one and a half hours of sorting.

1987 AIME, Problem #14

Compute
(104 + 324)(224 + 324)(344 + 324)(464 + 324)(584 + 324)
.
(44 + 324)(164 + 324)(284 + 324)(404 + 324)(524 + 324)

10
 Remove Watermark Wondershare
PDFelement

2010 AIME I, Problem #9

Let (a, b, c) be the real solution of the system of equations x3 − xyz = 2, y 3 − xyz = 6, z 3 − xyz = 20. The
greatest possible value of a3 + b3 + c3 can be written in the form m n , where m and n are relatively prime
positive integers. Find m + n.

1990 AIME, Problem #15

Find ax5 + by 5 if the real numbers a, b, x, and y satisfy the equations

ax + by = 3,
2 2
ax + by = 7,
3 3
ax + by = 16,
4 4
ax + by = 42.

2006 AIME II, Problem #15

Given that x, y, and z are real numbers that satisfy:

r r
1 1
x = y2 − + z2 −
16 16
r r
1 1
y= z − 2 + x2 −
25 25
r r
1 1
z = x2 − + y2 −
36 36
and that x + y + z = √mn , where m and n are positive integers and n is not divisible by the square of any
prime, find m + n.

2013 AIME II, Problem #14

For positive integers n and k, let f (n, k) be the remainder when n is divided by k, and for n > 1 let
100
X
F (n) = maxn f (n, k). Find the remainder when F (n) is divided by 1000.
1≤k≤ 2
n=20

2014 AIME I, Problem #14

Let m be the largest real solution to the equation

3 5 17 19
+ + + = x2 − 11x − 4.
x − 3 x − 5 x − 17 x − 19
p √
There are positive integers a, b, c such that m = a + b + c. Find a + b + c.

11
 Remove Watermark Wondershare
PDFelement

5 Counting
1987 AIME, Problem #1

An ordered pair (m, n) of non-negative integers is called “simple” if the addition m + n in base 10 requires
no carrying. Find the number of simple ordered pairs of non-negative integers that sum to 1492.

1988 AIME, Problem #1

One commercially available ten-button lock may be opened by depressing – in any order – the correct
five buttons. The sample shown below has {1, 2, 3, 6, 9} as its combination. Suppose that these locks are
redesigned so that sets of as many as nine buttons or as few as one button could serve as combinations. How
many additional combinations would this allow?

1 6

2 7

3 8

4 9

5 10

1989 AIME, Problem #2

Ten points are marked on a circle. How many distinct convex polygons of three or more sides can be drawn
using some (or all) of the ten points as vertices?

1990 AIME, Problem #1

The increasing sequence 2, 3, 5, 6, 7, 10, 11, . . . consists of all positive integers that are neither the square nor
the cube of a positive integer. Find the 500th term of this sequence.

1993 AIME, Problem #1

How many even integers between 4000 and 7000 have four different digits?

1992 AIME, Problem #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?

38
 Remove Watermark Wondershare
PDFelement

1997 AIME, Problem #2

The nine horizontal and nine vertical lines on an 8×8 checkerboard form r rectangles, of which s are squares.
The number s/r can be written in the form m/n, where m and n are relatively prime positive integers. Find
m + n.

2002 AIME II, Problem #1

Given that
(1) x and y are both integers between 100 and 999, inclusive;
(2) y is the number formed by reversing the digits of x; and
(3) z = |x − y|.
How many distinct values of z are possible?

1994 AIME, Problem #4

Find the positive integer n for which

blog2 1c + blog2 2c + blog2 3c + · · · + blog2 nc = 1994.
(For real x, bxc is the greatest integer ≤ x.)

1996 AIME, Problem #3

Find the smallest positive integer n for which the expansion of (xy − 3x + 7y − 21)n , after like terms have
been collected, has at least 1996 terms.

2001 AIME II, Problem #2

Each of the 2001 students at a high school studies either Spanish or French, and some study both. The
number who study Spanish is between 80 percent and 85 percent of the school population, and the number
who study French is between 30 percent and 40 percent. Let m be the smallest number of students who
could study both languages, and let M be the largest number of students who could study both languages.
Find M − m.

2005 AIME II, Problem #1

A game uses a deck of n different cards, where n is an integer and n ≥ 6. The number of possible sets of 6
cards that can be drawn from the deck is 6 times the number of possible sets of 3 cards that can be drawn.
Find n.

2007 AIME II, Problem #1

A mathematical organization is producing a set of commemorative license plates. Each plate contains a
sequence of five characters chosen from the four letters in AIME and the four digits in 2007. No character
may appear in a sequence more times than it appears among the four letters in AIME or the four digits in
2007. A set of plates in which each possible sequence appears exactly once contains N license plates. Find
N
10 .

39
 Remove Watermark Wondershare
PDFelement

2003 AIME I, Problem #3

Let the set S = {8, 5, 1, 13, 34, 3, 21, 2}. Susan makes a list as follows: for each two-element subset of S, she
writes on her list the greater of the set’s two elements. Find the sum of the numbers on the list.

2003 AIME II, Problem #3

Define a good word as a sequence of letters that consists only of the letters A, B, and C − some of these
letters may not appear in the sequence − and in which A is never immediately followed by B, B is never
immediately followed by C, and C is never immediately followed by A. How many seven-letter good words
are there?

2004 AIME I, Problem #3

A convex polyhedron P has 26 vertices, 60 edges, and 36 faces, 24 of which are triangular, and 12 of which
are quadrilaterals. A space diagonal is a line segment connecting two non-adjacent vertices that do not
belong to the same face. How many space diagonals does P have?

2006 AIME I, Problem #2

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

1992 AIME, Problem #6

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

2004 AIME II, Problem #4

How many positive integers less than 10,000 have at most two different digits?

2000 AIME II, Problem #5

Given eight distinguishable rings, let n be the number of possible five-ring arrangements on the four fingers
(not the thumb) of one hand. The order of rings on each finger is significant, but it is not required that each
finger have a ring. Find the leftmost three nonzero digits of n.

2002 AIME I, Problem #5

Let A1 , A2 , A3 , . . . , A12 be the vertices of a regular dodecagon. How many distinct squares in the plane of
the dodecagon have at least two vertices in the set {A1 , A2 , A3 , . . . , A12 }?

40
 Remove Watermark Wondershare
PDFelement

2006 AIME II, Problem #4

Let (a1 , a2 , a3 , ..., a12 ) be a permutation of (1, 2, 3, ..., 12) for which

a1 > a2 > a3 > a4 > a5 > a6 and a6 < a7 < a8 < a9 < a10 < a11 < a12 .

An example of such a permutation is (6, 5, 4, 3, 2, 1, 7, 8, 9, 10, 11, 12). Find the number of such permutations.

2012 AIME I, Problem #3

Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal,
three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random
order. Find the number of ways in which the waiter could serve the meal types to the nine people such that
exactly one person receives the type of meal ordered by that person.

2012 AIME II, Problem #3

At a certain university, the division of mathematical sciences consists of the departments of mathematics,
statistics, and computer science. There are two male and two female professors in each department. A
committee of six professors is to contain three men and three women and must also contain two professors
from each of the three departments. Find the number of possible comittees that can be formed subject to
these requirements.

1983 AIME, Problem #10

The numbers 1447, 1005, and 1231 have something in common: each is a four-digit number beginning with
1 that has exactly two identical digits. How many such numbers are there?

1990 AIME, Problem #8

In a shooting match, eight clay targets are arranged in two hanging columns of three targets each and one
column of two targets. A marksman is to break all the targets according to the following rules:
1) The marksman first chooses a column from which a target is to be broken.
2) The marksman must then break the lowest remaining target in the chosen column.
If the rules are followed, in how many different orders can the eight targets be broken?

1993 AIME, Problem #8

Let S be a set with six elements. In how many different ways can one select two not necessarily distinct
subsets of S so that the union of the two subsets is S? The order of selection does not matter; for example,
the pair of subsets {a, c}, {b, c, d, e, f } represents the same selection as the pair {b, c, d, e, f }, {a, c}.

1996 AIME, Problem #7

Two of the squares of a 7 × 7 checkerboard are painted yellow, and the rest are painted green. Two color
schemes are equivalent if one can be obtained from the other by applying a rotation in the plane of the
board. How many inequivalent color schemes are possible?

41
 Remove Watermark Wondershare
PDFelement

1998 AIME, Problem #7

P4
Let n be the number of ordered quadruples (x1 , x2 , x3 , x4 ) of positive odd integers that satisfy i=1 xi = 98.
n
Find 100 .

2004 AIME I, Problem #6

An integer is called snakelike if its decimal representation a1 a2 a3 · · · ak satisfies ai < ai+1 if i is odd and
ai > ai+1 if i is even. How many snakelike integers between 1000 and 9999 have four distinct digits?

2005 AIME I, Problem #5

Robert has 4 indistinguishable gold coins and 4 indistinguishable silver coins. Each coin has an engraving of
one face on one side, but not on the other. He wants to stack the eight coins on a table into a single stack
so that no two adjacent coins are face to face. Find the number of possible distinguishable arrangements of
the 8 coins.

1988 AIME, Problem #10

A convex polyhedron has for its faces 12 squares, 8 regular hexagons, and 6 regular octagons. At each vertex
of the polyhedron one square, one hexagon, and one octagon meet. How many segments joining vertices of
the polyhedron lie in the interior of the polyhedron rather than along an edge or a face?

1997 AIME, Problem #8

How many different 4 × 4 arrays whose entries are all 1’s and -1’s have the property that the sum of the
entries in each row is 0 and the sum of the entires in each column is 0?

2005 AIME II, Problem #6

The cards in a stack of 2n cards are numbered consecutively from 1 through 2n from top to bottom. The
top n cards are removed, kept in order, and form pile A. The remaining cards form pile B. The cards are
then restacked by taking cards alternately from the tops of pile B and A, respectively. In this process, card
number (n + 1) becomes the bottom card of the new stack, card number 1 is on top of this card, and so on,
until piles A and B are exhausted. If, after the restacking process, at least one card from each pile occupies
the same position that it occupied in the original stack, the stack is named magical. Find the number of
cards in the magical stack in which card number 131 retains its original position.

2007 AIME I, Problem #6

A frog is placed at the origin on the number line, and moves according to the following rule: in a given
move, the frog advances to either the closest point with a greater integer coordinate that is a multiple of
3, or to the closest point with a greater integer coordinate that is a multiple of 13. A move sequence is
a sequence of coordinates which correspond to valid moves, beginning with 0, and ending with 39. For
example, 0, 3, 6, 13, 15, 26, 39 is a move sequence. How many move sequences are possible for the frog?

42
 Remove Watermark Wondershare
PDFelement

2007 AIME II, Problem #6

An integer is called parity-monotonic if its decimal representation a1 a2 a3 · · · ak satisfies ai < ai+1 if ai is

odd, and ai > ai+1 is ai is even. How many four-digit parity-monotonic integers are there?

2009 AIME II, Problem #6

Let m be the number of five-element subsets that can be chosen from the set of the first 14 natural numbers
so that at least two of the five numbers are consecutive. Find the remainder when m is divided by 1000.

2014 AIME I, Problem #5

Let the set S = {P1 , P2 , · · · , P12 } consist of the twelve vertices of a regular 12-gon. A subset Q of S is called
communal if there is a circle such that all points of Q are inside the circle, and all points of S not in Q
are outside of the circle. How many communal subsets are there? (Note that the empty set is a communal
subset.)

1993 AIME, Problem #10

Euler’s formula states that for a convex polyhedron with V vertices, E edges, and F faces, V − E + F = 2.
A particular convex polyhedron has 32 faces, each of which is either a triangle or a pentagon. At each of its
V vertices, T triangular faces and P pentagonal faces meet. What is the value of 100P + 10T + V ?

2006 AIME II, Problem #7

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

2008 AIME I, Problem #7

Let Si be the set of all integers n such that 100i ≤ n < 100(i+1). For example, S4 is the set 400, 401, 402, . . . , 499.
How many of the sets S0 , S1 , S2 , . . . , S999 do not contain a perfect square?

2011 AIME II, Problem #6

Define an ordered quadruple of integers (a, b, c, d) to be interesting if 1 ≤ a < b < c < d ≤ 10, and
a + d > b + c. How many interesting ordered quadruples are there?

1983 AIME, Problem #13

For {1, 2, 3, . . . , n} and each of its nonempty subsets a unique alternating sum is defined as follows:
Arrange the numbers in the subset in decreasing order and then, beginning with the largest, alternately add
and subtract successive numbers. (For example, the alternating sum for {1, 2, 4, 6, 9} is 9 − 6 + 4 − 2 + 1 = 6
and for {5} it is simply 5.) Find the sum of all such alternating sums for n = 7.

43
 Remove Watermark Wondershare
PDFelement

1986 AIME, Problem #12

Let the sum of a set of numbers be the sum of its elements. Let S be a set of positive integers, none greater
than 15. Suppose no two disjoint subsets of S have the same sum. What is the largest sum a set S with
these properties can have?

1994 AIME, Problem #11

Ninety-four bricks, each measuring 400 × 1000 × 1900 , are to stacked one on top of another to form a tower 94
bricks tall. Each brick can be oriented so it contribues 400 or 1000 or 1900 to the total height of the tower.
How many different tower heights can be achieved using all 94 of the bricks?

1997 AIME, Problem #10

Every card in a deck has a picture of one shape - circle, square, or triangle, which is painted in one of the
three colors - red, blue, or green. Furthermore, each color is applied in one of three shades - light, medium,
or dark. The deck has 27 cards, with every shape-color-shade combination represented. A set of three cards
from the deck is called complementary if all of the following statements are true:
i. Either each of the three cards has a different shape or all three of the card have the same shape.
ii. Either each of the three cards has a different color or all three of the cards have the same color.
iii. Either each of the three cards has a different shade or all three of the cards have the same shade.
How many different complementary three-card sets are there?

2002 AIME II, Problem #9

Let S be the set {1, 2, 3, . . . , 10}. Let n be the number of sets of two non-empty disjoint subsets of S. (Disjoint
sets are defined as sets that have no common elements.) Find the remainder obtained when n is divided by
1000.

2003 AIME I, Problem #9

An integer between 1000 and 9999, inclusive, is called balanced if the sum of its two leftmost digits equals
the sum of its two rightmost digits. How many balanced integers are there?

2006 AIME II, Problem #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. 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 may be formed?

44
 Remove Watermark Wondershare
PDFelement

2007 AIME II, Problem #8

A rectangular piece of of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of
the paper. A rectangle determined by the intersections of some of these lines is called basic if
(i) all four sides of the rectangle are segments of drawn line segments, and
(ii) no segments of drawn lines lie inside the rectangle.
Given that the total length of all lines drawn is exactly 2007 units, let N be the maximum possible number
of basic rectangles determined. Find the remainder when N is divided by 1000.

2009 AIME I, Problem #8

Let S = {20 , 21 , 22 , . . . , 210 }. Consider all possible positive differences of pairs of elements of S. Let N be
the sum of all of these differences. Find the remainder when N is divided by 1000.

2010 AIME I, Problem #7

Define an ordered triple (A, B, C) of sets to be minimally intersecting if |A ∩ B| = |B ∩ C| = |C ∩ A| = 1

and A ∩ B ∩ C = ∅. For example, ({1, 2}, {2, 3}, {1, 3, 4}) is a minimally intersecting triple. Let N be the
number of minimally intersecting ordered triples of sets for which each set is a subset of {1, 2, 3, 4, 5, 6, 7}.
Find the remainder when N is divided by 1000.
Note: |S| represents the number of elements in the set S.

2011 AIME II, Problem #7

Ed has five identical green marbles and a large supply of identical red marbles. He arranges the green marbles
and some of the red marbles in a row and finds that the number of marbles whose right hand neighbor is
the same color as themselves equals the number of marbles whose right hand neighbor is the other color. An
example of such an arrangement is GGRRRGGRG. let m be the maximum number of red marbles for which
Ed can make such an arrangement, and let N be the number of ways in which Ed can arrange the m + 5
marbles to satisfy the requirement. Find the remainder when N is divided by 1000.

1986 AIME, Problem #13

In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately followed by a
head, a head is immediately followed by a head, and etc. We denote these by TH, HH, and etc. For example,
in the sequence HHTTHHHHTHHTTTT of 15 coin tosses we observe that there are two HH, three HT, four
TH, and five TT subsequences. How many different sequences of 15 coin tosses will contain exactly two HH,
three HT, four TH, and five TT subsequences?

1992 AIME, Problem #12

In a game of Chomp, two players alternately take bites from a 5-by-7 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

45
 Remove Watermark Wondershare
PDFelement

marked by ×. (The squares with two or more dotted edges have been removed form 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 35 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.

2009 AIME I, Problem #9

A game show offers a contestant three prizes A, B and C, each of which is worth a whole number of dollars
from $1 to $9999 inclusive. The contestant wins the prizes by correctly guessing the price of each prize in
the order A, B, C. As a hint, the digits of the three prices are given. On a particular day, the digits given
were 1, 1, 1, 1, 3, 3, 3. Find the total number of possible guesses for all three prizes consistent with the hint.

2010 AIME II, Problem #8

Let N be the number of ordered pairs of nonempty sets A and B that have the following properties:
• A ∪ B = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12},
• A ∩ B = ∅,
• The number of elements of A is not an element of A,
• The number of elements of B is not an element of B.
Find N .

1985 AIME, Problem #14

In a tournament each player played exactly one game against each of the other players. In each game the
winner was awarded 1 point, the loser got 0 points, and each of the two players earned 1/2 point if the game
was a tie. After the completion of the tournament, it was found that exactly half of the points earned by
each player were earned against the ten players with the least number of points. (In particular, each of the
ten lowest scoring players earned half of her/his points against the other nine of the ten). What was the
total number of players in the tournament?

1996 AIME, Problem #12

For each permutation a1 , a2 , a3 , . . . , a10 of the integers 1, 2, 3, . . . , 10, form the sum

|a1 − a2 | + |a3 − a4 | + |a5 − a6 | + |a7 − a8 | + |a9 − a10 |.

The average value of all such sums can be written in the form p/q, where p and q are relatively prime positive
integers. Find p + q.

46
 Remove Watermark Wondershare
PDFelement

2007 AIME I, Problem #10

In the 6 × 4 grid shown, 12 of the 24 squares are to be shaded so that there are two shaded squares in each
row and three shaded squares in each column. Let N be the number of shadings with this property. Find
the remainder when N is divided by 1000.

2009 AIME I, Problem #10

The Annual Interplanetary Mathematics Examination (AIME) is written by a committee of five Martians,
five Venusians, and five Earthlings. At meetings, committee members sit at a round table with chairs
numbered from 1 to 15 in clockwise order. Committee rules state that a Martian must occupy chair 1 and
an Earthling must occupy chair 15. Furthermore, no Earthling can sit immediately to the left of a Martian,
no Martian can sit immediately to the left of a Venusian, and no Venusian can sit immediately to the left of
an Earthling. The number of possible seating arrangements for the committee is N · (5!)3 . Find N .

2013 AIME II, Problem #9

A 7 × 1 board is completely covered by m × 1 tiles without overlap; each tile may cover any number of
consecutive squares, and each tile lies completely on the board. Each tile is either red, blue, or green. Let
N be the number of tilings of the 7 × 1 board in which all three colors are used at least once. For example,
a 1 × 1 red tile followed by a 2 × 1 green tile, a 1 × 1 green tile, a 2 × 1 blue tile, and a 1 × 1 green tile is
a valid tiling. Note that if the 2 × 1 blue tile is replaced by two 1 × 1 blue tiles, this results in a different
tiling. Find the remainder when N is divided by 1000.

2014 AIME II, Problem #9

Ten chairs are arranged in a circle. Find the number of subsets of this set of chairs that contain at least
three adjacent chairs.

1988 AIME, Problem #15

In an office at various times during the day, the boss gives the secretary a letter to type, each time putting
the letter on top of the pile in the secretary’s in-box. When there is time, the secretary takes the top letter
off the pile and types it. There are nine letters to be typed during the day, and the boss delivers them in
the order 1, 2, 3, 4, 5, 6, 7, 8, 9.

47
 Remove Watermark Wondershare
PDFelement

While leaving for lunch, the secretary tells a colleague that letter 8 has already been typed, but says nothing
else about the morning’s typing. The colleague wonder which of the nine letters remain to be typed after
lunch and in what order they will be typed. Based upon the above information, how many such after-lunch
typing orders are possible? (That there are no letters left to be typed is one of the possibilities.)

2006 AIME I, Problem #11

A collection of 8 cubes consists of one cube with edge-length k for each integer k, 1 ≤ k ≤ 8. A tower is to
be built using all 8 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 k must have edge-length at most k + 2.
Let T be the number of different towers than can be constructed. What is the remainder when T is divided
by 1000?

2008 AIME I, Problem #11

Consider sequences that consist entirely of A’s and B’s and that have the property that every run of con-
secutive A’s has even length, and every run of consecutive B’s has odd length. Examples of such sequences
are AA, B, and AABAA, while BBAB is not such a sequence. How many such sequences have length 14?

2010 AIME I, Problem #10

Let N be the number of ways to write 2010 in the form 2010 = a3 · 103 + a2 · 102 + a1 · 10 + a0 , where the
ai ’s are integers, and 0 ≤ ai ≤ 99. An example of such a representation is 1 · 103 + 3 · 102 + 67 · 101 + 40 · 100 .
Find N .

2012 AIME II, Problem #10

Find the number of positive integers n less than 1000 for which there exists a positive real number x such
that n = xbxc. Note: bxc is the greatest integer less than or equal to x.

2008 AIME II, Problem #12

There are two distinguishable flagpoles, and there are 19 flags, of which 10 are identical blue flags, and 9 are
identical green flags. Let N be the number of distinguishable arrangements using all of the flags in which
each flagpole has at least one flag and no two green flags on either pole are adjacent. Find the remainder
when N is divided by 1000.

2010 AIME II, Problem #11

Define a T-grid to be a 3 × 3 matrix which satisfies the following two properties:

(1) Exactly five of the entries are 1’s, and the remaining four entries are 0’s.
(2) Among the eight rows, columns, and long diagonals (the long diagonals are {a13 , a22 , a31 } and {a11 , a22 , a33 },
no more than one of the eight has all three entries equal.
Find the number of distinct T-grids.

48
 Remove Watermark Wondershare
PDFelement

2012 AIME I, Problem #11

A frog begins at P0 = (0, 0) and makes a sequence of jumps according to the following rule: from Pn =
(xn , yn ), the frog jumps to Pn+1 , which may be any of the points (xn + 7, yn + 2), (xn + 2, yn + 7), (xn −
5, yn − 10), or (xn − 10, yn − 5). There are M points (x, y) with |x| + |y| ≤ 100 that can be reached by a
sequence of such jumps. Find the remainder when M is divided by 1000.

2013 AIME II, Problem #11

Let A = {1, 2, 3, 4, 5, 6, 7} and let N be the number of functions f from set A to set A such that f (f (x)) is
a constant function. Find the remainder when N is divided by 1000.

2014 AIME I, Problem #11

A token starts at the point (0, 0) of an xy-coordinate grid and them makes a sequence of six moves. Each
move is 1 unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the
four possible directions and independently of the other moves. The probability the token ends at a point on
the graph of |y| = |x| is m
n , where m and n are relatively prime positive integers. Find m + n.

1998 AIME, Problem #15

Define a domino to be an ordered pair of distinct positive integers. A proper sequence of dominos is a list of
distinct dominos in which the first coordinate of each pair after the first equals the second coordinate of the
immediately preceding pair, and in which (i, j) and (j, i) do not both appear for any i and j. Let D40 be the
set of all dominos whose coordinates are no larger than 40. Find the length of the longest proper sequence
of dominos that can be formed using the dominos of D40 .

2001 AIME I, Problem #14

A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that
no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a
row that get no mail on the same day. How many different patterns of mail delivery are possible?

2005 AIME I, Problem #13

A particle moves in the Cartesian Plane according to the following rules:

1. From any lattice point (a, b), the particle may only move to (a + 1, b), (a, b + 1), or (a + 1, b + 1).
2. There are no right angle turns in the particle’s path.
How many different paths can the particle take from (0, 0) to (5, 5)?

2010 AIME I, Problem #12

Let m ≥ 3 be an integer and let S = {3, 4, 5, . . . , m}. Find the smallest value of m such that for every
partition of S into two subsets, at least one of the subsets contains integers a, b, and c (not necessarily
distinct) such that ab = c.
Note: a partition of S is a pair of sets A, B such that A ∩ B = ∅, A ∪ B = S.

49
 Remove Watermark Wondershare
PDFelement

2000 AIME I, Problem #15

A stack of 2000 cards is labelled with the integers from 1 to 2000, with different integers on different cards.
The cards in the stack are not in numerical order. The top card is removed from the stack and placed on
the table, and the next card is moved to the bottom of the stack. The new top card is removed from the
stack and placed on the table, to the right of the card already there, and the next card in the stack is moved
to the bottom of the stack. The process - placing the top card to the right of the cards already on the
table and moving the next card in the stack to the bottom of the stack - is repeated until all cards are on
the table. It is found that, reading from left to right, the labels on the cards are now in ascending order:
1, 2, 3, . . . , 1999, 2000. In the original stack of cards, how many cards were above the card labelled 1999?

2004 AIME II, Problem #15

A long thin strip of paper is 1024 units in length, 1 unit in width, and is divided into 1024 unit squares. The
paper is folded in half repeatedly. For the first fold, the right end of the paper is folded over to coincide with
and lie on top of the left end. The result is a 512 by 1 strip of double thickness. Next, the right end of this
strip is folded over to coincide with and lie on top of the left end, resulting in a 256 by 1 strip of quadruple
thickness. This process is repeated 8 more times. After the last fold, the strip has become a stack of 1024
unit squares. How many of these squares lie below the square that was originally the 942nd square counting
from the left?

2012 AIME II, Problem #14

In a group of nine people each person shakes hands with exactly two of the other people from the group. Let
N be the number of ways this handshaking can occur. Consider two handshaking arrangements different if
and only if at least two people who shake hands under one arrangement do not shake hands under the other
arrangement. Find the remainder when N is divided by 1000.

50
 Remove Watermark Wondershare
PDFelement

1987 AIME, Problem #3

By a proper divisor of a natural number we mean a positive integral divisor other than 1 and the number
itself. A natural number greater than 1 will be called “nice” if it is equal to the product of its distinct proper
divisors. What is the sum of the first ten nice numbers?

1998 AIME, Problem #1

For how many values of k is 1212 the least common multiple of the positive integers 66 , 88 , and k?

1999 AIME, Problem #1

Find the smallest prime that is the fifth term of an increasing arithmetic sequence, all four preceding terms
also being prime.

1989 AIME, Problem #4

If a < b < c < d < e are consecutive positive integers such that b+c+d is a perfect square and a+b+c+d+e
is a perfect cube, what is the smallest possible value of c?

1996 AIME, Problem #2

For each real number x, let bxc denote the greatest integer that does not exceed x. For how many positive
integers n is it true that n < 1000 and that blog2 nc is a positive even integer.

2000 AIME I, Problem #1

Find the least positive integer n such that no matter how 10n is expressed as the product of any two positive
integers, at least one of these two integers contains the digit 0.

2001 AIME I, Problem #1

Find the sum of all positive two-digit integers that are divisible by each of their digits.

2004 AIME I, Problem #1

The digits of a positive integer n are four consecutive integers in decreasing order when read from left to
right. What is the sum of the possible remainders when n is divided by 37?

1983 AIME, Problem #6

Let an = 6n + 8n . Determine the remainder on dividing a83 by 49.

1986 AIME, Problem #5

What is that largest positive integer n for which n3 + 100 is divisible by n + 10?

62
 Remove Watermark Wondershare
PDFelement

1988 AIME, Problem #5

Let m/n, in lowest terms, be the probability that a randomly chosen positive divisor of 1099 is an integer
multiple of 1088 . Find m + n.

2003 AIME II, Problem #2

Let N be the greatest integer multiple of 8, no two of whose digits are the same. What is the remainder
when N is divided by 1000?

2007 AIME I, Problem #1

How many positive perfect squares less than 106 are multiples of 24?

1990 AIME, Problem #5

Let n be the smallest positive integer that is a multiple of 75 and has exactly 75 positive integral divisors,
including 1 and itself. Find n/75.

1991 AIME, Problem #5

Given a rational number, write it as a fraction in lowest terms and calculate the product of the resulting
numerator and denominator. For how many rational numbers between 0 and 1 will 20! be the resulting
product?

1992 AIME, Problem #5

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

2005 AIME I, Problem #2

For each positive integer k, let Sk denote the increasing arithmetic sequence of integers whose first term is
1 and whose common difference is k. For example, S3 is the sequence 1, 4, 7, 10, .... For how many values of
k does Sk contain the term 2005?

2010 AIME I, Problem #1

Maya lists all the positive divisors of 20102 . She then randomly selects two distinct divisors from this list.
Let p be the probability that exactly one of the selected divisors is a perfect square. The probability p can
be expressed in the form m n , where m and n are relatively prime positive integers. Find m + n.

2010 AIME II, Problem #1

Let N be the greatest integer multiple of 36 all of whose digits are even and no two of whose digits are the
same. Find the remainder when N is divided by 1000.

63
 Remove Watermark Wondershare
PDFelement

2012 AIME I, Problem #1

Find the number of positive integers with three not necessarily distinct digits, abc, with a 6= 0, c 6= 0 such
that both abc and cba are divisible by 4.

1983 AIME, Problem #8

200


What is the largest 2-digit prime factor of the integer n = 100 ?

1985 AIME, Problem #7

Assume that a, b, c, and d are positive integers such that a5 = b4 , c3 = d2 , and c − a = 19. Determine d − b.

1986 AIME, Problem #7

The increasing sequence 1, 3, 4, 9, 10, 12, 13 · · · consists of all those positive integers which are powers of 3 or
sums of distinct powers of 3. Find the 100th term of this sequence.

1987 AIME, Problem #7

Let [r, s] denote the least common multiple of positive integers r and s. Find the number of ordered triples
(a, b, c) of positive integers for which [a, b] = 1000, [b, c] = 2000, and [c, a] = 2000

2000 AIME II, Problem #4

What is the smallest positive integer with six positive odd integer divisors and twelve positive even integer
divisors?

2005 AIME I, Problem #3

How many positive integers have exactly three proper divisors, each of which is less than 50?

2006 AIME II, Problem #3

Let P be the product of the first 100 positive odd integers. Find the largest integer k such that P is divisible
by 3k .

2010 AIME I, Problem #2

Find the remainder when 9 × 99 × 999 × · · · × 99 · · · 9} is divided by 1000.

| {z
999 9’s

64
 Remove Watermark Wondershare
PDFelement

2013 AIME I, Problem #2

Find the number of five-digit positive integers, n, that satisfy the following conditions:
(a) the number n is divisible by 5,
(b) the first and last digits of n are equal, and
(c) the sum of the digits of n is divisible by 5.

2013 AIME II, Problem #2

Positive integers a and b satisfy the condition

log2 (log2a (log2b (21000 ))) = 0.

Find the sum of all possible values of a + b.

1986 AIME, Problem #8

Let S be the sum of the base 10 logarithms of all the proper divisors of 1000000. What is the integer nearest
to S?

1995 AIME, Problem #6

Let n = 231 319 . How many positive integer divisors of n2 are less than n but do not divide n?

2005 AIME II, Problem #4

Find the number of positive integers that are divisors of at least one of 1010 , 157 , 1811 .

2006 AIME I, Problem #4

Let N be the number of consecutive 0’s at the right end of the decimal representation of the product
1! × 2! × 3! × 4! · · · 99! × 100!. Find the remainder when N is divided by 1000.

2007 AIME I, Problem #4

Three planets revolve about a star in coplanar circular orbits with the star at the center. All planets revolve
in the same direction, each at a constant speed, and the periods of their orbits are 60, 84, and 140 years.
The positions of the star and all three planets are currently collinear. They will next be collinear after n
years. Find n.

2010 AIME II, Problem #3

Let K be the product of all factors (b − a) (not necessarily distinct) where a and b are integers satisfying
1 ≤ a < b ≤ 20. Find the greatest positive integer n such that 2n divides K.

65
 Remove Watermark Wondershare
PDFelement

1993 AIME, Problem #9

Two thousand points are given on a circle. Label one of the points 1. From this point, count 2 points in the
clockwise direction and label this point 2. From the point labeled 2, count 3 points in the clockwise direction
and label this point 3. (See figure.) Continue this process until the labels 1, 2, 3, . . . , 1993 are all used. Some
of the points on the circle will have more than one label and some points will not have a label. What is the
smallest integer that labels the same point as 1993?

3 1
2

2006 AIME I, Problem #6

Let S be the set of real numbers that can be represented as repeating decimals of the form 0.abc where a, b, c
are distinct digits. Find the sum of the elements of S.

2008 AIME I, Problem #6

A triangular array of numbers has a first row consisting of the odd integers 1, 3, 5, . . . , 99 in increasing order.
Each row below the first has one fewer entry than the row above it, and the bottom row has a single entry.
Each entry in any row after the top row equals the sum of the two entries diagonally above it in the row
immediately above it. How many entries in the array are multiples of 67?
1 3 5 ··· 97 99

4 8 12 196
···

2011 AIME I, Problem #5

The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits 1 through 9 in such
a way that the sum of the numbers on every three consecutive vertices is a multiple of 3. Two acceptable
arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the
nonagon in the plane. Find the number of distinguishable acceptable arrangements.

2012 AIME I, Problem #5

Let B be the set of all binary integers that can be written using exactly 5 zeros and 8 ones where leading
zeros are allowed. If all possible subtractions are performed in which one element of B is subtracted from
another, find the number of times the answer 1 is obtained.

2004 AIME I, Problem #8

Define a regular n-pointed star to be the union of n line segments P1 P2 , P2 P3 , . . . , Pn P1 such that
• the points P1 , P2 , . . . , Pn are coplanar and no three of them are collinear,

66
 Remove Watermark Wondershare
PDFelement

• each of the n line segments intersects at least one of the other line segments at a point other than an
endpoint,
• all of the angles at P1 , P2 , . . . , Pn are congruent,
• all of the n line segments P2 P3 , . . . , Pn P1 are congruent, and
• the path P1 P2 , P2 P3 , . . . , Pn P1 turns counterclockwise at an angle of less than 180 degrees at each
vertex.
There are no regular 3-pointed, 4-pointed, or 6-pointed stars. All regular 5-pointed stars are similar, but
there are two non-similar regular 7-pointed stars. How many non-similar regular 1000-pointed stars are
there?

2004 AIME II, Problem #8

How many positive integer divisors of 20042004 are divisible by exactly 2004 positive integers?

2009 AIME II, Problem #7

2009
X (2i − 1)!!
Define n!! to be n(n − 2)(n − 4) . . . 3 · 1 for n odd and n(n − 2)(n − 4) . . . 4 · 2 for n even. When
i=1
(2i)!!
a ab
is expressed as a fraction in lowest terms, its denominator is 2 b with b odd. Find .
10

1995 AIME, Problem #10

What is the largest positive integer that is not the sum of a positive integral multiple of 42 and a positive
composite integer?

2012 AIME II, Problem #7

Let S be the increasing sequence of positive integers whose binary representation has exactly 8 ones. Let N
be the 1000th number in S. Find the remainder when N is divided by 1000.

1984 AIME, Problem #14

What is the largest even integer that cannot be written as the sum of two odd composite numbers?

2004 AIME II, Problem #10

Let S be the set of integers between 1 and 240 whose binary expansions have exactly two 1’s. If a number is
chosen at random from S, the probability that it is divisible by 9 is p/q, where p and q are relatively prime
positive integers. Find p + q.

1990 AIME, Problem #13

Let T = {9k : k is an integer, 0 ≤ k ≤ 4000}. Given that 94000 has 3817 digits and that its first (leftmost)
digit is 9, how many elements of T have 9 as their leftmost digit?

67
 Remove Watermark Wondershare
PDFelement

2000 AIME I, Problem #11

Let S be the sum of all numbers of the form a/b, where a and b are relatively prime positive divisors of 1000.
What is the greatest integer that does not exceed S/10?

2001 AIME I, Problem #11

In a rectangular array of points, with 5 rows and N columns, the points are numbered consecutively from
left to right beginning with the top row. Thus the top row is numbered 1 through N, the second row is
numbered N + 1 through 2N, and so forth. Five points, P1 , P2 , P3 , P4 , and P5 , are selected so that each Pi
is in row i. Let xi be the number associated with Pi . Now renumber the array consecutively from top to
bottom, beginning with the first column. Let yi be the number associated with Pi after the renumbering. It
is found that x1 = y2 , x2 = y1 , x3 = y4 , x4 = y5 , and x5 = y3 . Find the smallest possible value of N.

1992 AIME, Problem #15

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

1996 AIME, Problem #14

A 150 × 324 × 375 rectangular solid is made by gluing together 1 × 1 × 1 cubes. An internal diagonal of this
solid passes through the interiors of how many of the 1 × 1 × 1 cubes?

2003 AIME I, Problem #13

Let N be the number of positive integers that are less than or equal to 2003 and whose base-2 representation
has more 1’s than 0’s. Find the remainder when N is divided by 1000.

2005 AIME I, Problem #12

For positive integers n, let τ (n) denote the number of positive integer divisors of n, including 1 and n. For
example, τ (1) = 1 and τ (6) = 4. Define S(n) by S(n) = τ (1) + τ (2) + ... + τ (n). Let a denote the number
of positive integers n ≤ 2005 with S(n) odd, and let b denote the number of positive integers n ≤ 2005 with
S(n) even. Find |a − b|.

2011 AIME I, Problem #11

Let R be the set of all possible remainders when a number of the form 2n , n a nonnegative integer, is divided
by 1000. Let S be the sum of all elements in R. Find the remainder when S is divided by 1000.

68
 Remove Watermark Wondershare
PDFelement

2013 AIME I, Problem #11

Ms. Math’s kindergarten class has 16 registered students. The classroom has a very large number, N , of
play blocks which satisfies the conditions:
(a) If 16, 15, or 14 students are present, then in each case all the blocks can be distributed in equal numbers
to each student, and
(b) There are three integers 0 < x < y < z < 14 such that when x, y, or z students are present and the
blocks are distributed in equal numbers to each student, there are exactly three blocks left over.
Find the sum of the distinct prime divisors of the least possible value of N satisfying the above conditions.

2000 AIME II, Problem #14

Every positive integer k has a unique factorial base expansion (f1 , f2 , f3 , . . . , fm ), meaning that

k = 1! · f1 + 2! · f2 + 3! · f3 + · · · + m! · fm ,

where each fi is an integer, 0 ≤ fi ≤ i, and 0 < fm . Given that (f1 , f2 , f3 , . . . , fj ) is the factorial base
expansion of 16!−32!+48!−64!+· · ·+1968!−1984!+2000!, find the value of f1 −f2 +f3 −f4 +· · ·+(−1)j+1 fj .

2002 AIME I, Problem #14

A set S of distinct positive integers has the following property: for every integer x in S, the arithmetic mean
of the set of values obtained by deleting x from S is an integer. Given that 1 belongs to S and that 2002 is
the largest element of S, what is the greatest number of elements that S can have?

2004 AIME II, Problem #14

Consider a string of n 7’s, 7777 · · · 77, into which + signs are inserted to produce an arithmetic expression.
For example, 7 + 77 + 777 + 7 + 7 = 875 could be obtained from eight 7’s in this way. For how many values
of n is it possible to insert + signs so that the resulting expression has value 7000?

2006 AIME II, Problem #13

How many integers N less than 1000 can be written as the sum of j consecutive positive odd integers from
exactly 5 values of j ≥ 1?

2004 AIME I, Problem #15

For all positive integers x, let 

1
 if x = 1
x
f (x) = if x is divisible by 10
 10
x+1 otherwise


and define a sequence as follows: x1 = x and xn+1 = f (xn ) for all positive integers n. Let d(x) be the
smallest n such that xn = 1. (For example, d(100) = 3 and d(87) = 7.) Let m be the number of positive
integers x such that d(x) = 20. Find the sum of the distinct prime factors of m.

69
 Remove Watermark Wondershare
PDFelement

2006 AIME II, Problem #14

Let Sn be the sum of the reciprocals of the non-zero digits of the integers from 1 to 10n inclusive. Find the
smallest positive integer n for which Sn is an integer.

2011 AIME II, Problem #14

There are N permutations (a1 , a2 , . . . , a30 ) of 1, 2, . . . , 30 such that for m ∈ {2, 3, 5}, m divides an+m − an
for all integers n with 1 ≤ n < n + m ≤ 30. Find the remainder when N is divided by 1000.

70
 Remove Watermark Wondershare
PDFelement

8 Algebraic Methods in Number Theory

1994 AIME, Problem #1

The increasing sequence 3, 15, 24, 48, . . . consists of those positive multiples of 3 that are one less than a
perfect square. What is the remainder when the 1994th term of the sequence is divided by 1000?

1985 AIME, Problem #3

Find c if a, b, and c are positive integers which satisfy c = (a + bi)3 − 107i, where i2 = −1.

1989 AIME, Problem #3

Suppose n is a positive integer and d is a single digit in base 10. Find n if

n
= 0.d25d25d25 . . .
810

1997 AIME, Problem #1

How many of the integers between 1 and 1000, inclusive, can be expressed as the difference of the squares of
two nonnegative integers?

1990 AIME, Problem #3

59
Let P1 be a regular r-gon and P2 be a regular s-gon (r ≥ s ≥ 3) such that each interior angle of P1 is 58 as
large as each interior angle of P2 . What’s the largest possible value of s?

2003 AIME II, Problem #1

The product N of three positive integers is 6 times their sum, and one of the integers is the sum of the other
two. Find the sum of all possible values of N.

1987 AIME, Problem #5

Find 3x2 y 2 if x and y are integers such that y 2 + 3x2 y 2 = 30x2 + 517.

1997 AIME, Problem #3

Sarah intended to multiply a two-digit number and a three-digit number, but she left out the multiplication
sign and simply placed the two-digit number to the left of the three-digit number, thereby forming a five-digit
number. This number is exactly nine times the product Sarah should have obtained. What is the sum of
the two-digit number and the three-digit number?

71
 Remove Watermark Wondershare
PDFelement

1999 AIME, Problem #3

Find the sum of all positive integers n for which n2 − 19n + 99 is a perfect square.

2000 AIME II, Problem #2

A point whose coordinates are both integers is called a lattice point. How many lattice points lie on the
hyperbola x2 − y 2 = 20002 .

1994 AIME, Problem #5

Given a positive integer n, let p(n) be the product of the non-zero digits of n. (If n has only one digits, then
p(n) is equal to that digit.) Let

S = p(1) + p(2) + p(3) + · · · + p(999).

What is the largest prime factor of S?

2002 AIME I, Problem #3

Jane is 25 years old. Dick is older than Jane. In n years, where n is a positive integer, Dick’s age and Jane’s
age will both be two-digit number and will have the property that Jane’s age is obtained by interchanging
the digits of Dick’s age. Let d be Dick’s present age. How many ordered pairs of positive integers (d, n) are
possible?

2004 AIME II, Problem #3

A solid rectangular block is formed by gluing together N congruent 1-cm cubes face to face. When the
block is viewed so that three of its faces are visible, exactly 231 of the 1-cm cubes cannot be seen. Find the
smallest possible value of N .

2007 AIME II, Problem #2

Find the number of ordered triple (a, b, c) where a, b, and c are positive integers, a is a factor of b, a is a
factor of c, and a + b + c = 100.

2012 AIME II, Problem #1

Find the number of ordered pairs of positive integer solutions (m, n) to the equation 20m + 12n = 2012.

1993 AIME, Problem #6

What is the smallest positive integer than can be expressed as the sum of nine consecutive integers, the sum
of ten consecutive integers, and the sum of eleven consecutive integers?

72
 Remove Watermark Wondershare
PDFelement

2006 AIME I, Problem #3

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

1987 AIME, Problem #8

8 n 7
What is the largest positive integer n for which there is a unique integer k such that 15 < n+k < 13 ?

1994 AIME, Problem #7

For certain ordered pairs (a, b) of real numbers, the system of equations

ax + by = 1
x2 + y 2 = 50

has at least one solution, and each solution is an ordered pair (x, y) of integers. How many such ordered
pairs (a, b) are there?

1997 AIME, Problem #6

Point B is in the exterior of the regular n-sided polygon A1 A2 · · · An , and A1 A2 B is an equilateral triangle.
What is the largest value of n for which An , A1 , and B are consecutive vertices of a regular polygon?

2002 AIME II, Problem #5

Find the sum of all positive integers a = 2n 3m , where n and m are non-negative integers, for which a6 is not
a divisor of 6a .

2005 AIME I, Problem #4

The director of a marching band wishes to place the members into a formation that includes all of them and
has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The
director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no
members left over. Find the maximum number of members this band can have.

2008 AIME I, Problem #4

There exist unique positive integers x and y that satisfy the equation x2 + 84x + 2008 = y 2 . Find x + y.

2008 AIME II, Problem #4

There exist r unique nonnegative integers n1 > n2 > · · · > nr and r unique integers ak (1 ≤ k ≤ r) with
each ak either 1 or −1 such that

a1 3n1 + a2 3n2 + · · · + ar 3nr = 2008.

Find n1 + n2 + · · · + nr .

73
 Remove Watermark Wondershare
PDFelement

2014 AIME I, Problem #3

Find the number of rational numbers r, 0 < r < 1, such that when r is written as a fraction in lowest terms,
the numerator and denominator have a sum of 1000.

1988 AIME, Problem #9

Find the smallest positive integer whose cube ends in 888.

1989 AIME, Problem #9

One of Euler’s conjectures was disproved in then 1960s by three American mathematicians when they showed
there was a positive integer n such that 1335 + 1105 + 845 + 275 = n5 . Find the value of n.

1991 AIME, Problem #8

For how many real numbers a does the quadratic equation x2 + ax + 6a = 0 have only integer roots for x?

1999 AIME, Problem #7

There is a set of 1000 switches, each of which has four positions, called A, B, C, and D. When the position of
any switch changes, it is only from A to B, from B to C, from C to D, or from D to A. Initially each switch
is in position A. The switches are labeled with the 1000 different integers 2x 3y 5z , where x, y, and z take on
the values 0, 1, . . . , 9. At step i of a 1000-step process, the ith switch is advanced one step, and so are all
the other switches whose labels divide the label on the ith switch. After step 1000 has been completed, how
many switches will be in position A?

2000 AIME I, Problem #6

For how many ordered pairs (x, y) of integers is it true that 0 < x < y < 106 and that the arithmetic mean
of x and y is exactly 2 more than the geometric mean of x and y?

2007 AIME I, Problem #5

The formula for converting a Fahrenheit temperature F to the corresponding Celsius temperature C is
C = 59 (F − 32). An integer Fahrenheit temperature is converted to Celsius and rounded to the nearest
integer; the resulting integer Celsius temperature is converted back to Fahrenheit and rounded to the nearest
integer. For how many integer Fahrenheit temperatures T with 32 ≤ T ≤ 1000 does the original temperature
equal the final temperature?

2014 AIME II, Problem #4

The repeating decimals 0.ababab and 0.abcabcabc satisfy

33
0.ababab + 0.abcabcabc = ,
37
where a, b, and c are (not necessarily distinct) digits. Find the three-digit number abc.

74
 Remove Watermark Wondershare
PDFelement

1986 AIME, Problem #10

In a parlor game, the magician asks one of the participants to think of a three digit number (abc) where
a, b, and c represent digits in base 10 in the order indicated. The magician then asks this person to form
the numbers (acb), (bca), (bac), (cab), and (cba), to add these five numbers, and to reveal their sum, N . If
told the value of N , the magician can identify the original number, (abc). Play the role of the magician and
determine the (abc) if N = 3194.

1995 AIME, Problem #8

x x+1
For how many ordered pairs of positive integers (x, y), with y < x ≤ 100, are both y and y+1 integers?

1996 AIME, Problem #8

The harmonic mean of two positive numbers is the reciprocal of the arithmetic mean of their reciprocals.
For how many ordered pairs of positive integers (x, y) with x < y is the harmonic mean of x and y equal to
620 .

2002 AIME II, Problem #7

It is known that, for all positive integers k,

k(k + 1)(2k + 1)
12 + 2 2 + 3 2 + · · · + k 2 = .
6
Find the smallest positive integer k such that 12 + 22 + 32 + · · · + k 2 is a multiple of 200.

1987 AIME, Problem #11

Find the largest possible value of k for which 311 is expressible as the sum of k consecutive positive integers.

2001 AIME I, Problem #8

Call a positive integer N a 7-10 double if the digits of the base-7 representation of N form a base-10 number
that is twice N. For example, 51 is a 7-10 double because its base-7 representation is 102. What is the largest
7-10 double?

2003 AIME I, Problem #8

In an increasing sequence of four positive integers, the first three terms form an arithmetic progression, the
last three terms form a geometric progression, and the first and fourth terms differ by 30. Find the sum of
the four terms.

75
 Remove Watermark Wondershare
PDFelement

2007 AIME II, Problem #7

Given a real number x, let bxc denote the greatest integer less than or equal to x. For a certain integer k,
√ √ √
there are exactly 70 positive integers n1 , n2 , . . . , n70 such that k = b 3 n1 c = b 3 n1 c = · · · = b 3 n70 c and k
divides ni for all i such that 1 ≤ i ≤ 70.
ni
Find the maximum value of k for 1 ≤ i ≤ 70.

2010 AIME II, Problem #6

Find the smallest positive integer n with the property that the polynomial x4 − nx + 63 can be written as a
product of two nonconstant polynomials with integer coefficients.

2011 AIME I, Problem #7

Find the number of positive integers m for which there exist nonnegative integers x0 , x1 , . . . , x2011 such that
2011
X
mx0 = mxk .
k=1

1985 AIME, Problem #13

The numbers in the sequence 101, 104, 109, 116, . . . are of the form an = 100 + n2 , where n = 1, 2, 3, . . . .
For each n, let dn be the greatest common divisor of an and an+1 . Find the maximum value of dn as n
ranges through the positive integers.

1989 AIME, Problem #13

Let S be a subset of {1, 2, 3, . . . , 1989} such that no two members of S differ by 4 or 7. What is the largest
number of elements S can have?

2001 AIME II, Problem #10

How many positive integer multiples of 1001 can be expressed in the form 10j − 10i , where i and j are
integers and 0 ≤ i < j ≤ 99?

2003 AIME II, Problem #10

Two positive integers differ by 60. The sum of their square roots is the square root of an integer that is not
a perfect square. What is the maximum possible sum of the two integers?

2006 AIME I, Problem #9

The sequence a1 , a2 , . . . is geometric with a1 = a and common ratio r, where a and r are positive integers.
Given that log8 a1 + log8 a2 + · · · + log8 a12 = 2006, find the number of possible ordered pairs (a, r).

76
 Remove Watermark Wondershare
PDFelement

2009 AIME II, Problem #9

Let m be the number of solutions in positive integers to the equation 4x + 3y + 2z = 2009, and let n be
the number of solutions in positive integers to the equation 4x + 3y + 2z = 2000. Find the remainder when
m − n is divided by 1000.

2014 AIME I, Problem #8

The positive integers N and N 2 both end in the same sequence of four digits abcd when written in base 10,
where digit a is not zero. Find the three-digit number abc.

1989 AIME, Problem #14

Given a positive integer n, it can be shown that every complex number of the form r + si, where r and s are
integers, can be uniquely expressed in the base −n + i using the integers 1, 2, . . . , n2 as digits. That is, the
equation
r + si = am (−n + i)m + am−1 (−n + i)m−1 + · · · + a1 (−n + i) + a0
is true for a unique choice of non-negative integer m and digits a0 , a1 , . . . , am chosen from the set {0, 1, 2, . . . , n2 },
with am 6= 0. We write
r + si = (am am−1 . . . a1 a0 )−n+i
to denote the base −n+i expansion of r +si. There are only finitely many integers k +0i that have four-digit
expansions
k = (a3 a2 a1 a0 )−3+i a3 6= 0.
Find the sum of all such k.

2010 AIME II, Problem #10

Find the number of second-degree polynomials f (x) with integer coefficients and integer zeros for which
f (0) = 2010.

2012 AIME I, Problem #10

Let S be the set of all perfect squares whose rightmost three digits in base 10 are 256. Let T be the set of
all numbers of the form x−256
1000 , where x is in S. In other words, T is the set of numbers that result when the
last three digits of each number in S are truncated. Find the remainder when the tenth smallest element of
T is divided by 1000.

1991 AIME, Problem #15

For positive integer n, define Sn to be the minimum value of the sum

n q
X
(2k − 1)2 + a2k ,
k=1

where a1 , a2 , . . . , an are positive real numbers whose sum is 17. There is a unique positive integer n for which
Sn is also an integer. Find this n.

77
 Remove Watermark Wondershare
PDFelement

2006 AIME I, Problem #13

For each even positive integer x, let g(x) denote the greatest power of 2 that divides x. For example,
P2n−1
g(20) = 4 and g(16) = 16. For each positive integer n, let Sn = k=1 g(2k). Find the greatest integer n
less than 1000 such that Sn is a perfect square.

2007 AIME II, Problem #13

A triangular array of squares has one square in the first row, two in the second, and in general, k squares
in the kth row for 1 ≤ k ≤ 11. With the exception of the bottom row, each square rests on two squares in
the row immediately below (illustrated in given diagram). In each square of the eleventh row, a 0 or a 1 is
placed. Numbers are then placed into the other squares, with the entry for each square being the sum of
the entries in the two squares below it. For how many initial distributions of 0’s and 1’s in the bottom row
is the number in the top square a multiple of 3?

2012 AIME II, Problem #12

For a positive integer p, define the positive integer n to be p-safe if n differs in absolute value by more than
2 from all multiples of p. For example, the set of 10-safe numbers is 3, 4, 5, 6, 7, 13, 14, 15, 16, 17, 23, .... Find
the number of positive integers less than or equal to 10, 000 which are simultaneously 7-safe, 11-safe, and
13-safe.?

2006 AIME I, Problem #15

Given that a sequence satisfies x0 = 0 and |xk | = |xk−1 + 3| for all integers k ≥ 1, find the minimum possible
value of |x1 + x2 + · · · + x2006 |.

2008 AIME II, Problem #15

Find the largest integer n satisfying the following conditions:

(i) n2 can be expressed as the difference of two consecutive cubes;
(ii) 2n + 79 is a perfect square.

2011 AIME I, Problem #15

For some integer m, the polynomial x3 −2011x+m has the three integer roots a, b, and c. Find |a|+|b|+|c|.

78
 Remove Watermark Wondershare
PDFelement

2012 AIME I, Problem #15

There are n mathematicians seated around a circular table with n seats numbered 1, 2, 3, · · · , n in clockwise
order. After a break they again sit around the table. The mathematicians note that there is a positive
integer a such that
(1) for each k, the mathematician who was seated in seat k before the break is seated in seat ka after the
break (where seat i + n is seat i);
(2) for every pair of mathematicians, the number of mathematicians sitting between them after the break,
counting in both the clockwise and the counterclockwise directions, is different from either of the
number of mathematicians sitting between them before the break.
Find the number of possible values of n with 1 < n < 1000.

2013 AIME I, Problem #15

Let N be the number of ordered triples (A, B, C) of integers satisfying the conditions
(a) 0 ≤ A < B < C ≤ 99,
(b) there exist integers a, b, and c, and prime p where 0 ≤ b < a < c < p,
(c) p divides A − a, B − b, and C − c, and
(d) each ordered triple (A, B, C) and each ordered triple (b, a, c) form arithmetic sequences.
Find N .

2014 AIME II, Problem #15

For any integer k ≥ 1, let p(k) be the smallest prime which does not divide k. Define the integer function
X(k) to be the product of all primes less than p(k) if p(k) > 2, and X(k) = 1 if p(k) = 2. Let {xn } be the
sequence defined by x0 = 1, and xn+1 X(xn ) = xn p(xn ) for n ≥ 0. Find the smallest positive integer, t such
that xt = 2090.

79