olymmath

SILK-ROAD 2022

Silk Road Mathematical Competition 2022.

Other problems

Problem 1

Convex quadrilateral ABCDABCD is inscribed in circle w.w. Rays ABAB and DCDC intersect at K. LK.\ L is chosen on the diagonal BDBD so that ∠BAC=∠DAL. M\angle BAC= \angle DAL.\ M is chosen on the segment KLKL so that CM∣∣BD.CM \mid\mid BD. Prove that line BMBM touches w.w. (Kungozhin M.)

Problem 2

Distinct positive integers AA and BB are given .. Prove that there exist infinitely many positive integers that can be represented both as x12+Ay12x_{1}^2+Ay_{1}^2 for some positive coprime integers x1x_{1} and y1,y_{1}, and as x22+By22x_{2}^2+By_{2}^2 for some positive coprime integers x2x_{2} and y2.y_{2}. (Golovanov A.S.)

Problem 3

In an infinite sequence {α},{α2},{α3},⋯\{\alpha\}, \{\alpha^2\}, \{\alpha^3\}, \cdots there are finitely many distinct values .. Show that α\alpha is an integer .({x}. (\{x\} denotes the fractional part of x.)x.) (Golovanov A.S.)

Problem 4

In a language ,, an alphabet with 2525 letters is used ;; words are exactly all sequences of (( not necessarily different )) letters of length 17.17. Two ends of a paper strip are glued so that the strip forms a ring ;; the strip bears a sequence of 5185^{18} letters .. Say that a word is singular if one can cut a piece bearing exactly that word from the strip ,, but one cannot cut out two such non-overlapping pieces .. It is known that one can cut out 5165^{16} non-overlapping pieces each containing the same word .. Determine the largest possible number of singular words .. (Bogdanov I.)