MathDB
Problems
Contests
National and Regional Contests
USA Contests
MAA AMC
USAMO
2011 USAMO
2011 USAMO
Part of
USAMO
Subcontests
(4)
6
1
Hide problems
Sets and set intersections: 2011 USAMO #6
Let
A
A
A
be a set with
∣
A
∣
=
225
|A|=225
∣
A
∣
=
225
, meaning that
A
A
A
has 225 elements. Suppose further that there are eleven subsets
A
1
,
…
,
A
11
A_1, \ldots, A_{11}
A
1
,
…
,
A
11
of
A
A
A
such that
∣
A
i
∣
=
45
|A_i|=45
∣
A
i
∣
=
45
for
1
≤
i
≤
11
1\leq i\leq11
1
≤
i
≤
11
and
∣
A
i
∩
A
j
∣
=
9
|A_i\cap A_j|=9
∣
A
i
∩
A
j
∣
=
9
for
1
≤
i
<
j
≤
11
1\leq i<j\leq11
1
≤
i
<
j
≤
11
. Prove that
∣
A
1
∪
A
2
∪
…
∪
A
11
∣
≥
165
|A_1\cup A_2\cup\ldots\cup A_{11}|\geq 165
∣
A
1
∪
A
2
∪
…
∪
A
11
∣
≥
165
, and give an example for which equality holds.
5
1
Hide problems
Isogonal Conjugates: 2011 USAMO #5
Let
P
P
P
be a given point inside quadrilateral
A
B
C
D
ABCD
A
BC
D
. Points
Q
1
Q_1
Q
1
and
Q
2
Q_2
Q
2
are located within
A
B
C
D
ABCD
A
BC
D
such that \angle Q_1BC=\angle ABP, \angle Q_1CB=\angle DCP, \angle Q_2AD=\angle BAP, \angle Q_2DA=\angle CDP. Prove that
Q
1
Q
2
‾
∥
A
B
‾
\overline{Q_1Q_2}\parallel\overline{AB}
Q
1
Q
2
∥
A
B
if and only if
Q
1
Q
2
‾
∥
C
D
‾
\overline{Q_1Q_2}\parallel\overline{CD}
Q
1
Q
2
∥
C
D
.
3
1
Hide problems
Hexagon ABCDEF: 2011 USAMO #3
In hexagon
A
B
C
D
E
F
ABCDEF
A
BC
D
EF
, which is nonconvex but not self-intersecting, no pair of opposite sides are parallel. The internal angles satisfy
∠
A
=
3
∠
D
\angle A=3\angle D
∠
A
=
3∠
D
,
∠
C
=
3
∠
F
\angle C=3\angle F
∠
C
=
3∠
F
, and
∠
E
=
3
∠
B
\angle E=3\angle B
∠
E
=
3∠
B
. Furthermore
A
B
=
D
E
AB=DE
A
B
=
D
E
,
B
C
=
E
F
BC=EF
BC
=
EF
, and
C
D
=
F
A
CD=FA
C
D
=
F
A
. Prove that diagonals
A
D
‾
\overline{AD}
A
D
,
B
E
‾
\overline{BE}
BE
, and
C
F
‾
\overline{CF}
CF
are concurrent.
2
1
Hide problems
Vertices of a pentagon invariant: 2011 USAMO #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
m
m
from each of the integers at two neighboring vertices and adding
2
m
2m
2
m
to the opposite vertex, which is not adjacent to either of the first two vertices. (The amount
m
m
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.