Difference between revisions of "2021 USAMO Problems"
m |
m (newbox) |
||
Line 54: | Line 54: | ||
==See Also== | ==See Also== | ||
− | {{USAMO | + | {{USAMO newbox|year=2021|before=[[2020 USAMO Problems]]|after=[[2022 USAMO Problems]]}} |
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 13:48, 22 November 2023
Contents
Day 1
For any geometry problem whose statement begins with an asterisk
, the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.
Problem 1
Rectangles
and
are erected outside an acute triangle
Suppose that
Prove that lines
and
are concurrent.
Problem 2
The Planar National Park is a subset of the Euclidean plane consisting of several trails which meet at junctions. Every trail has its two endpoints at two different junctions whereas each junction is the endpoint of exactly three trails. Trails only intersect at junctions (in particular, trails only meet at endpoints). Finally, no trails begin and end at the same two junctions.
A visitor walks through the park as follows: she begins at a junction and starts walking along a trail. At the end of that first trail, she enters a junction and turns left. On the next junction she turns right, and so on, alternating left and right turns at each junction. She does this until she gets back to the junction where she started. What is the largest possible number of times she could have entered any junction during her walk, over all possible layouts of the park?
Problem 3
Let be an integer. An
board is initially empty. Each minute, you may perform one of three moves:
If there is an L-shaped tromino region of three cells without stones on the board (see figure; rotations not allowed), you may place a stone in each of those cells.
If all cells in a column have a stone, you may remove all stones from that column.
If all cells in a row have a stone, you may remove all stones from that row.
For which
is it possible that, after some non-zero number of moves, the board has no stones?
Day 2
Problem 4
A finite set of positive integers has the property that, for each
and each positive integer divisor
of
, there exists a unique element
satisfying
. (The elements
and
could be equal.)
Given this information, find all possible values for the number of elements of .
Problem 5
Let be an integer. Find all positive real solutions to the following system of
equations:
Problem 6
Let
be a convex hexagon satisfying
,
,
, and
Let
,
, and
be the midpoints of
,
, and
. Prove that the circumcenter of
, the circumcenter of
, and the orthocenter of
are collinear.
See Also
2021 USAMO (Problems • Resources) | ||
Preceded by 2020 USAMO Problems |
Followed by 2022 USAMO Problems | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.