olymmath

HMIC 2019

HMMT Invitational Competition 2019.

Other problems

Problem 1

Let ABCA B C be an acute scalene triangle with incenter II. Show that the circumcircle of BICB I C intersects the Euler line of ABCA B C in two distinct points. (Recall that the Euler line of a scalene triangle is the line that passes through its circumcenter, centroid, orthocenter, and the nine-point center.)

Problem 2

Annie has a permutation (a1,a2,…,a2019)\left(a_{1}, a_{2}, \ldots, a_{2019}\right) of S={1,2,…,2019}S=\{1,2, \ldots, 2019\}, and Yannick wants to guess her permutation. With each guess Yannick gives Annie an nn-tuple ( y1,y2,…,y2019y_{1}, y_{2}, \ldots, y_{2019} ) of integers in SS, and then Annie gives the number of indices i∈Si \in S such that ai=yia_{i}=y_{i}. (a) Show that Yannick can always guess Annie's permutation with at most 1200000 guesses. (b) Show that Yannick can always guess Annie's permutation with at most 24000 guesses.

Problem 3

Do there exist four points Pi=(xi,yi)∈R2(1≤i≤4)P_{i}=\left(x_{i}, y_{i}\right) \in \mathbb{R}^{2}(1 \leq i \leq 4) on the plane such that:

  • for all i=1,2,3,4i=1,2,3,4, the inequality xi4+yi4≤xi3+yi3x_{i}^{4}+y_{i}^{4} \leq x_{i}^{3}+y_{i}^{3} holds, and
  • for all i≠ji \neq j, the distance between PiP_{i} and PjP_{j} is greater than 1?

Problem 4

A cactus is a finite simple connected graph where no two cycles share an edge. Show that in a nonempty cactus, there must exist a vertex which is part of at most one cycle.

Problem 5

Let p=2017p=2017 be a prime and Fp\mathbb{F}_{p} be the integers modulo pp. A function f:Z→Fpf: \mathbb{Z} \rightarrow \mathbb{F}_{p} is called good if there is α∈Fp\alpha \in \mathbb{F}_{p} with α≢0( mod p)\alpha \not \equiv 0(\bmod p) such that

f(x)f(y)=f(x+y)+αyf(x−y)( mod p)f(x) f(y)=f(x+y)+\alpha^{y} f(x-y) (\bmod p)

for all x,y∈Zx, y \in \mathbb{Z}. How many good functions are there that are periodic with minimal period 2016 ?