olymmath

SILK-ROAD 2020

Silk Road Mathematical Competition 2020.

Other problems

Problem 1

Given a strictly increasing infinite sequence of natural numbers a1,a_1, a2,a_2, a3,a_3, …\ldots . It is known that an≤n+2020a_n \leq n + 2020 and the number n3an−1n ^ 3 a_n - 1 is divisible by an+1a_ {n + 1} for all natural numbers nn . Prove that an=na_n = n for all natural numbers nn .

Problem 2

The triangle ABCABC is inscribed in the circle ω\omega . Points K,L,MK, L, M are marked on the sides AB,BC,CAAB, BC, CA , respectively, and CM⋅CL=AM⋅BLCM \cdot CL = AM \cdot BL . Ray LKLK intersects line ACAC at point PP . The common chord of the circle ω\omega and the circumscribed circle of the triangle KMPKMP meets the segment AMAM at the point SS . Prove that SK∥BCSK \parallel BC .

Problem 3

A polynomial Q(x)=knxn+kn−1xn−1+…+k1x+k0Q (x) = k_n x ^ n + k_ {n-1} x ^ {n-1} + \ldots + k_1 x + k_0 with real coefficients is called powerful if the equality ∣k0∣=∣k1∣+∣k2∣+…+∣kn−1∣+∣kn∣| k_0 | = | k_1 | + | k_2 | + \ldots + | k_ {n-1} | + | k_n | , and non-increasing , if k0≥k1≥…≥kn−1≥knk_0 \geq k_1 \geq \ldots \geq k_ {n-1} \geq k_n . Let for the polynomial P(x)=adxd+ad−1xd−1+…+a1x+a0P (x) = a_d x ^ d + a_ {d-1} x ^ {d-1} + \ldots + a_1 x + a_0 with nonzero real coefficients, where ad>0a_d> 0 , the polynomial P(x)(x−1)t(x+1)sP (x) (x-1) ^ t (x + 1) ^ s is powerful for some non-negative integers ss and tt ( s+t>0s + t> 0 ). Prove that at least one of the polynomials P(x)P (x) and (−1)dP(−x)(- 1) ^ d P (-x) is nonincreasing.

Problem 4

Prove that for any natural number mm there exists a natural number nn such that any nn distinct points on the plane can be partitioned into mm non-empty sets whose convex hulls have a common point. The convex hull of a finite set XX of points on the plane is the set of points lying inside or on the boundary of at least one convex polygon with vertices in XX , including degenerate ones, that is, the segment and the point are considered convex polygons. No three vertices of a convex polygon are collinear. The polygon contains its border.