Difference between revisions of "2021 USAJMO Problems"
Etmetalakret (talk | contribs) |
|||
(7 intermediate revisions by 3 users not shown) | |||
Line 3: | Line 3: | ||
===Problem 1=== | ===Problem 1=== | ||
Let <math>\mathbb{N}</math> denote the set of positive integers. Find all functions <math>f : \mathbb{N} \rightarrow \mathbb{N}</math> such that for positive integers <math>a</math> and <math>b,</math><cmath>f(a^2 + b^2) = f(a)f(b) \text{ and } f(a^2) = f(a)^2.</cmath> | Let <math>\mathbb{N}</math> denote the set of positive integers. Find all functions <math>f : \mathbb{N} \rightarrow \mathbb{N}</math> such that for positive integers <math>a</math> and <math>b,</math><cmath>f(a^2 + b^2) = f(a)f(b) \text{ and } f(a^2) = f(a)^2.</cmath> | ||
+ | |||
[[2021 USAJMO Problems/Problem 1|Solution]] | [[2021 USAJMO Problems/Problem 1|Solution]] | ||
===Problem 2=== | ===Problem 2=== | ||
Rectangles <math>BCC_1B_2,</math> <math>CAA_1C_2,</math> and <math>ABB_1A_2</math> are erected outside an acute triangle <math>ABC.</math> Suppose that<cmath>\angle BC_1C+\angle | Rectangles <math>BCC_1B_2,</math> <math>CAA_1C_2,</math> and <math>ABB_1A_2</math> are erected outside an acute triangle <math>ABC.</math> Suppose that<cmath>\angle BC_1C+\angle | ||
CA_1A+\angle AB_1B=180^{\circ}.</cmath>Prove that lines <math>B_1C_2,</math> <math>C_1A_2,</math> and <math>A_1B_2</math> are concurrent. | CA_1A+\angle AB_1B=180^{\circ}.</cmath>Prove that lines <math>B_1C_2,</math> <math>C_1A_2,</math> and <math>A_1B_2</math> are concurrent. | ||
+ | |||
[[2021 USAJMO Problems/Problem 2|Solution]] | [[2021 USAJMO Problems/Problem 2|Solution]] | ||
===Problem 3=== | ===Problem 3=== | ||
− | An equilateral triangle <math>\Delta</math> of side length <math>L>0</math> is given. Suppose that <math>n</math> equilateral triangles with side length 1 and with non-overlapping interiors are drawn inside <math>\Delta</math>, such that each unit equilateral triangle has sides parallel to <math>\Delta</math>, but with opposite orientation. (An example with <math>n=2</math> is drawn below.) | + | An equilateral triangle <math>\Delta</math> of side length <math>L>0</math> is given. Suppose that <math>n</math> equilateral triangles with side length 1 and with non-overlapping interiors are drawn inside <math>\Delta</math>, such that each unit equilateral triangle has sides parallel to <math>\Delta</math>, but with opposite orientation. (An example with <math>n=2</math> is drawn below.) |
+ | <asy> | ||
+ | draw((0,0)--(1,0)--(1/2,sqrt(3)/2)--cycle,linewidth(0.5)); | ||
+ | filldraw((0.45,0.55)--(0.65,0.55)--(0.55,0.55-sqrt(3)/2*0.2)--cycle,gray,linewidth(0.5)); | ||
+ | filldraw((0.54,0.3)--(0.34,0.3)--(0.44,0.3-sqrt(3)/2*0.2)--cycle,gray,linewidth(0.5)); | ||
+ | </asy> | ||
+ | Prove that<cmath>n \leq \frac{2}{3} L^{2}.</cmath> | ||
+ | |||
[[2021 USAJMO Problems/Problem 3|Solution]] | [[2021 USAJMO Problems/Problem 3|Solution]] | ||
==Day 2== | ==Day 2== | ||
===Problem 4=== | ===Problem 4=== | ||
− | Carina has three pins, labeled <math>A, B</math>, and <math>C</math>, respectively, located at the origin of the coordinate plane. In a move, Carina may move a pin to an adjacent lattice point at distance <math>1</math> away. What is the least number of moves that Carina can make in order for triangle <math>ABC</math> to have area 2021? (A lattice point is a point <math>(x, y)</math> in the coordinate plane where <math>x</math> and <math>y</math> are both integers, not necessarily positive.) | + | Carina has three pins, labeled <math>A, B</math>, and <math>C</math>, respectively, located at the origin of the coordinate plane. In a move, Carina may move a pin to an adjacent lattice point at distance <math>1</math> away. What is the least number of moves that Carina can make in order for triangle <math>ABC</math> to have area 2021? |
+ | |||
+ | (A lattice point is a point <math>(x, y)</math> in the coordinate plane where <math>x</math> and <math>y</math> are both integers, not necessarily positive.) | ||
+ | |||
[[2021 USAJMO Problems/Problem 4|Solution]] | [[2021 USAJMO Problems/Problem 4|Solution]] | ||
===Problem 5=== | ===Problem 5=== | ||
A finite set <math>S</math> of positive integers has the property that, for each <math>s \in S,</math> and each positive integer divisor <math>d</math> of <math>s</math>, there exists a unique element <math>t \in S</math> satisfying <math>\text{gcd}(s, t) = d</math>. (The elements <math>s</math> and <math>t</math> could be equal.) Given this information, find all possible values for the number of elements of <math>S</math>. | A finite set <math>S</math> of positive integers has the property that, for each <math>s \in S,</math> and each positive integer divisor <math>d</math> of <math>s</math>, there exists a unique element <math>t \in S</math> satisfying <math>\text{gcd}(s, t) = d</math>. (The elements <math>s</math> and <math>t</math> could be equal.) Given this information, find all possible values for the number of elements of <math>S</math>. | ||
+ | |||
[[2021 USAJMO Problems/Problem 5|Solution]] | [[2021 USAJMO Problems/Problem 5|Solution]] | ||
===Problem 6=== | ===Problem 6=== | ||
− | Let <math>n \geq 4</math> be an integer. Find all positive real solutions to the following system of <math>2n</math> equations: \begin{align*} a_{1} &=\frac{1}{a_{2 n}}+\frac{1}{a_{2}}, & a_{2}&=a_{1}+a_{3}, \\ a_{3}&=\frac{1}{a_{2}}+\frac{1}{a_{4}}, & a_{4}&=a_{3}+a_{5}, \\ a_{5}&=\frac{1}{a_{4}}+\frac{1}{a_{6}}, & a_{6}&=a_{5}+a_{7}, \\ &\vdots \\ a_{2 n-1}&=\frac{1}{a_{2 n-2}}+\frac{1}{a_{2 n}}, & a_{2 n}&=a_{2 n-1}+a_{1} \end{align*} | + | Let <math>n \geq 4</math> be an integer. Find all positive real solutions to the following system of <math>2n</math> equations: <cmath>\begin{align*} a_{1} &=\frac{1}{a_{2 n}}+\frac{1}{a_{2}}, & a_{2}&=a_{1}+a_{3}, \\ a_{3}&=\frac{1}{a_{2}}+\frac{1}{a_{4}}, & a_{4}&=a_{3}+a_{5}, \\ a_{5}&=\frac{1}{a_{4}}+\frac{1}{a_{6}}, & a_{6}&=a_{5}+a_{7}, \\ &\vdots \\ a_{2 n-1}&=\frac{1}{a_{2 n-2}}+\frac{1}{a_{2 n}}, & a_{2 n}&=a_{2 n-1}+a_{1} \end{align*}</cmath> |
+ | |||
[[2021 USAJMO Problems/Problem 6|Solution]] | [[2021 USAJMO Problems/Problem 6|Solution]] | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
+ | {{USAJMO box|year=2021|before=[[2020 USOJMO Problems]]|after=[[2022 USAJMO Problems]]}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |
Latest revision as of 15:47, 5 August 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
Let denote the set of positive integers. Find all functions such that for positive integers and
Problem 2
Rectangles and are erected outside an acute triangle Suppose thatProve that lines and are concurrent.
Problem 3
An equilateral triangle of side length is given. Suppose that equilateral triangles with side length 1 and with non-overlapping interiors are drawn inside , such that each unit equilateral triangle has sides parallel to , but with opposite orientation. (An example with is drawn below.) Prove that
Day 2
Problem 4
Carina has three pins, labeled , and , respectively, located at the origin of the coordinate plane. In a move, Carina may move a pin to an adjacent lattice point at distance away. What is the least number of moves that Carina can make in order for triangle to have area 2021?
(A lattice point is a point in the coordinate plane where and are both integers, not necessarily positive.)
Problem 5
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 6
Let be an integer. Find all positive real solutions to the following system of equations:
2021 USAJMO (Problems • Resources) | ||
Preceded by 2020 USOJMO Problems |
Followed by 2022 USAJMO Problems | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAJMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.