USA

USAMTS
2011

Round 1

1 The grid on the right has 12 boxes and 15 edges connecting boxes. In each box, place one of
the six integers from 1 to 6 such that the following conditions hold:
For each possible pair of distinct numbers from 1 to 6, there is exactly one edge connecting
two boxes with that pair of numbers. [/*:m]If an edge has an arrow, then it points from a
box with a smaller number to a box with a larger number.[/*:m]
You do not need to prove that your con
guration is the only one possible; you merely need to fi
nd a con
guration that satis
es the constraints above. (Note: In any other USAMTS problem, you need to provide a full
proof. Only in this problem is an answer without justi
cation acceptable.)

2 Find all integers a, b, c, d, and e such that

a2 = a + b − 2c + 2d + e − 8,
b2 = −a − 2b − c + 2d + 2e − 6,
c2 = 3a + 2b + c + 2d + 2e − 31,
d2 = 2a + b + c + 2d + 2e − 2,
e2 = a + 2b + 3c + 2d + e − 8.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 1
http://www.artofproblemsolving.com/
 USA
USAMTS
2011

3 You have 14 coins, dated 1901 through 1914. Seven of these coins are real and weigh 1.000
ounce each. The other seven are counterfeit and weigh 0.999 ounces each. You do not know
which coins are real or counterfeit. You also cannot tell which coins are real by look or feel.
Fortunately for you, Zoltar the Fortune-Weighing Robot is capable of making very precise
measurements. You may place any number of coins in each of Zoltar’s two hands and Zoltar
will do the following:
If the weights in each hand are equal, Zoltar tells you so and returns all of the coins.[/*:m]
If the weight in one hand is heavier than the weight in the other, then Zoltar takes one coin,
at random, from the heavier hand as tribute. Then Zoltar tells you which hand was heavier,
and returns the remaining coins to you.[/*:m]
Your objective is to identify a single real coin that Zoltar has not taken as tribute. Is there
a strategy that guarantees this? If so, then describe the strategy and why it works. If not,
then prove that no such strategy exists.

4 Let ABCDEF and ABC 0 D0 E 0 F 0 be regular planar hexagons in three-dimensional space with
side length 1, such that ∠EAE 0 = 60◦ . Let P be the convex polyhedron whose vertices are
A, B, C, C 0 , D, D0 , E, E 0 , F , and F 0 .
(a) Find the radius r of the largest sphere that can be enclosed in polyhedron P .
(b) Let S be a sphere enclosed in polyhedron P with radius r (as derived in part (a)). The
set of possible centers of S is a line segment XY . Find the length XY .

5 In the game of Tristack Solitaire, you start with three stacks of cards, each with a dierent
positive integer number of cards. At any time, you can double the number of cards in any
one stack of cards by moving cards from exactly one other, larger, stack of cards to the stack
you double. You win the game when any two of the three stacks have the same number of
cards.
For example, if you start with stacks of 3, 5, and 7 cards, then you have three possible legal
moves:
You may move 3 cards from the 5-card stack to the 3-card stack, leaving stacks of 6, 2, and 7
cards.[/*:m] You may move 3 cards from the 7-card stack to the 3-card stack, leaving stacks
of 6, 5, and 4 cards.[/*:m] You may move 5 cards from the 7-card stack to the 5-card stack,
leaving stacks of 3, 10, and 2 cards.[/*:m]
Can you win Tristack Solitaire from any starting position? If so, then give a strategy for
winning. If not, then explain why.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 2
http://www.artofproblemsolving.com/
 USA
USAMTS
2011

Round 2

1 Find all the ways of placing the integers 1, 2, 3, · · · , 16 in the boxes below, such that each
integer appears in exactly one box, and the sum of every pair of neighboring integers is a
perfect square.

2 Four siblings are sitting down to eat some mashed potatoes for lunch: Ethan has 1 ounce of
mashed potatoes, Macey has 2 ounces, Liana has 4 ounces, and Samuel has 8 ounces. This is
not fair. A blend consists of choosing any two children at random, combining their plates of
mashed potatoes, and then giving each of those two children half of the combination. After
the children’s father performs four blends consecutively, what is the probability that the four
children will all have the same amount of mashed potatoes?
3 Find all integers b such that there exists a positive real number x with
1 1 1
= +
b b2xc b5xc
Here, byc denotes the greatest integer that is less than or equal to y.
4 A luns with vertices X and Y is a region bounded by two circular arcs meeting
√ at the endpoints
√
X and Y . Let A, B, and V be points such that ∠AV B = 75◦ , AV = 2 and BV = 3. Let
L be the largest area luns with vertices A and B that does not intersect the lines V A or V B
in any points other than A and B. Define k as the area of L. Find the value
k
√ .
(1 + 3)2

5 Miss Levans has 169 students in her history class and wants to seat them all in a 13 × 13 grid
of desks. Each desk is placed at a different vertex of a 12 meter by 12 meter square grid of
points she has marked on the floor. The distance between neighboring vertices is exactly 1
meter. Each student has at most three best friends in the class. Best-friendship is mutual: if
Lisa is one of Shannon’s best friends, then Shannon is also one of Lisa’s best friends. Miss
Levans knows that if any two best friends sit at points that are 3 meters or less from each
other then they will be disruptive and nobody will learn any history. And that is bad. Prove
that Miss Levans can indeed place all 169 students in her class without any such disruptive
pairs.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 3
http://www.artofproblemsolving.com/
 USA
USAMTS
2011

Round 3

1 Fill in the circles to the right with the numbers 1 through 16 so that each number is used
once (the number 1 has been fi
lled in already). The number in any non-circular region is equal to the greatest difference
between any two numbers in the circles on that region’s vertices. You do not need to prove
that your con
guration is the only one possible; you merely need to
find a valid con
guration. (Note: In any other USAMTS problem, you need to provide a full proof. Only in
this problem is an answer without justi
cation acceptable.)

1
8 2
11
7

2
10
2

4
4
8 5

2 Let x be a complex number such that x2011 = 1 and x 6= 1. Compute the sum

x2 x4 x6 x4020
+ 2 + 3 + · · · + 2010 .
x−1 x −1 x −1 x −1

This file was downloaded from the AoPS Math Olympiad Resources Page Page 4
http://www.artofproblemsolving.com/
 USA
USAMTS
2011

3 In the diagram below, how many distinct paths are there from January 1 to December 31,
moving from one adjacent dot to the next either to the right, down, or diagonally down to
the right?

Jan. 1→ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗

∗ ∗ ∗ ∗ ∗ ∗ ∗

∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗

∗ ∗ ∗ ∗ ∗

∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ←Dec. 31

There are 4049785 latex formulas cached as of less than a minute ago There are 65100 asymp-
tote images cached as of less than a minute ago

4 Renata the robot packs boxes in a warehouse. Each box is a cube of side length 1 foot. The
warehouse floor is a square, 12 feet on each side, and is divided into a 12-by-12 grid of square
tiles 1 foot on a side. Each tile can either support one box or be empty. The warehouse has
exactly one door, which opens onto one of the corner tiles. Renata fits on a tile and can roll
between tiles that share a side. To access a box, Renata must be able to roll along a path of
empty tiles starting at the door and ending at a tile sharing a side with that box.
Show how Renata can pack 91 boxes into the warehouse and still be able to access any box.
[/*:m] Show that Renata cannot pack 95 boxes into the warehouse and still be able to access
any box.[/*:m]

5 Let k > 2 be a positive integer. Elise and Xavier play a game that has four steps, in this
order.
Elise picks 2 nonzero digits (1 − 9), called e and f . [/*:m] Xavier then picks k nonzero digits
(1 − 9), called x1 , · · · , xk . [/*:m] Elise picks any positive integer d. [/*:m] Xaiver picks an
integer b > 10.[/*:m]
Each player’s choices are known to the other player when the choices are made.
The winner is determined as follows. Elise writes down the two-digit base b number efb .
Next, Xavier writes the k-digit base b number that is constructed by concatenating his digits,

(x1 · · · xk )b .

This file was downloaded from the AoPS Math Olympiad Resources Page Page 5
http://www.artofproblemsolving.com/
 USA
USAMTS
2011

They then compute the greatest common divisor (gcd) of these two numbers. If this gcd is
greater than or equal to the integer d then Xavier wins. Otherwise Elise wins.
(As an example game for k = 3, Elise chooses the digits (e, f ) = (2, 4), Xavier chooses (4, 4, 8),
and then Elise picks d = 100. Xavier picks base b = 25. The base-25 numbers 2425 and 44825
are, respectively, equal to 54 and 2608. The greatest common divisor of these two is 2, which
is much less than 100, so Elise wins handily.)
Find all k for which Xavier can force a win, no matter how Elise plays.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 6
http://www.artofproblemsolving.com/