olymmath

OIM 2019

Iberoamerican Mathematical Olympiad 2019.

Other problems

Problem 1

For each positive integer nn , let s(n)s(n) be the sum of the squares of the digits of nn . For example, s(15)=12+52=26s(15)=1^2+5^2=26 . Determine all integers n≥1n\geq 1 such that s(n)=ns(n)=n .

Problem 2

Determine all polynomials P(x)P(x) with degree n≥1n\geq 1 and integer coefficients so that for every real number xx the following condition is satisfied P(x)=(x−P(0))(x−P(1))(x−P(2))⋯(x−P(n−1))P(x)=(x-P(0))(x-P(1))(x-P(2))\cdots (x-P(n-1))

Problem 3

Let Γ\Gamma be the circumcircle of triangle ABCABC . The line parallel to ACAC passing through BB meets Γ\Gamma at DD ( D≠BD\neq B ), and the line parallel to ABAB passing through CC intersects Γ\Gamma to EE ( E≠CE\neq C ). Lines ABAB and CDCD meet at PP , and lines ACAC and BEBE meet at QQ . Let MM be the midpoint of DEDE . Line AMAM meets Γ\Gamma at YY ( Y≠AY\neq A ) and line PQPQ at JJ . Line PQPQ intersects the circumcircle of triangle BCJBCJ at ZZ ( Z≠JZ\neq J ). If lines BQBQ and CPCP meet each other at XX , show that XX lies on the line YZYZ .

Problem 4

Let ABCDABCD be a trapezoid with AB∥CDAB\parallel CD and inscribed in a circumference Γ\Gamma . Let PP and QQ be two points on segment ABAB ( AA , PP , QQ , BB appear in that order and are distinct) such that AP=QBAP=QB . Let EE and FF be the second intersection points of lines CPCP and CQCQ with Γ\Gamma , respectively. Lines ABAB and EFEF intersect at GG . Prove that line DGDG is tangent to Γ\Gamma .

Problem 5

Don Miguel places a token in one of the (n+1)2(n+1)^2 vertices determined by an n×nn \times n board. A move consists of moving the token from the vertex on which it is placed to an adjacent vertex which is at most 2\sqrt2 away, as long as it stays on the board. A path is a sequence of moves such that the token was in each one of the (n+1)2(n+1)^2 vertices exactly once. What is the maximum number of diagonal moves (those of length 2\sqrt2 ) that a path can have in total?

Problem 6

Let a1,a2,…,a2019a_1, a_2, \dots, a_{2019} be positive integers and PP a polynomial with integer coefficients such that, for every positive integer nn , P(n) divides a1n+a2n+⋯+a2019n.P(n) \text{ divides } a_1^n+a_2^n+\dots+a_{2019}^n. Prove that PP is a constant polynomial.