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 USOMO Problems"
Line 5: Line 5:
  
 
[[2020 USOMO Problems/Problem 1|Solution]]
 
[[2020 USOMO Problems/Problem 1|Solution]]
 +
  
 
===Problem 2===
 
===Problem 2===
Line 19: Line 20:
  
 
[[2020 USOMO Problems/Problem 2|Solution]]
 
[[2020 USOMO Problems/Problem 2|Solution]]
 +
  
 
===Problem 3===
 
===Problem 3===
Line 26: Line 28:
  
 
[[2020 USOMO Problems/Problem 3|Solution]]
 
[[2020 USOMO Problems/Problem 3|Solution]]
 +
  
 
==Day 2==
 
==Day 2==
 +
 +
===Problem 4===
 +
Suppose that <math>(a_1, b_1), (a_2, b_2), \ldots , (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 \le i < j \le 100</math> and <math>|a_ib_j - a_j b_i|=1</math>. Determine the largest possible value of <math>N</math> over all possible choices of the <math>100</math> ordered pairs.
 +
 +
[[2020 USOMO Problems/Problem 4|Solution]]
 +
 +
 +
===Problem 5===
 +
 +
 +
===Problem 6===
 +
 +
{{MAA Notice}}
 +
 +
{{USAMO newbox|year= 2020 |before=[[2019 USAMO]]|after=[[2021 USAMO]]}}

Revision as of 02:13, 23 June 2020

Day 1

Problem 1

Let $ABC$ be a fixed acute triangle inscribed in a circle $\omega$ with center $O$. A variable point $X$ is chosen on minor arc $AB$ of $\omega$, and segments $CX$ and $AB$ meet at $D$. Denote by $O_1$ and $O_2$ the circumcenters of triangles $ADX$ and $BDX$, respectively. Determine all points $X$ for which the area of triangle $OO_1O_2$ is minimized.

Solution


Problem 2

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 beam is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:

$\bullet$ 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.)

$\bullet$ No two beams have intersecting interiors.

$\bullet$ 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


Problem 3

Let $p$ be an odd prime. An integer $x$ is called a quadratic non-residue if $p$ does not divide $x - t^2$ for any integer $t$.

Denote by $A$ the set of all integers $a$ such that $1 \le a < p$, and both $a$ and $4 - a$ are quadratic non-residues. Calculate the remainder when the product of the elements of $A$ is divided by $p$.

Solution


Day 2

Problem 4

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

Solution


Problem 5

Problem 6

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

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