USAMO

2017 USAMO
USAMO 2017
Day 1 April 19th
1 Prove that there are infinitely many distinct pairs (a, b) of relatively prime
integers a > 1 and b > 1 such that ab + ba is divisible by a + b.
2 Let m1 , m2 , . . . , mn be a collection of n positive integers, not necessarily dis-

tinct. For any sequence of integers A = (a1 , . . . , an ) and any permutation
w = w1 , . . . , wn of m1 , . . . , mn , define an [i]A-inversion[/i] of w to be a pair of
entries wi , wj with i < j for which one of the following conditions holds:
-ai ≥ wi > wj
-wj > ai ≥ wi , or
-wi > wj > ai .
Show that, for any two sequences of integers A = (a1 , . . . , an ) and B = (b1 , . . . , bn ),
and for any positive integer k, the number of permutations of m1 , . . . , mn hav-
ing exactly k A-inversions is equal to the number of permutations of m1 , . . . , mn
having exactly k B-inversions.
3 Let ABC be a scalene triangle with circumcircle Ω and incenter I. Ray AI

meets BC at D and meets Ω again at M ; the circle with diameter DM cuts Ω
again at K. Lines M K and BC meet at S, and N is the midpoint of IS. The
circumcircles of △KID and △M AN intersect at points L1 and L2 . Prove that
Ω passes through the midpoint of either IL1 or IL2 .
Proposed by Evan Chen
Day 2 April 20th
4 Let P1 , P2 , . . . , P2n be 2n distinct points on the unit circle x2 + y 2 = 1, other

than (1, 0). Each point is colored either red or blue, with exactly n red points
and n blue points. Let R1 , R2 , . . . , Rn be any ordering of the red points.
Let B1 be the nearest blue point to R1 traveling counterclockwise around the
circle starting from R1 . Then let B2 be the nearest of the remaining blue
points to R2 travelling counterclockwise around the circle from R2 , and so on,
until we have labeled all of the blue points B1 , . . . , Bn . Show that the number
of counterclockwise arcs of the form Ri → Bi that contain the point (1, 0) is
independent of the way we chose the ordering R1 , . . . , Rn of the red points.
www.artofproblemsolving.com/community/c439884
Contributors: CantonMathGuy, skipiano, jeff10, DrMath, v Enhance, lucasxia01,
jasonhu4, rrusczyk
2017 USAMO
5 Let Z denote the set of all integers. Find all real numbers c > 0 such that
there exists a labeling of the lattice points (x, y) ∈ Z2 with positive integers for
which:
- only finitely many distinct labels occur, and
- for each label i, the distance between any two points labeled i is at least ci .
6 Find the minimum possible value of

a b c d
+ + +
b3 + 4 c 3 + 4 d 3 + 4 a 3 + 4
given that a, b, c, d are nonnegative real numbers such that a + b + c + d = 4.
–
These problems are copyright c Mathematical Association of America (http:
//maa.org).
Contributors: CantonMathGuy, skipiano, jeff10, DrMath, v Enhance, lucasxia01,
jasonhu4, rrusczyk
2016 USAMO
USAMO 2016
Day 1 April 19th
1 Let X1 , X2 , . . . , X100 be a sequence of mutually distinct nonempty subsets of a

set S. Any two sets Xi and Xi+1 are disjoint and their union is not the whole
set S, that is, Xi ∩ Xi+1 = ∅ and Xi ∪ Xi+1 6= S, for all i ∈ {1, . . . , 99}. Find
the smallest possible number of elements in S.
2 Prove that for any positive integer k,
Y
k−1
j!
(k 2 )! ·
(j + k)!
j=0
is an integer.
3 Let △ABC be an acute triangle, and let IB , IC , and O denote its B-excenter,
C-excenter, and circumcenter, respectively. Points E and Y are selected on
AC such that ∠ABY = ∠CBY and BE ⊥ AC. Similarly, points F and Z are
selected on AB such that ∠ACZ = ∠BCZ and CF ⊥ AB.
←−→ ←−→
Lines IB F and IC E meet at P . Prove that P O and Y Z are perpendicular.
Proposed by Evan Chen and Telv Cohl
Day 2 April 20th
4 Find all functions f : R → R such that for all real numbers x and y,
(f (x) + xy) · f (x − 3y) + (f (y) + xy) · f (3x − y) = (f (x + y))2 .
5 An equilateral pentagon AM N P Q is inscribed in triangle ABC such that M ∈

←−→ ←→
AB, Q ∈ AC, and N, P ∈ BC. Let S be the intersection of M N and P Q.
Denote by ℓ the angle bisector of ∠M SQ.
Prove that OI is parallel to ℓ, where O is the circumcenter of triangle ABC,
and I is the incenter of triangle ABC.
6 Integers n and k are given, with n ≥ k ≥ 2. You play the following game
against an evil wizard.
Contributors: adihaya, tenniskidperson3, EulerMacaroni, El Ectric, rrusczyk
2016 USAMO
The wizard has 2n cards; for each i = 1, . . . , n, there are two cards labeled i.
Initially, the wizard places all cards face down in a row, in unknown order.
You may repeatedly make moves of the following form: you point to any k of
the cards. The wizard then turns those cards face up. If any two of the cards
match, the game is over and you win. Otherwise, you must look away, while
the wizard arbitrarily permutes the k chosen cards and then turns them back
face-down. Then, it is your turn again.
We say this game is winnable if there exist some positive integer m and some
strategy that is guaranteed to win in at most m moves, no matter how the
wizard responds.
For which values of n and k is the game winnable?
–
//maa.org).
Contributors: adihaya, tenniskidperson3, EulerMacaroni, El Ectric, rrusczyk
2015 USAMO
USAMO 2015
Day 1
1 Solve in integers the equation

3
2 2 x+y
x + xy + y = +1 .
3
2 Quadrilateral AP BQ is inscribed in circle ω with ∠P = ∠Q = 90◦ and AP =

AQ < BP . Let X be a variable point on segment P Q. Line AX meets ω
again at S (other than A). Point T lies on arc AQB of ω such that XT is
perpendicular to AX. Let M denote the midpoint of chord ST . As X varies
on segment P Q, show that M moves along a circle.
3 Let S = {1, 2, . . . , n}, where n ≥ 1. Each of the 2n subsets of S is to be

colored red or blue. (The subset itself is assigned a color and not its individual
elements.) For any set T ⊆ S, we then write f (T ) for the number of subsets of
T that are blue.
Determine the number of colorings that satisfy the following condition: for any
subsets T1 and T2 of S,
f (T1 )f (T2 ) = f (T1 ∪ T2 )f (T1 ∩ T2 ).
Day 2 [b]
4 Steve is piling m ≥ 1 indistinguishable stones on the squares of an n × n grid.

Each square can have an arbitrarily high pile of stones. After he finished piling
his stones in some manner, he can then perform stone moves, defined as follows.
Consider any four grid squares, which are corners of a rectangle, i.e. in positions
(i, k), (i, l), (j, k), (j, l) for some 1 ≤ i, j, k, l ≤ n, such that i < j and k < l. A
stone move consists of either removing one stone from each of (i, k) and (j, l)
and moving them to (i, l) and (j, k) respectively,j or removing one stone from
each of (i, l) and (j, k) and moving them to (i, k) and (j, l) respectively.
Two ways of piling the stones are equivalent if they can be obtained from one
another by a sequence of stone moves.
How many different non-equivalent ways can Steve pile the stones on the grid?
Contributors: TheMaskedMagician, v Enhance, djmathman, tenniskidperson3, rrusczyk
2015 USAMO
5 Let a, b, c, d, e be distinct positive integers such that a4 + b4 = c4 + d4 = e5 .

Show that ac + bd is a composite number.
6 Consider 0 < λ < 1, and let A be a multiset of positive integers. Let An =

{a ∈ A : a ≤ n}. Assume that for every n ∈ N, the set An contains at most
nλ numbers. Show that there are infinitely many n ∈ N for which the sum
of the elements in An is at most n(n+1) 2 λ. (A multiset is a set-like collection
of elements in which order is ignored, but repetition of elements is allowed
and multiplicity of elements is significant. For example, multisets {1, 2, 3} and
{2, 1, 3} are equivalent, but {1, 1, 2, 3} and {1, 2, 3} differ.)
–
//maa.org).
Contributors: TheMaskedMagician, v Enhance, djmathman, tenniskidperson3, rrusczyk
2014 USAMO
USAMO 2014
Day 1 April 29th
1 Let a, b, c, d be real numbers such that b − d ≥ 5 and all zeros x1 , x2 , x3 , and

x4 of the polynomial P (x) = x4 + ax3 + bx2 + cx + d are real. Find the smallest
value the product (x21 + 1)(x22 + 1)(x23 + 1)(x24 + 1) can take.
2 Let Z be the set of integers. Find all functions f : Z → Z such that

f (x)2
xf (2f (y) − x) + y 2 f (2x − f (y)) = + f (yf (y))
x
for all x, y ∈ Z with x 6= 0.
3 Prove that there exists an infinite set of points
. . . , P−3 , P−2 , P−1 , P0 , P1 , P2 , P3 , . . .
in the plane with the following property: For any three distinct integers a, b,
and c, points Pa , Pb , and Pc are collinear if and only if a + b + c = 2014.
Day 2 April 30th
4 Let k be a positive integer. Two players A and B play a game on an infinite

grid of regular hexagons. Initially all the grid cells are empty. Then the players
alternately take turns with A moving first. In his move, A may choose two
adjacent hexagons in the grid which are empty and place a counter in both of
them. In his move, B may choose any counter on the board and remove it. If
at any time there are k consecutive grid cells in a line all of which contain a
counter, A wins. Find the minimum value of k for which A cannot win in a
finite number of moves, or prove that no such minimum value exists.
5 Let ABC be a triangle with orthocenter H and let P be the second inter-
section of the circumcircle of triangle AHC with the internal bisector of the
angle ∠BAC. Let X be the circumcenter of triangle AP B and Y the ortho-
center of triangle AP C. Prove that the length of segment XY is equal to the
circumradius of triangle ABC.
6 Prove that there is a constant c > 0 with the following property: If a, b, n are
positive integers such that gcd(a + i, b + j) > 1 for all i, j ∈ {0, 1, . . . n}, then
n
min{a, b} > cn · n 2 .
Contributors: patrickhompe, msinghal, djmathman, tenniskidperson3, rrusczyk
2013 USAMO
USAMO 2013
Day 1 April 30th
1 In triangle ABC, points P , Q, R lie on sides BC, CA, AB respectively. Let ωA ,

ωB , ωC denote the circumcircles of triangles AQR, BRP , CP Q, respectively.
Given the fact that segment AP intersects ωA , ωB , ωC again at X, Y , Z,
respectively, prove that Y X/XZ = BP/P C.
2 For a positive integer n ≥ 3 plot n equally spaced points around a circle. Label
one of them A, and place a marker at A. One may move the marker forward
in a clockwise direction to either the next point or the point after that. Hence
there are a total of 2n distinct moves available; two from each point. Let an
count the number of ways to advance around the circle exactly twice, beginning
and ending at A, without repeating a move. Prove that an−1 + an = 2n for all
n ≥ 4.
3 Let n be a positive integer. There are n(n+1) 2 marks, each with a black side
and a white side, arranged into an equilateral triangle, with the biggest row
containing n marks. Initially, each mark has the black side up. An operation is
to choose a line parallel to the sides of the triangle, and flipping all the marks
on that line. A configuration is called admissible if it can be obtained from
the initial configuration by performing a finite number of operations. For each
admissible configuration C, let f (C) denote the smallest number of operations
required to obtain C from the initial configuration. Find the maximum value
of f (C), where C varies over all admissible configurations.
Day 2 May 1st
4 Find all real numbers x, y, z ≥ 1 satisfying

√ √ √ √ p √
min( x + xyz, y + xyz, z + xyz) = x − 1 + y − 1 + z − 1.
5 Given positive integers m and n, prove that there is a positive integer c such
that the numbers cm and cn have the same number of occurrences of each
non-zero digit when written in base ten.
Contributors: djmathman, tenniskidperson3, rrusczyk
2013 USAMO
6 Let ABC be a triangle. Find all points P on segment BC satisfying the fol-
lowing property: If X and Y are the intersections of line P A with the common
external tangent lines of the circumcircles of triangles P AB and P AC, then
2
PA PB · PC
+ = 1.
XY AB · AC
–
//maa.org).
Contributors: djmathman, tenniskidperson3, rrusczyk
2012 USAMO
USAMO 2012
Day 1 April 24th
1 Find all integers n ≥ 3 such that among any n positive real numbers a1 , a2 , . . . , an
with max(a1 , a2 , . . . , an ) ≤ n · min(a1 , a2 , . . . , an ), there exist three that are the
side lengths of an acute triangle.
2 A circle is divided into 432 congruent arcs by 432 points. The points are colored
in four colors such that some 108 points are colored Red, some 108 points are
colored Green, some 108 points are colored Blue, and the remaining 108 points
are colored Yellow. Prove that one can choose three points of each color in such
a way that the four triangles formed by the chosen points of the same color are
congruent.
3 Determine which integers n > 1 have the property that there exists an infinite
sequence a1 , a2 , a3 , . . . of nonzero integers such that the equality
ak + 2a2k + . . . + nank = 0
holds for every positive integer k.
Day 2 April 25th
4 Find all functions f : Z+ → Z+ (where Z+ is the set of positive integers)

such that f (n!) = f (n)! for all positive integers n and such that m − n divides
f (m) − f (n) for all distinct positive integers m, n.
5 Let P be a point in the plane of △ABC, and γ a line passing through P . Let
A′ , B ′ , C ′ be the points where the reflections of lines P A, P B, P C with respect
to γ intersect lines BC, AC, AB respectively. Prove that A′ , B ′ , C ′ are collinear.
6 For integer n ≥ 2, let x1 , x2 , . . . , xn be real numbers satisfying
x1 + x2 + . . . + xn = 0, and x21 + x22 + . . . + x2n = 1.
For each subset A ⊆ {1, 2, . . . , n}, define

X
SA = xi .
i∈A
Contributors: BOGTRO, tenniskidperson3, AIME15, tc1729, rrusczyk
2012 USAMO
(If A is the empty set, then SA = 0.)

Prove that for any positive number λ, the number of sets A satisfying SA ≥ λ
is at most 2n−3 /λ2 . For which choices of x1 , x2 , . . . , xn , λ does equality hold?
–
//maa.org).
Contributors: BOGTRO, tenniskidperson3, AIME15, tc1729, rrusczyk
2011 USAMO
USAMO 2011
Day 1 April 27th
1 Let a, b, c be positive real numbers such that a2 + b2 + c2 + (a + b + c)2 ≤ 4.

Prove that
ab + 1 bc + 1 ca + 1
2
+ 2
+ ≥ 3.
(a + b) (b + c) (c + a)2
2 An integer is assigned to each vertex of a regular pentagon so that the sum of

the five integers is 2011. A turn of a solitaire game consists of subtracting an
integer m from each of the integers at two neighboring vertices and adding 2m
to the opposite vertex, which is not adjacent to either of the first two vertices.
(The amount m and the vertices chosen can vary from turn to turn.) The game
is won at a certain vertex if, after some number of turns, that vertex has the
number 2011 and the other four vertices have the number 0. Prove that for any
choice of the initial integers, there is exactly one vertex at which the game can
be won.
3 In hexagon ABCDEF , which is nonconvex but not self-intersecting, no pair of

opposite sides are parallel. The internal angles satisfy ∠A = 3∠D, ∠C = 3∠F ,
and ∠E = 3∠B. Furthermore AB = DE, BC = EF , and CD = F A. Prove
that diagonals AD, BE, and CF are concurrent.
Day 2 April 28th
4 Consider the assertion that for each positive integer n ≥ 2, the remainder upon
n
dividing 22 by 2n − 1 is a power of 4. Either prove the assertion or find (with
proof) a counterexample.
5 Let P be a given point inside quadrilateral ABCD. Points Q1 and Q2 are

located within ABCD such that
∠Q1 BC = ∠ABP, ∠Q1 CB = ∠DCP, ∠Q2 AD = ∠BAP, ∠Q2 DA = ∠CDP.
Prove that Q1 Q2 k AB if and only if Q1 Q2 k CD.
6 Let A be a set with |A| = 225, meaning that A has 225 elements. Suppose
further that there are eleven subsets A1 , . . . , A11 of A such that |Ai | = 45 for
1 ≤ i ≤ 11 and |Ai ∩Aj | = 9 for 1 ≤ i < j ≤ 11. Prove that |A1 ∪A2 ∪. . .∪A11 | ≥
165, and give an example for which equality holds.
Contributors: tenniskidperson3, rrusczyk
2010 USAMO
USAMO 2010
Day 1 April 27th
1 Let AXY ZB be a convex pentagon inscribed in a semicircle of diameter AB.

Denote by P , Q, R, S the feet of the perpendiculars from Y onto lines AX,
BX, AZ, BZ, respectively. Prove that the acute angle formed by lines P Q and
RS is half the size of ∠XOZ, where O is the midpoint of segment AB.
2 There are n students standing in a circle, one behind the other. The students
have heights h1 < h2 < · · · < hn . If a student with height hk is standing directly
behind a student with height hk−2 or less, the two students are permitted to
switch places. Prove that it is not possible to make more than n3 such switches
before reaching a position in which no further switches are possible.
3 The 2010 positive numbers a1 , a2 , . . . , a2010 satisfy the inequality ai aj ≤ i + j

for all distinct indices i, j. Determine, with proof, the largest possible value of
the product a1 a2 . . . a2010 .
Day 2 April 28th
4 Let ABC be a triangle with ∠A = 90◦ . Points D and E lie on sides AC and
AB, respectively, such that ∠ABD = ∠DBC and ∠ACE = ∠ECB. Segments
BD and CE meet at I. Determine whether or not it is possible for segments
AB, AC, BI, ID, CI, IE to all have integer lengths.
3p−5
5 Let q = 2 where p is an odd prime, and let
1 1 1
Sq = + + ··· +
2·3·4 5·6·7 q(q + 1)(q + 2)
1 m
Prove that if p − 2Sq = n for integers m and n, then m − n is divisible by p.
6 A blackboard contains 68 pairs of nonzero integers. Suppose that for each

positive integer k at most one of the pairs (k, k) and (−k, −k) is written on the
blackboard. A student erases some of the 136 integers, subject to the condition
that no two erased integers may add to 0. The student then scores one point
for each of the 68 pairs in which at least one integer is erased. Determine, with
proof, the largest number N of points that the student can guarantee to score
regardless of which 68 pairs have been written on the board.
Contributors: tenniskidperson3, 1=2, BarbieRocks, kitsune, rrusczyk
2009 USAMO
USAMO 2009
Day 1 April 28th
1 Given circles ω1 and ω2 intersecting at points X and Y , let ℓ1 be a line through

the center of ω1 intersecting ω2 at points P and Q and let ℓ2 be a line through
the center of ω2 intersecting ω1 at points R and S. Prove that if P, Q, R and S
lie on a circle then the center of this circle lies on line XY .
2 Let n be a positive integer. Determine the size of the largest subset of {−n, −n+
1, . . . , n − 1, n} which does not contain three elements a, b, c (not necessarily
distinct) satisfying a + b + c = 0.
3 We define a chessboard polygon to be a polygon whose sides are situated along

lines of the form x = a or y = b, where a and b are integers. These lines divide
the interior into unit squares, which are shaded alternately grey and white so
that adjacent squares have different colors. To tile a chessboard polygon by
dominoes is to exactly cover the polygon by non-overlapping 1 × 2 rectangles.
Finally, a tasteful tiling is one which avoids the two configurations of dominoes
shown on the left below. Two tilings of a 3×4 rectangle are shown; the first one
is tasteful, while the second is not, due to the vertical dominoes in the upper
right corner.
Distasteful tilings
a) Prove that if a chessboard polygon can be tiled by dominoes, then it can be

done so tastefully.
b) Prove that such a tasteful tiling is unique.
Day 2 April 29th
Contributors: tenniskidperson3, azjps, rrusczyk
2009 USAMO
4 For n ≥ 2 let a1 , a2 , . . . an be positive real numbers such that

2
1 1 1 1
(a1 + a2 + · · · + an ) + + ··· + ≤ n+ .
a1 a2 an 2
Prove that max(a1 , a2 , . . . , an ) ≤ 4 min(a1 , a2 , . . . , an ).
5 Trapezoid ABCD, with AB k CD, is inscribed in circle ω and point G lies

inside triangle BCD. Rays AG and BG meet ω again at points P and Q,
respectively. Let the line through G parallel to AB intersects BD and BC at
points R and S, respectively. Prove that quadrilateral P QRS is cyclic if and
only if BG bisects ∠CBD.
6 Let s1 , s2 , s3 , . . . be an infinite, nonconstant sequence of rational numbers,

meaning it is not the case that s1 = s2 = s3 = . . . . Suppose that t1 , t2 , t3 , . . .
is also an infinite, nonconstant sequence of rational numbers with the property
that (si − sj )(ti − tj ) is an integer for all i and j. Prove that there exists a
rational number r such that (si − sj )r and (ti − tj )/r are integers for all i and
j.
–
//maa.org).
Contributors: tenniskidperson3, azjps, rrusczyk
2008 USAMO
USAMO 2008
Day 1 April 29th
1 Prove that for each positive integer n, there are pairwise relatively prime in-
tegers k0 , k1 , . . . , kn , all strictly greater than 1, such that k0 k1 . . . kn − 1 is the
product of two consecutive integers.
2 Let ABC be an acute, scalene triangle, and let M , N , and P be the midpoints
of BC, CA, and AB, respectively. Let the perpendicular bisectors of AB and
AC intersect ray AM in points D and E respectively, and let lines BD and CE
intersect in point F , inside of triangle ABC. Prove that points A, N , F , and
P all lie on one circle.
3 Let n be a positive integer. Denote by Sn the set of points (x, y) with integer
coordinates such that
1
|x| + y + < n.
2
A path is a sequence of distinct points (x1 , y1 ), (x2 , y2 ), . . . , (xℓ , yℓ ) in Sn such
that, for i = 2, . . . , ℓ, the distance between (xi , yi ) and (xi−1 , yi−1 ) is 1 (in other
words, the points (xi , yi ) and (xi−1 , yi−1 ) are neighbors in the lattice of points
with integer coordinates). Prove that the points in Sn cannot be partitioned
into fewer than n paths (a partition of Sn into m paths is a set P of m nonempty
paths such that each point in Sn appears in exactly one of the m paths in P).
Day 2 April 30th
4 Let P be a convex polygon with n sides, n ≥ 3. Any set of n − 3 diagonals of P

that do not intersect in the interior of the polygon determine a triangulation of
P into n−2 triangles. If P is regular and there is a triangulation of P consisting
of only isosceles triangles, find all the possible values of n.
5 Three nonnegative real numbers r1 , r2 , r3 are written on a blackboard. These

numbers have the property that there exist integers a1 , a2 , a3 , not all zero,
satisfying a1 r1 + a2 r2 + a3 r3 = 0. We are permitted to perform the following
operation: find two numbers x, y on the blackboard with x ≤ y, then erase y
and write y − x in its place. Prove that after a finite number of such operations,
we can end up with at least one 0 on the blackboard.
Contributors: worthawholebean, Valentin Vornicu, rrusczyk
2008 USAMO
6 At a certain mathematical conference, every pair of mathematicians are either

friends or strangers. At mealtime, every participant eats in one of two large
dining rooms. Each mathematician insists upon eating in a room which contains
an even number of his or her friends. Prove that the number of ways that the
mathematicians may be split between the two rooms is a power of two (i.e., is
of the form 2k for some positive integer k).
–
//maa.org).
Contributors: worthawholebean, Valentin Vornicu, rrusczyk
2007 USAMO
USAMO 2007
Day 1 April 24th
1 Let n be a positive integer. Define a sequence by setting a1 = n and, for each

k > 1, letting ak be the unique integer in the range 0 ≤ ak ≤ k − 1 for which
a1 +a2 +...+ak is divisible by k. For instance, when n = 9 the obtained sequence
is 9, 1, 2, 0, 3, 3, 3, .... Prove that for any n the sequence a1 , a2 , ... eventually
becomes constant.
2 A square grid on the Euclidean plane consists of all points (m, n), where m and
n are integers. Is it possible to cover all grid points by an infinite family of discs
with non-overlapping interiors if each disc in the family has radius at least 5?
3 Let S be a set containing n2 + n − 1 elements, for some positive integer n.

Suppose that the n-element subsets of S are partitioned into two classes. Prove
that there are at least n pairwise disjoint sets in the same class.
Day 2 April 25th
4 An animal with n cells is a connected figure consisting of n equal-sized cells[1].

A dinosaur is an animal with at least 2007 cells. It is said to be primitive it
its cells cannot be partitioned into two or more dinosaurs. Find with proof the
maximum number of cells in a primitive dinosaur.
(1) Animals are also called polyominoes. They can be defined inductively. Two
cells are adjacent if they share a complete edge. A single cell is an animal, and
given an animal with n cells, one with n + 1 cells is obtained by adjoining a
new cell by making it adjacent to one or more existing cells.
n
5 Prove that for every nonnegative integer n, the number 77 + 1 is the product
of at least 2n + 3 (not necessarily distinct) primes.
6 Let ABC be an acute triangle with ω, S, and R being its incircle, circumcircle,
and circumradius, respectively. Circle ωA is tangent internally to S at A and
tangent externally to ω. Circle SA is tangent internally to S at A and tangent
internally to ω. Let PA and QA denote the centers of ωA and SA , respectively.
Define points PB , QB , PC , QC analogously. Prove that
8PA QA · PB QB · PC QC ≤ R3 ,
Contributors: N.T.TUAN, rrusczyk
2007 USAMO
with equality if and only if triangle ABC is equilateral.
–
//maa.org).
Contributors: N.T.TUAN, rrusczyk
2006 USAMO
USAMO 2006
Day 1
1 Let p be a prime number and let s be an integer with 0 < s < p. Prove that
there exist integers m and n with 0 < m < n < p and

sm sn s
< <
p p p
if and only if s is not a divisor of p − 1.
Note: For x a real number, let ⌊x⌋ denote the greatest integer less than or
equal to x, and let {x} = x − ⌊x⌋ denote the fractional part of x.
2 For a given positive integer k find, in terms of k, the minimum value of N for
which there is a set of 2k + 1 distinct positive integers that has sum greater
than N but every subset of size k has sum at most N2 .
3 For integral m, let p(m) be the greatest prime divisor of m. By convention, we

set p(±1) = 1 and p(0) = ∞. Find all polynomials f with integer coefficients
such that the sequence
{p f n2 − 2n}n≥0

is bounded above. (In particular, this requires f n2 6= 0 for n ≥ 0.)
Day 2
4 Find all positive integers n such that there are k ≥ 2 positive rational numbers
a1 , a2 , . . . , ak satisfying a1 + a2 + . . . + ak = a1 · a2 · · · ak = n.
5 A mathematical frog jumps along the number line. The frog starts at 1, and
jumps according to the following rule: if the frog is at integer n, then it can
jump either to n + 1 or to n + 2mn +1 where 2mn is the largest power of 2 that
is a factor of n. Show that if k ≥ 2 is a positive integer and i is a nonnegative
integer, then the minimum number of jumps needed to reach 2i k is greater than
the minimum number of jumps needed to reach 2i .
Contributors: orl, rrusczyk
2006 USAMO
6 Let ABCD be a quadrilateral, and let E and F be points on sides AD and BC,
AE
respectively, such that ED = BF
F C . Ray F E meets rays BA and CD at S and T ,
respectively. Prove that the circumcircles of triangles SAE, SBF , T CF , and
T DE pass through a common point.
–
//maa.org).
Contributors: orl, rrusczyk
2005 USAMO
USAMO 2005
Day 1 April 19th
1 Determine all composite positive integers n for which it is possible to arrange

all divisors of n that are greater than 1 in a circle so that no two adjacent
divisors are relatively prime.
2 Prove that the system
x6 + x3 + x3 y + y = 147157
x3 + x3 y + y 2 + y + z 9 = 157147
has no solutions in integers x, y, and z.
3 Let ABC be an acute-angled triangle, and let P and Q be two points on its
side BC. Construct a point C1 in such a way that the convex quadrilateral
AP BC1 is cyclic, QC1 k CA, and C1 and Q lie on opposite sides of line AB.
Construct a point B1 in such a way that the convex quadrilateral AP CB1 is
cyclic, QB1 k BA, and B1 and Q lie on opposite sides of line AC. Prove that
the points B1 , C1 , P , and Q lie on a circle.
Day 2 April 20th
4 Legs L1 , L2 , L3 , L4 of a square table each have length n, where n is a positive

integer. For how many ordered 4-tuples (k1 , k2 , k3 , k4 ) of nonnegative integers
can we cut a piece of length ki from the end of leg Li (i = 1, 2, 3, 4) and still
have a stable table?
(The table is stable if it can be placed so that all four of the leg ends touch the
floor. Note that a cut leg of length 0 is permitted.)
5 Let n be an integer greater than 1. Suppose 2n points are given in the plane,
no three of which are collinear. Suppose n of the given 2n points are colored
blue and the other n colored red. A line in the plane is called a balancing line
if it passes through one blue and one red point and, for each side of the line,
the number of blue points on that side is equal to the number of red points on
the same side.
Prove that there exist at least two balancing lines.
Contributors: Valentin Vornicu, Ravi B, jmerry, grobber, codeblue87, Myth, rrusczyk
2005 USAMO
6 For m a positive integer, let s(m) be the sum of the digits of m. For n ≥ 2,
let f (n) be the
P minimal k for which there exists a set S of n positive integers
such that s x∈X x = k for any nonempty subset X ⊂ S. Prove that there
are constants 0 < C1 < C2 with
C1 log10 n ≤ f (n) ≤ C2 log10 n.
–
//maa.org).
Contributors: Valentin Vornicu, Ravi B, jmerry, grobber, codeblue87, Myth, rrusczyk
2004 USAMO
USAMO 2004
Day 1 April 27th
1 Let ABCD be a quadrilateral circumscribed about a circle, whose interior and

exterior angles are at least 60 degrees. Prove that
1
|AB 3 − AD3 | ≤ |BC 3 − CD3 | ≤ 3|AB 3 − AD3 |.
3
When does equality hold?
2 Suppose a1 , . . . , an are integers whose greatest common divisor is 1. Let S be

a set of integers with the following properties:
(a) For i = 1, . . . , n, ai ∈ S.
(b) For i, j = 1, . . . , n (not necessarily distinct), ai − aj ∈ S.
(c) For any integers x, y ∈ S, if x + y ∈ S, then x − y ∈ S.
Prove that S must be equal to the set of all integers.
3 For what real values of k > 0 is it possible to dissect a 1 × k rectangle into two
similar, but noncongruent, polygons?
Day 2 April 28th
4 Alice and Bob play a game on a 6 by 6 grid. On his or her turn, a player
chooses a rational number not yet appearing in the grid and writes it in an
empty square of the grid. Alice goes first and then the players alternate. When
all squares have numbers written in them, in each row, the square with the
greatest number in that row is colored black. Alice wins if she can then draw
a line from the top of the grid to the bottom of the grid that stays in black
squares, and Bob wins if she can’t. (If two squares share a vertex, Alice can
draw a line from one to the other that stays in those two squares.) Find, with
proof, a winning strategy for one of the players.
5 Let a, b, c > 0. Prove that (a5 − a2 + 3)(b5 − b2 + 3)(c5 − c2 + 3) ≥ (a + b + c)3 .
6 A circle ω is inscribed in a quadrilateral ABCD. Let I be the center of ω.

Suppose that
(AI + DI)2 + (BI + CI)2 = (AB + CD)2 .
Contributors: billzhao, StRyKeR, Arne, rrusczyk
2004 USAMO
Prove that ABCD is an isosceles trapezoid.
–
//maa.org).
Contributors: billzhao, StRyKeR, Arne, rrusczyk
2003 USAMO
USAMO 2003
Day 1 April 29th
1 Prove that for every positive integer n there exists an n-digit number divisible
by 5n all of whose digits are odd.
2 A convex polygon P in the plane is dissected into smaller convex polygons

by drawing all of its diagonals. The lengths of all sides and all diagonals of
the polygon P are rational numbers. Prove that the lengths of all sides of all
polygons in the dissection are also rational numbers.
3 Let n 6= 0. For every sequence of integers
A = a 0 , a1 , a2 , . . . , a n
satisfying 0 ≤ ai ≤ i, for i = 0, . . . , n, define another sequence
t(A) = t(a0 ), t(a1 ), t(a2 ), . . . , t(an )
by setting t(ai ) to be the number of terms in the sequence A that precede the
term ai and are different from ai . Show that, starting from any sequence A as
above, fewer than n applications of the transformation t lead to a sequence B
such that t(B) = B.
Day 2 April 30th
4 Let ABC be a triangle. A circle passing through A and B intersects segments

AC and BC at D and E, respectively. Lines AB and DE intersect at F ,
while lines BD and CF intersect at M . Prove that M F = M C if and only if
M B · M D = M C 2.
5 Let a, b, c be positive real numbers. Prove that
(2a + b + c)2 (2b + c + a)2 (2c + a + b)2

+ + ≤ 8.
2a2 + (b + c)2 2b2 + (c + a)2 2c2 + (a + b)2
6 At the vertices of a regular hexagon are written six nonnegative integers whose
sum is 20032003 . Bert is allowed to make moves of the following form: he may
pick a vertex and replace the number written there by the absolute value of the
Contributors: MithsApprentice, April, rrusczyk
2003 USAMO
difference between the numbers written at the two neighboring vertices. Prove
that Bert can make a sequence of moves, after which the number 0 appears at
all six vertices.
–
//maa.org).
Contributors: MithsApprentice, April, rrusczyk
2002 USAMO
USAMO 2002
Day 1 May 3rd
1 Let S be a set with 2002 elements, and let N be an integer with 0 ≤ N ≤ 22002 .
Prove that it is possible to color every subset of S either black or white so that
the following conditions hold:
(a) the union of any two white subsets is white;

(b) the union of any two black subsets is black;
(c) there are exactly N white subsets.
2 Let ABC be a triangle such that

2 2 2 2
A B C 6s
cot + 2 cot + 3 cot = ,
2 2 2 7r
where s and r denote its semiperimeter and its inradius, respectively. Prove
that triangle ABC is similar to a triangle T whose side lengths are all positive
integers with no common divisors and determine these integers.
3 Prove that any monic polynomial (a polynomial with leading coefficient 1) of

degree n with real coefficients is the average of two monic polynomials of degree
n with n real roots.
Day 2 May 4th
4 Let R be the set of real numbers. Determine all functions f : R → R such that
f (x2 − y 2 ) = xf (x) − yf (y)
for all pairs of real numbers x and y.
5 Let a, b be integers greater than 2. Prove that there exists a positive integer
k and a finite sequence n1 , n2 , . . . , nk of positive integers such that n1 = a,
nk = b, and ni ni+1 is divisible by ni + ni+1 for each i (1 ≤ i < k).
6 I have an n × n sheet of stamps, from which I’ve been asked to tear out blocks
of three adjacent stamps in a single row or column. (I can only tear along the
perforations separating adjacent stamps, and each block must come out of the
Contributors: MithsApprentice, Erken, rrusczyk
2002 USAMO
sheet in one piece.) Let b(n) be the smallest number of blocks I can tear out
and make it impossible to tear out any more blocks. Prove that there are real
constants c and d such that
1 2 1
n − cn ≤ b(n) ≤ n2 + dn
7 5
for all n > 0.
–
//maa.org).
Contributors: MithsApprentice, Erken, rrusczyk
2001 USAMO
USAMO 2001
Day 1 May 1st
1 Each of eight boxes contains six balls. Each ball has been colored with one of
n colors, such that no two balls in the same box are the same color, and no two
colors occur together in more than one box. Determine, with justification, the
smallest integer n for which this is possible.
2 Let ABC be a triangle and let ω be its incircle. Denote by D1 and E1 the
points where ω is tangent to sides BC and AC, respectively. Denote by D2 and
E2 the points on sides BC and AC, respectively, such that CD2 = BD1 and
CE2 = AE1 , and denote by P the point of intersection of segments AD2 and
BE2 . Circle ω intersects segment AD2 at two points, the closer of which to the
vertex A is denoted by Q. Prove that AQ = D2 P .
3 Let a, b, c ≥ 0 and satisfy

a2 + b2 + c2 + abc = 4.
Show that
0 ≤ ab + bc + ca − abc ≤ 2.
Day 2 May 2nd
4 Let P be a point in the plane of triangle ABC such that the segments P A, P B,
and P C are the sides of an obtuse triangle. Assume that in this triangle the
obtuse angle opposes the side congruent to P A. Prove that ∠BAC is acute.
5 Let S be a set of integers (not necessarily positive) such that
(a) there exist a, b ∈ S with gcd(a, b) = gcd(a − 2, b − 2) = 1;

(b) if x and y are elements of S (possibly equal), then x2 − y also belongs to S.
Prove that S is the set of all integers.
6 Each point in the plane is assigned a real number such that, for any triangle,
the number at the center of its inscribed circle is equal to the arithmetic mean
of the three numbers at its vertices. Prove that all points in the plane are
assigned the same number.
Contributors: MithsApprentice, cn2 71828182846, rrusczyk
2000 USAMO
USAMO 2000
Day 1 May 2nd
1 Call a real-valued function f very convex if

f (x) + f (y) x+y
≥f + |x − y|
2 2
holds for all real numbers x and y. Prove that no very convex function exists.
2 Let S be the set of all triangles ABC for which

1 1 1 3 6
5 + + − = ,
AP BQ CR min{AP, BQ, CR} r
where r is the inradius and P, Q, R are the points of tangency of the incircle
with sides AB, BC, CA, respectively. Prove that all triangles in S are isosceles
and similar to one another.
3 A game of solitaire is played with R red cards, W white cards, and B blue cards.
A player plays all the cards one at a time. With each play he accumulates a
penalty. If he plays a blue card, then he is charged a penalty which is the
number of white cards still in his hand. If he plays a white card, then he is
charged a penalty which is twice the number of red cards still in his hand. If he
plays a red card, then he is charged a penalty which is three times the number
of blue cards still in his hand. Find, as a function of R, W, and B, the minimal
total penalty a player can amass and all the ways in which this minimum can
be achieved.
Day 2 May 2nd
4 Find the smallest positive integer n such that if n squares of a 1000 × 1000
chessboard are colored, then there will exist three colored squares whose centers
form a right triangle with sides parallel to the edges of the board.
5 Let A1 A2 A3 be a triangle and let ω1 be a circle in its plane passing through A1

and A2 . Suppose there exist circles ω2 , ω3 , . . . , ω7 such that for k = 2, 3, . . . , 7,
ωk is externally tangent to ωk−1 and passes through Ak and Ak+1 , where An+3 =
An for all n ≥ 1. Prove that ω7 = ω1 .
Contributors: lomos lupin, MithsApprentice, fuzzylogic, rrusczyk
2000 USAMO
6 Let a1 , b1 , a2 , b2 , . . . , an , bn be nonnegative real numbers. Prove that

n
X n
X
min{ai aj , bi bj } ≤ min{ai bj , aj bi }.
i,j=1 i,j=1
–
//maa.org).
Contributors: lomos lupin, MithsApprentice, fuzzylogic, rrusczyk
1999 USAMO
USAMO 1999
Day 1 April 27th
1 Some checkers placed on an n × n checkerboard satisfy the following conditions:
(a) every square that does not contain a checker shares a side with one that does;
(b) given any pair of squares that contain checkers, there is a sequence of
squares containing checkers, starting and ending with the given squares, such
that every two consecutive squares of the sequence share a side.
Prove that at least (n2 − 2)/3 checkers have been placed on the board.
2 Let ABCD be a cyclic quadrilateral. Prove that

|AB − CD| + |AD − BC| ≥ 2|AC − BD|.
3 Let p > 2 be a prime and let a, b, c, d be integers not divisible by p, such that

ra rb rc rd
+ + + =2
p p p p
for any integer r not divisible by p. Prove that at least two of the numbers
a + b, a + c, a + d, b + c, b + d, c + d are divisible by p.
(Note: {x} = x − ⌊x⌋ denotes the fractional part of x.)
Day 2 April 27th
4 Let a1 , a2 , . . . , an (n > 3) be real numbers such that

a1 + a2 + · · · + an ≥ n and a21 + a22 + · · · + a2n ≥ n2 .
Prove that max(a1 , a2 , . . . , an ) ≥ 2.
5 The Y2K Game is played on a 1 × 2000 grid as follows. Two players in turn
write either an S or an O in an empty square. The first player who produces
three consecutive boxes that spell SOS wins. If all boxes are filled without
producing SOS then the game is a draw. Prove that the second player has a
winning strategy.
Contributors: MithsApprentice, tetrahedr0n, rrusczyk
1999 USAMO
6 Let ABCD be an isosceles trapezoid with AB k CD. The inscribed circle ω of

triangle BCD meets CD at E. Let F be a point on the (internal) angle bisector
of ∠DAC such that EF ⊥ CD. Let the circumscribed circle of triangle ACF
meet line CD at C and G. Prove that the triangle AF G is isosceles.
–
//maa.org).
Contributors: MithsApprentice, tetrahedr0n, rrusczyk
1998 USAMO
USAMO 1998
Day 1 April 28th
1 Suppose that the set {1, 2, · · · , 1998} has been partitioned into disjoint pairs
{ai , bi } (1 ≤ i ≤ 999) so that for all i, |ai − bi | equals 1 or 6. Prove that the
sum
|a1 − b1 | + |a2 − b2 | + · · · + |a999 − b999 |
ends in the digit 9.
2 Let C1 and C2 be concentric circles, with C2 in the interior of C1 . From a point

A on C1 one draws the tangent AB to C2 (B ∈ C2 ). Let C be the second
point of intersection of AB and C1 , and let D be the midpoint of AB. A line
passing through A intersects C2 at E and F in such a way that the perpendicular
bisectors of DE and CF intersect at a point M on AB. Find, with proof, the
ratio AM/M C.
3 Let a0 , a1 , · · · , an be numbers from the interval (0, π/2) such that

π π π
tan(a0 − ) + tan(a1 − ) + · · · + tan(an − ) ≥ n − 1.
4 4 4
Prove that
tan a0 tan a1 · · · tan an ≥ nn+1 .
Day 2 April 28th
4 A computer screen shows a 98 × 98 chessboard, colored in the usual way. One

can select with a mouse any rectangle with sides on the lines of the chessboard
and click the mouse button: as a result, the colors in the selected rectangle
switch (black becomes white, white becomes black). Find, with proof, the
minimum number of mouse clicks needed to make the chessboard all one color.
5 Prove that for each n ≥ 2, there is a set S of n integers such that (a − b)2
divides ab for every distinct a, b ∈ S.
6 Let n ≥ 5 be an integer. Find the largest integer k (as a function of n) such that
there exists a convex n-gon A1 A2 . . . An for which exactly k of the quadrilaterals
Ai Ai+1 Ai+2 Ai+3 have an inscribed circle. (Here An+j = Aj .)
Contributors: MithsApprentice, paul mathematics, rrusczyk
1997 USAMO
USAMO 1997
Day 1 May 1st
1 Let p1 , p2 , p3 , . . . be the prime numbers listed in increasing order, and let x0 be

a real number between 0 and 1. For positive integer k, define

0
 if xk−1 = 0,
xk =
pk


 if xk−1 6= 0,
xk−1
where {x} denotes the fractional part of x. (The fractional part of x is given
by x − ⌊x⌋ where ⌊x⌋ is the greatest integer less than or equal to x.) Find,
with proof, all x0 satisfying 0 < x0 < 1 for which the sequence x0 , x1 , x2 , . . .
eventually becomes 0.
2 Let ABC be a triangle. Take points D, E, F on the perpendicular bisectors of

BC, CA, AB respectively. Show that the lines through A, B, C perpendicular
to EF , F D, DE respectively are concurrent.
3 Prove that for any integer n, there exists a unique polynomial Q with coefficients
in {0, 1, . . . , 9} such that Q(−2) = Q(−5) = n.
Day 2 May 2nd
4 To clip a convex n-gon means to choose a pair of consecutive sides AB, BC

and to replace them by the three segments AM, M N , and N C, where M is the
midpoint of AB and N is the midpoint of BC. In other words, one cuts off the
triangle M BN to obtain a convex (n + 1)-gon. A regular hexagon P6 of area
1 is clipped to obtain a heptagon P7 . Then P7 is clipped (in one of the seven
possible ways) to obtain an octagon P8 , and so on. Prove that no matter how
the clippings are done, the area of Pn is greater than 13 , for all n ≥ 6.
5 Prove that, for all positive real numbers a, b, c, the inequality

1 1 1 1
+ 3 + 3 ≤
a3 3 3 3
+ b + abc b + c + abc c + a + abc abc
holds.
Contributors: MithsApprentice, Chinaboy, Agrippina, Maverick, rrusczyk
1997 USAMO
6 Suppose the sequence of nonnegative integers a1 , a2 , . . . , a1997 satisfies
ai + aj ≤ ai+j ≤ ai + aj + 1
for all i, j ≥ 1 with i + j ≤ 1997. Show that there exists a real number x such
that an = ⌊nx⌋ (the greatest integer ≤ nx) for all 1 ≤ n ≤ 1997.
–
//maa.org).
Contributors: MithsApprentice, Chinaboy, Agrippina, Maverick, rrusczyk
1996 USAMO
USAMO 1996
Day 1 May 2nd
1 Prove that the average of the numbers n sin n◦ (n = 2, 4, 6, . . . , 180) is cot 1◦ .
2 For any nonempty set S of real numbers, let σ(S) denote the sum of the ele-
ments of S. Given a set A of n positive integers, consider the collection of all
distinct sums σ(S) as S ranges over the nonempty subsets of A. Prove that
this collection of sums can be partitioned into n classes so that in each class,
the ratio of the largest sum to the smallest sum does not exceed 2.
3 Let ABC be a triangle. Prove that there is a line ℓ (in the plane of triangle
ABC) such that the intersection of the interior of triangle ABC and the interior
of its reflection A′ B ′ C ′ in ℓ has area more than 23 the area of triangle ABC.
Day 2 May 2nd
4 An n-term sequence (x1 , x2 , . . . , xn ) in which each term is either 0 or 1 is called

a binary sequence of length n. Let an be the number of binary sequences of
length n containing no three consecutive terms equal to 0, 1, 0 in that order.
Let bn be the number of binary sequences of length n that contain no four
consecutive terms equal to 0, 0, 1, 1 or 1, 1, 0, 0 in that order. Prove that
bn+1 = 2an for all positive integers n.
5 Let ABC be a triangle, and M an interior point such that ∠M AB = 10◦ ,

∠M BA = 20◦ , ∠M AC = 40◦ and ∠M CA = 30◦ . Prove that the triangle is
isosceles.
6 Determine (with proof) whether there is a subset X of the integers with the
following property: for any integer n there is exactly one solution of a + 2b = n
with a, b ∈ X.
–
//maa.org).
Contributors: MithsApprentice, Valentin Vornicu, rrusczyk
1995 USAMO
USAMO 1995
– April 27th
1 Let p be an odd prime. The sequence (an )n≥0 is defined as follows: a0 = 0,

a1 = 1, . . . , ap−2 = p − 2 and, for all n ≥ p − 1, an is the least positive
integer that does not form an arithmetic sequence of length p with any of the
preceding terms. Prove that, for all n, an is the number obtained by writing
n in base p − 1 and reading the result in base p.
2 A calculator is broken so that the only keys that still work are the sin, cos,
and tan buttons, and their inverses (the arcsin, arccos, and arctan buttons).
The display initially shows 0. Given any positive rational number q, show that
pressing some finite sequence of buttons will yield the number q on the display.
Assume that the calculator does real number calculations with infinite precision.
All functions are in terms of radians.
3 Given a nonisosceles, nonright triangle ABC, let O denote the center of its
circumscribed circle, and let A1 , B1 , and C1 be the midpoints of sides BC, CA,
and AB, respectively. Point A2 is located on the ray OA1 so that OAA1 is
similar to OA2 A. Points B2 and C2 on rays OB1 and OC1 , respectively, are
defined similarly. Prove that lines AA2 , BB2 , and CC2 are concurrent, i.e.
these three lines intersect at a point.
4 Suppose q0 , q1 , q2 , . . . is an infinite sequence of integers satisfying the follow-

ing two conditions:
(i) m − n divides qm − qn for m > n ≥ 0,

(ii) there is a polynomial P such that |qn | < P (n) for all n
Prove that there is a polynomial Q such that qn = Q(n) for all n.
5 Suppose that in a certain society, each pair of persons can be classified as either
amicable or hostile. We shall say that each member of an amicable pair is a
friend of the other, and each member of a hostile pair is a foe of the other.
Suppose that the society has n persons and q amicable pairs, and that for
every set of three persons, at least one pair is hostile. Prove that there is
at least one member of the society whose foes include q(1 − 4q/n2 ) or fewer
amicable pairs.
Contributors: MithsApprentice, bookworm271828, paul mathematics, rrusczyk

USAMO

Uploaded by

Copyright:

Available Formats

USAMO

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

USAMO

Uploaded by

Copyright:

Available Formats

2017 USAMO

Day 1 April 19th

2 Let m1 , m2 , . . . , mn be a collection of n positive integers, not necessarily dis-

3 Let ABC be a scalene triangle with circumcircle Ω and incenter I. Ray AI

Day 2 April 20th

4 Let P1 , P2 , . . . , P2n be 2n distinct points on the unit circle x2 + y 2 = 1, other

6 Find the minimum possible value of

Day 1 April 19th

1 Let X1 , X2 , . . . , X100 be a sequence of mutually distinct nonempty subsets of a

2 Prove that for any positive integer k,

Day 2 April 20th

(f (x) + xy) · f (x − 3y) + (f (y) + xy) · f (3x − y) = (f (x + y))2 .

5 An equilateral pentagon AM N P Q is inscribed in triangle ABC such that M ∈

1 Solve in integers the equation

2 Quadrilateral AP BQ is inscribed in circle ω with ∠P = ∠Q = 90◦ and AP =

3 Let S = {1, 2, . . . , n}, where n ≥ 1. Each of the 2n subsets of S is to be

4 Steve is piling m ≥ 1 indistinguishable stones on the squares of an n × n grid.

5 Let a, b, c, d, e be distinct positive integers such that a4 + b4 = c4 + d4 = e5 .

6 Consider 0 < λ < 1, and let A be a multiset of positive integers. Let An =

Day 1 April 29th

1 Let a, b, c, d be real numbers such that b − d ≥ 5 and all zeros x1 , x2 , x3 , and

2 Let Z be the set of integers. Find all functions f : Z → Z such that

3 Prove that there exists an infinite set of points

. . . , P−3 , P−2 , P−1 , P0 , P1 , P2 , P3 , . . .

Day 2 April 30th

4 Let k be a positive integer. Two players A and B play a game on an infinite

Day 1 April 30th

1 In triangle ABC, points P , Q, R lie on sides BC, CA, AB respectively. Let ωA ,

Day 2 May 1st

4 Find all real numbers x, y, z ≥ 1 satisfying

Day 1 April 24th

holds for every positive integer k.

Day 2 April 25th

4 Find all functions f : Z+ → Z+ (where Z+ is the set of positive integers)

6 For integer n ≥ 2, let x1 , x2 , . . . , xn be real numbers satisfying

x1 + x2 + . . . + xn = 0, and x21 + x22 + . . . + x2n = 1.

For each subset A ⊆ {1, 2, . . . , n}, define

(If A is the empty set, then SA = 0.)

Day 1 April 27th

1 Let a, b, c be positive real numbers such that a2 + b2 + c2 + (a + b + c)2 ≤ 4.

2 An integer is assigned to each vertex of a regular pentagon so that the sum of

3 In hexagon ABCDEF , which is nonconvex but not self-intersecting, no pair of

Day 2 April 28th

5 Let P be a given point inside quadrilateral ABCD. Points Q1 and Q2 are

Day 1 April 27th

1 Let AXY ZB be a convex pentagon inscribed in a semicircle of diameter AB.

3 The 2010 positive numbers a1 , a2 , . . . , a2010 satisfy the inequality ai aj ≤ i + j

Day 2 April 28th

6 A blackboard contains 68 pairs of nonzero integers. Suppose that for each

Day 1 April 28th

1 Given circles ω1 and ω2 intersecting at points X and Y , let ℓ1 be a line through

3 We define a chessboard polygon to be a polygon whose sides are situated along

a) Prove that if a chessboard polygon can be tiled by dominoes, then it can be

b) Prove that such a tasteful tiling is unique.

Day 2 April 29th

4 For n ≥ 2 let a1 , a2 , . . . an be positive real numbers such that

Prove that max(a1 , a2 , . . . , an ) ≤ 4 min(a1 , a2 , . . . , an ).

5 Trapezoid ABCD, with AB k CD, is inscribed in circle ω and point G lies

6 Let s1 , s2 , s3 , . . . be an infinite, nonconstant sequence of rational numbers,

Day 1 April 29th