olymmath

CN-TST 2020

China Team Selection Test 2020.

Other problems

Problem 1

Let ω\omega be a nn -th primitive root of unity. Given complex numbers a1,a2,⋯ ,ana_1,a_2,\cdots,a_n , and pp of them are non-zero. Let bk=∑i=1naiωkib_k=\sum_{i=1}^n a_i \omega^{ki} for k=1,2,⋯ ,nk=1,2,\cdots, n . Prove that if p>0p>0 , then at least np\tfrac{n}{p} numbers in b1,b2,⋯ ,bnb_1,b_2,\cdots,b_n are non-zero.

Problem 2

Given an isosceles triangle △ABC\triangle ABC , AB=ACAB=AC . A line passes through MM , the midpoint of BCBC , and intersects segment ABAB and ray CACA at DD and EE , respectively. Let FF be a point of MEME such that EF=DMEF=DM , and KK be a point on MDMD . Let Γ1\Gamma_1 be the circle passes through B,D,KB,D,K and Γ2\Gamma_2 be the circle passes through C,E,KC,E,K . Γ1\Gamma_1 and Γ2\Gamma_2 intersect again at L≠KL \neq K . Let ω1\omega_1 and ω2\omega_2 be the circumcircle of △LDE\triangle LDE and △LKM\triangle LKM . Prove that, if ω1\omega_1 and ω2\omega_2 are symmetric wrt LL , then BFBF is perpendicular to BCBC .

Problem 3

For a non-empty finite set AA of positive integers, let lcm(A)\text{lcm}(A) denote the least common multiple of elements in AA , and let d(A)d(A) denote the number of prime factors of lcm(A)\text{lcm}(A) (counting multiplicity). Given a finite set SS of positive integers, and fS(x)=∑∅≠A⊂S(−1)∣A∣xd(A)lcm(A).f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}. Prove that, if 0≤x≤20 \le x \le 2 , then −1≤fS(x)≤0-1 \le f_S(x) \le 0 .

Problem 4

Show that the following equation has finitely many solutions (t,A,x,y,z)(t,A,x,y,z) in positive integers t(1−A−2)(1−x−2)(1−y−2)(1−z−2)=(1+x−1)(1+y−1)(1+z−1)\sqrt{t(1-A^{-2})(1-x^{-2})(1-y^{-2})(1-z^{-2})}=(1+x^{-1})(1+y^{-1})(1+z^{-1})

Problem 5

Let a1,a2,⋯ ,ana_1,a_2,\cdots,a_n be a permutation of 1,2,⋯ ,n1,2,\cdots,n . Among all possible permutations, find the minimum of ∑i=1nmin⁡{ai,2i−1}.\sum_{i=1}^n \min \{ a_i,2i-1 \}.

Problem 6

Given a simple, connected graph with nn vertices and mm edges. Prove that one can find at least mm ways separating the set of vertices into two parts, such that the induced subgraphs on both parts are connected.