olymmath

USEMO 2020

US Ersatz Math Olympiad 2020.

Day 1

Problem 1

  • Day 1

Which positive integers can be written in the form lcm⁡(x,y)+lcm⁡(y,z)lcm⁡(x,z)\frac{\operatorname{lcm}(x, y) + \operatorname{lcm}(y, z)}{\operatorname{lcm}(x, z)} for positive integers xx , yy , zz ?

Answer, solutions and source

Problem 2

  • Day 1

Calvin and Hobbes play a game. First, Hobbes picks a family FF of subsets of {1,2,...,2020}\{1, 2, . . . , 2020\} , known to both players. Then, Calvin and Hobbes take turns choosing a number from {1,2,...,2020}\{1, 2, . . . , 2020\} which is not already chosen, with Calvin going first, until all numbers are taken (i.e., each player has 10101010 numbers). Calvin wins if he has chosen all the elements of some member of FF , otherwise Hobbes wins. What is the largest possible size of a family FF that Hobbes could pick while still having a winning strategy?

Answer, solutions and source

Problem 3

  • Day 1

Let ABCABC be an acute triangle with circumcenter OO and orthocenter HH . Let Γ\Gamma denote the circumcircle of triangle ABCABC , and NN the midpoint of OHOH . The tangents to Γ\Gamma at BB and CC , and the line through HH perpendicular to line ANAN , determine a triangle whose circumcircle we denote by ωA\omega_A . Define ωB\omega_B and ωC\omega_C similarly. Prove that the common chords of ωA\omega_A , ωB\omega_B and ωC\omega_C are concurrent on line OHOH .

Proposed by Anant Mudgal

Answer, solutions and source

Day 2