Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2020 USOJMO Problems"

(→‎Day 1)
 
(Page created)
Line 21: Line 21:
  
 
[[2020 USOJMO Problems/Problem 3|Solution]]
 
[[2020 USOJMO Problems/Problem 3|Solution]]
 +
 +
==Day 2==
 +
 +
===Problem 4===
 +
Let <math>ABCD</math> be a convex quadrilateral inscribed in a circle and satisfying <math>DA < AB = BC < CD</math>. Points <math>E</math> and <math>F</math> are chosen on sides <math>CD</math> and <math>AB</math> such that <math>BE \perp AC</math> and <math>EF \parallel BC</math>. Prove that <math>FB = FD</math>.
 +
 +
[[2020 USOJMO Problems/Problem 4|Solution]]
 +
 +
===Problem 5===
 +
Suppose that <math>(a_1,b_1),</math> <math>(a_2,b_2),</math> <math>\dots,</math> <math>(a_{100},b_{100})</math> are distinct ordered pairs of nonnegative integers. Let <math>N</math> denote the number of pairs of integers <math>(i,j)</math> satisfying <math>1\leq i<j\leq 100</math> and <math>|a_ib_j-a_jb_i|=1</math>. Determine the largest possible value of <math>N</math> over all possible choices of the <math>100</math> ordered pairs.
 +
 +
[[2020 USOJMO Problems/Problem 5|Solution]]
 +
 +
===Problem 6===
 +
Let <math>n \geq 2</math> be an integer. Let <math>P(x_1, x_2, \ldots, x_n)</math> be a nonconstant <math>n</math>-variable polynomial with real coefficients. Assume that whenever <math>r_1, r_2, \ldots , r_n</math> are real numbers, at least two of which are equal, we have <math>P(r_1, r_2, \ldots , r_n) = 0</math>. Prove that <math>P(x_1, x_2, \ldots, x_n)</math> cannot be written as the sum of fewer than <math>n!</math> monomials. (A monomial is a polynomial of the form <math>cx^{d_1}_1 x^{d_2}_2\ldots x^{d_n}_n</math>, where <math>c</math> is a nonzero real number and <math>d_1</math>, <math>d_2</math>, <math>\ldots</math>, <math>d_n</math> are nonnegative integers.)
 +
 +
[[2020 USOJMO Problems/Problem 6|Solution]]
 +
 +
 +
 +
{{MAA Notice}}
 +
 +
{| class="wikitable" style="margin:0.5em auto; font-size:95%; border:1px solid black; width:40%;"
 +
| style="background:#ccf;text-align:center;" colspan="3" | '''[[2020 USOJMO]]''' ('''[[2020 USOJMO Problems|Problems]]''' • [http://www.artofproblemsolving.com/Forum/resources.php?c=182&cid=176&year={{{year}}} Resources])
 +
|-
 +
| width="50%" align="center" rowspan="{{{rowsp|1}}}" | {{{beforetext|Preceded&nbsp;by<br/>}}}'''{{{before|[[2019 USAJMO]]}}}'''
 +
| width="50%" align="center" rowspan="{{{rowsf|1}}}" | {{{aftertext|Followed&nbsp;by<br/>}}}'''{{{after|[[2021 USAJMO]]}}}'''
 +
|-
 +
| colspan="3" style="text-align:center;" | [[2020 USOJMO Problems/Problem 1|1]] '''•''' [[2020 USOJMO Problems/Problem 2|2]] '''•''' [[2020 USOJMO Problems/Problem 3|3]] '''•''' [[2020 USOJMO Problems/Problem 4|4]] '''•''' [[2020 USOJMO Problems/Problem 5|5]] '''•''' [[2020 USOJMO Problems/Problem 6|6]]
 +
|-
 +
| colspan="3" style="text-align:center;" | '''[[USAJMO Problems and Solutions | All USAJMO Problems and Solutions]]'''
 +
|}<includeonly></includeonly><noinclude>

Revision as of 14:08, 6 July 2020

Day 1

Note: 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 $n \geq 2$ be an integer. Carl has $n$ books arranged on a bookshelf. Each book has a height and a width. No two books have the same height, and no two books have the same width. Initially, the books are arranged in increasing order of height from left to right. In a move, Carl picks any two adjacent books where the left book is wider and shorter than the right book, and swaps their locations. Carl does this repeatedly until no further moves are possible. Prove that regardless of how Carl makes his moves, he must stop after a finite number of moves, and when he does stop, the books are sorted in increasing order of width from left to right.

Solution

Problem 2

Let $\omega$ be the incircle of a fixed equilateral triangle $ABC$. Let $\ell$ be a variable line that is tangent to $\omega$ and meets the interior of segments $BC$ and $CA$ at points $P$ and $Q$, respectively. A point $R$ is chosen such that $PR = PA$ and $QR = QB$. Find all possible locations of the point $R$, over all choices of $\ell$.

Solution

Problem 3

An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:

  • The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.)
  • No two beams have intersecting interiors.
  • The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam.

What is the smallest positive number of beams that can be placed to satisfy these conditions?

Solution

Day 2

Problem 4

Let $ABCD$ be a convex quadrilateral inscribed in a circle and satisfying $DA < AB = BC < CD$. Points $E$ and $F$ are chosen on sides $CD$ and $AB$ such that $BE \perp AC$ and $EF \parallel BC$. Prove that $FB = FD$.

Solution

Problem 5

Suppose that $(a_1,b_1),$ $(a_2,b_2),$ $\dots,$ $(a_{100},b_{100})$ are distinct ordered pairs of nonnegative integers. Let $N$ denote the number of pairs of integers $(i,j)$ satisfying $1\leq i<j\leq 100$ and $|a_ib_j-a_jb_i|=1$. Determine the largest possible value of $N$ over all possible choices of the $100$ ordered pairs.

Solution

Problem 6

Let $n \geq 2$ be an integer. Let $P(x_1, x_2, \ldots, x_n)$ be a nonconstant $n$-variable polynomial with real coefficients. Assume that whenever $r_1, r_2, \ldots , r_n$ are real numbers, at least two of which are equal, we have $P(r_1, r_2, \ldots , r_n) = 0$. Prove that $P(x_1, x_2, \ldots, x_n)$ cannot be written as the sum of fewer than $n!$ monomials. (A monomial is a polynomial of the form $cx^{d_1}_1 x^{d_2}_2\ldots x^{d_n}_n$, where $c$ is a nonzero real number and $d_1$, $d_2$, $\ldots$, $d_n$ are nonnegative integers.)

Solution


The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

2020 USOJMO (Problems • Resources)
Preceded by
2019 USAJMO 		Followed by
2021 USAJMO
1 • 2 • 3 • 4 • 5 • 6
All USAJMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2020_USOJMO_Problems&oldid=127619"