olymmath

SILK-ROAD 2021

Silk Road Mathematical Competition 2021.

Other problems

Problem 1

Given a sequence ss consisting of digits 00 and 11 . For any positive integer kk , define vkv_k the maximum number of ways in any sequence of length kk that several consecutive digits can be identified, forming the sequence ss . (For example, if s=0110s=0110 , then v7=v8=2v_7=v_8=2 , because in sequences 01101100110110 and 0110110001101100 one can find consecutive digits 01100110 in two places, and three pairs of 01100110 cannot meet in a sequence of length 77 or 88 .) It is known that vn<vn+1<vn+2v_n<v_{n+1}<v_{n+2} for some positive integer nn . Prove that in the sequence ss , all the numbers are the same.

A. Golovanov

Problem 3

In a triangle ABCABC , MM is the midpoint of the ABAB . A point B1B_1 is marked on ACAC such that CB=CB1CB=CB_1 . Circle ω\omega and ω1\omega_1 , the circumcircles of triangles ABCABC and BMB1BMB_1 , respectively, intersect again at KK . Let QQ be the midpoint of the arc ACBACB on ω\omega . Let B1QB_1Q and BCBC intersect at EE . Prove that KCKC bisects B1EB_1E .

M. Kungozhin