olymmath

CMO 2020

Chinese Mathematical Olympiad 2020.

Day 1

Problem 1

  • Day 1

Let a1,a2,⋯ ,a41∈R,a_1,a_2,\cdots,a_{41}\in\mathbb{R}, such that a41=a1,∑i=140ai=0,a_{41}=a_1, \sum_{i=1}^{40}a_i=0, and for any i=1,2,⋯ ,40,∣ai−ai+1∣≤1.i=1,2,\cdots,40, |a_i-a_{i+1}|\leq 1. Determine the greatest possible value of (1)a10+a20+a30+a40;(1)a_{10}+a_{20}+a_{30}+a_{40}; (2)a10⋅a20+a30⋅a40.(2)a_{10}\cdot a_{20}+a_{30}\cdot a_{40}.

Answer, solutions and source

Problem 2

  • Day 1

In triangle ABCABC , AB>AC.AB>AC. The bisector of ∠BAC\angle BAC meets BCBC at D.D. PP is on line DA,DA, such that AA lies between PP and DD . PQPQ is tangent to ⊙(ABD)\odot(ABD) at Q.Q. PRPR is tangent to ⊙(ACD)\odot(ACD) at R.R. CQCQ meets BRBR at K.K. The line parallel to BCBC and passing through KK meets QD,AD,RDQD,AD,RD at E,L,F,E,L,F, respectively. Prove that EL=KF.EL=KF.

Answer, solutions and source

Problem 3

  • Day 1

Let SS be a set, ∣S∣=35|S|=35 . A set FF of mappings from SS to itself is called to be satisfying property P(k)P(k) , if for any x,y∈Sx,y\in S , there exist f1,⋯ ,fk∈Ff_1, \cdots, f_k \in F (not necessarily different), such that fk(fk−1(⋯(f1(x))))=fk(fk−1(⋯(f1(y))))f_k(f_{k-1}(\cdots (f_1(x))))=f_k(f_{k-1}(\cdots (f_1(y)))) . Find the least positive integer mm , such that if FF satisfies property P(2019)P(2019) , then it also satisfies property P(m)P(m) .

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Find the largest positive constant CC such that the following is satisfied: Given nn arcs (containing their endpoints) A1,A2,…,AnA_1,A_2,\ldots ,A_n on the circumference of a circle, where among all sets of three arcs (Ai,Aj,Ak)(A_i,A_j,A_k) (1≤i<j<k≤n)(1\le i< j< k\le n) , at least half of them has Ai∩Aj∩AkA_i\cap A_j\cap A_k nonempty, then there exists l>Cnl>Cn , such that we can choose ll arcs among A1,A2,…,AnA_1,A_2,\ldots ,A_n , whose intersection is nonempty.

Answer, solutions and source

Problem 5

  • Day 2

Given any positive integer cc , denote p(c)p(c) as the largest prime factor of cc . A sequence {an}\{a_n\} of positive integers satisfies a1>1a_1>1 and an+1=an+p(an)a_{n+1}=a_n+p(a_n) for all n≥1n\ge 1 . Prove that there must exist at least one perfect square in sequence {an}\{a_n\} .

Answer, solutions and source

Problem 6

  • Day 2

Does there exist positive reals a0,a1,…,a19a_0, a_1,\ldots ,a_{19} , such that the polynomial P(x)=x20+a19x19+…+a1x+a0P(x)=x^{20}+a_{19}x^{19}+\ldots +a_1x+a_0 does not have any real roots, yet all polynomials formed from swapping any two coefficients ai,aja_i,a_j has at least one real root?

Answer, solutions and source