olymmath

CMO 2021

Chinese Mathematical Olympiad 2021.

Day 1

Problem 1

  • Day 1

Let {zn}n≥1\{ z_n \}_{n \ge 1} be a sequence of complex numbers, whose odd terms are real, even terms are purely imaginary, and for every positive integer kk , ∣zkzk+1∣=2k|z_k z_{k+1}|=2^k . Denote fn=∣z1+z2+⋯+zn∣,f_n=|z_1+z_2+\cdots+z_n|, for n=1,2,⋯n=1,2,\cdots (1) Find the minimum of f2020f_{2020} . (2) Find the minimum of f2020⋅f2021f_{2020} \cdot f_{2021} .

Answer, solutions and source

Problem 2

  • Day 1

Let m>1m>1 be an integer. Find the smallest positive integer nn , such that for any integers a1,a2,…,an;b1,b2,…,bna_1,a_2,\ldots ,a_n; b_1,b_2,\ldots ,b_n there exists integers x1,x2,…,xnx_1,x_2,\ldots ,x_n satisfying the following two conditions:

i) There exists i∈{1,2,…,n}i\in \{1,2,\ldots ,n\} such that xix_i and mm are coprime

ii) ∑i=1naixi≡∑i=1nbixi≡0(modm)\sum^n_{i=1} a_ix_i \equiv \sum^n_{i=1} b_ix_i \equiv 0 \pmod m

Answer, solutions and source

Problem 3

  • Day 1

Let nn be positive integer such that there are exactly 36 different prime numbers that divides n.n. For k=1,2,3,4,5,k=1,2,3,4,5, cnc_n be the number of integers that are mutually prime numbers to nn in the interval [(k−1)n5,kn5].[\frac{(k-1)n}{5},\frac{kn}{5}] . c1,c2,c3,c4,c5c_1,c_2,c_3,c_4,c_5 is not exactly the same.Prove that ∑1≤i<j≤5(ci−cj)2≥236.\sum_{1\le i<j\le 5}(c_i-c_j)^2\geq 2^{36}.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

In acute triangle ABC(AB>AC)ABC (AB>AC) , MM is the midpoint of minor arc BCBC , OO is the circumcenter of (ABC)(ABC) and AKAK is its diameter. The line parallel to AMAM through OO meets segment ABAB at DD , and CACA extended at EE . Lines BMBM and CKCK meet at PP , lines BKBK and CMCM meet at QQ . Prove that ∠OPB+∠OEB=∠OQC+∠ODC\angle OPB+\angle OEB =\angle OQC+\angle ODC .

Answer, solutions and source

Problem 5

  • Day 2

PP is a convex polyhedron such that:(1) every vertex belongs to exactly 33 faces.(1) For every natural number nn , there are even number of faces with nn vertices.

An ant walks along the edges of PP and forms a non-self-intersecting cycle, which divides the faces of this polyhedron into two sides, such that for every natural number nn , the number of faces with nn vertices on each side are the same. (assume this is possible)

Show that the number of times the ant turns left is the same as the number of times the ant turn right.

Answer, solutions and source

Problem 6

  • Day 2

Find f:Z+→Z+f: \mathbb{Z}_+ \rightarrow \mathbb{Z}_+ , such that for any x,y∈Z+x,y \in \mathbb{Z}_+ , f(f(x)+y)∣x+f(y).f(f(x)+y)\mid x+f(y).

Answer, solutions and source