olymmath

USEMO 2019

US Ersatz Math Olympiad 2019.

Day 1

Problem 1

  • Day 1

Let ABCDABCD be a cyclic quadrilateral. A circle centered at OO passes through BB and DD and meets lines BABA and BCBC again at points EE and FF (distinct from A,B,CA,B,C ). Let HH denote the orthocenter of triangle DEF.DEF. Prove that if lines AC,AC, DO,DO, EFEF are concurrent, then triangle ABCABC and EHFEHF are similar.

Robin Son

Answer, solutions and source

Problem 2

  • Day 1

Let Z[x]\mathbb{Z}[x] denote the set of single-variable polynomials in xx with integer coefficients. Find all functions θ:Z[x]→Z[x]\theta : \mathbb{Z}[x] \to \mathbb{Z}[x] (i.e. functions taking polynomials to polynomials) such that

  • for any polynomials p,q∈Z[x]p, q \in \mathbb{Z}[x] , θ(p+q)=θ(p)+θ(q)\theta(p + q) = \theta(p) + \theta(q) ;
  • for any polynomial p∈Z[x]p \in \mathbb{Z}[x] , pp has an integer root if and only if θ(p)\theta(p) does.

Carl Schildkraut

Answer, solutions and source

Problem 3

  • Day 1

Consider an infinite grid G\mathcal G of unit square cells. A chessboard polygon is a simple polygon (i.e. not self-intersecting) whose sides lie along the gridlines of G\mathcal G .

Nikolai chooses a chessboard polygon FF and challenges you to paint some cells of G\mathcal G green, such that any chessboard polygon congruent to FF has at least 11 green cell but at most 20202020 green cells. Can Nikolai choose FF to make your job impossible?

Nikolai Beluhov

Answer, solutions and source

Day 2