olymmath

EGMO 2022

European Girls' Mathematical Olympiad 2022.

Day 1

Problem 1

  • Day 1

Let ABCA B C be an acute-angled triangle in which BC<ABB C<A B and BC<CAB C<C A. Let point PP lie on segment ABA B and point QQ lie on segment ACA C such that P≠B,Q≠CP \neq B, Q \neq C and BQ=BC=CPB Q=B C=C P. Let TT be the circumcentre of triangle APQ,HA P Q, H the orthocentre of triangle ABCA B C, and SS the point of intersection of the lines BQB Q and CPC P. Prove that T,HT, H and SS are collinear.

Proposed by: Netherlands

Answer, solutions and source

Problem 2

  • Day 1
  • Answer

Let N={1,2,3,…}\mathbb{N}=\{1,2,3, \ldots\} be the set of all positive integers. Find all functions f:N→Nf: \mathbb{N} \rightarrow \mathbb{N} such that for any positive integers aa and bb, the following two conditions hold: (1) f(ab)=f(a)f(b)f(a b)=f(a) f(b), and (2) at least two of the numbers f(a),f(b)f(a), f(b) and f(a+b)f(a+b) are equal.

Proposed by: Fedir Yudin, Ukraine

Answer, solutions and source

Problem 3

  • Day 1

An infinite sequence of positive integers a1,a2,…a_{1}, a_{2}, \ldots is called good if (1) a1a_{1} is a perfect square, and (2) for any integer n≥2,ann \geq 2, a_{n} is the smallest positive integer such that

na1+(n−1)a2+…+2an−1+ann a_{1}+(n-1) a_{2}+\ldots+2 a_{n-1}+a_{n}

is a perfect square. Prove that for any good sequence a1,a2,…a_{1}, a_{2}, \ldots, there exists a positive integer kk such that an=aka_{n}=a_{k} for all integers n≥kn \geq k.

Proposed by: Joe Benton and Dominic Yeo, United Kingdom

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Given a positive integer n≥2n \geq 2, determine the largest positive integer NN for which there exist N+1N+1 real numbers a0,a1,…,aNa_{0}, a_{1}, \ldots, a_{N} such that (1) a0+a1=−1na_{0}+a_{1}=-\frac{1}{n}, and (2) (ak+ak−1)(ak+ak+1)=ak−1−ak+1\left(a_{k}+a_{k-1}\right)\left(a_{k}+a_{k+1}\right)=a_{k-1}-a_{k+1} for 1≤k≤N−11 \leq k \leq N-1.

Proposed by: Romania

Answer, solutions and source

Problem 5

  • Day 2
  • Answer

For all positive integers n,kn, k, let f(n,2k)f(n, 2 k) be the number of ways an n×2kn \times 2 k board can be fully covered by nkn k dominoes of size 2×12 \times 1. (For example, f(2,2)=2f(2,2)=2 and f(3,2)=3f(3,2)=3.) Find all positive integers nn such that for every positive integer kk, the number f(n,2k)f(n, 2 k) is odd. Proposed by: U.S.A.

Answer, solutions and source

Problem 6

  • Day 2

Let ABCDA B C D be a cyclic quadrilateral with circumcentre OO. Let the internal angle bisectors at AA and BB meet at XX, the internal angle bisectors at BB and CC meet at YY, the internal angle bisectors at CC and DD meet at ZZ, and the internal angle bisectors at DD and AA meet at WW. Further, let ACA C and BDB D meet at PP. Suppose that the points X,Y,Z,W,OX, Y, Z, W, O and PP are distinct.

Prove that O,X,Y,ZO, X, Y, Z and WW lie on the same circle if and only if P,X,Y,ZP, X, Y, Z and WW lie on the same circle.

Proposed by: Ethan Tan, Australia

Answer, solutions and source