2019 China Team Selection Test: 1 2 N 1 2 N 1 2 N 1 2 N I N I 1 I N I 1 N I 1 I N I 1 I
2019 China Team Selection Test: 1 2 N 1 2 N 1 2 N 1 2 N I N I 1 I N I 1 N I 1 I N I 1 I
– Test 1 Day 1
2 Fix a positive integer n ≥ 3. Does there exist infinitely many sets S of positive
integers {a1 , a2 , . . . , an , b1 , b2 , . . . , bn }, such that gcd(a an , b1 , b2 , . . . , bn ) =
Q1 , a2 , . . . , Q
1, {ai }ni=1 , {bi }ni=1 are arithmetic progressions, and ni=1 ai = ni=1 bi ?
3 Find all positive integer n, such that there exists n points P1 , . . . , Pn on the
unit
Pn circlek , satisfying the condition that for any point M on the unit circle,
i=1 M Pi is a fixed value for
a) k = 2018
b) k = 2019.
– Test 1 Day 2
4 Call a sequence of positive integers {an } good if for any distinct positive integers
m, n, one has
Call a positive integer a to be k-good if there exists a good sequence such that
ak = a. Does there exists a k such that there are exactly 2019 k-good positive
integers?
6 Let k be a positive real. A and B play the following game: at the start, there
are 80 zeroes arrange around a circle. Each turn, A increases some of these 80
numbers, such that the total sum added is 1. Next, B selects ten consecutive
www.artofproblemsolving.com/community/c848182
Contributors: MathStudent2002, 61plus, fattypiggy123, mofumofu, sqing, liekkas
2019 China Team Selection Test
numbers with the largest sum, and reduces them all to 0. A then wins the game
if he/she can ensure that at least one of the number is ≥ k at some finite point
of time.
Determine all k such that A can always win the game.
– Test 2 Day 1
2 Let S be the set of 10-tuples of non-negative integers that have sum 2019. For
any tuple in S, if one of the numbers in the tuple is ≥ 9, then we can subtract
9 from it, and add 1 to the remaining numbers in the tuple. Call thus one
operation. If for A, B ∈ S we can get from A to B in finitely many operations,
then denote A → B.
(1) Find the smallest integer k, such that if the minimum number in A, B ∈ S
respectively are both ≥ k, then A → B implies B → A.
(2) For the k obtained in (1), how many tuples can we pick from S, such that
any two of these tuples A, B that are distinct, A 6→ B.
– Test 2 Day 2
4 Does there exist a finite set A of positive integers of at least two elements and
an infinite set B of positive integers, such that any two distinct elements in
A + B are coprime, and for any coprime positive integers m, n, there exists an
element x in A + B satisfying x ≡ n (mod m) ?
Here A + B = {a + b|a ∈ A, b ∈ B}.
5 Let M be the midpoint of BC of triangle ABC. The circle with diameter BC,
ω, meets AB, AC at D, E respectively. P lies inside △ABC such that ∠P BA =
∠P AC, ∠P CA = ∠P AB, and 2P M · DE = BC 2 . Point X lies outside ω such
that XM k AP , and XB AB
XC = AC . Prove that ∠BXC + ∠BAC = 90 .
◦
www.artofproblemsolving.com/community/c848182
Contributors: MathStudent2002, 61plus, fattypiggy123, mofumofu, sqing, liekkas
2019 China Team Selection Test
6 Given coprime positive integers p, q > 1, call all positive integers that cannot be
written as px + qy(where x, y are non-negative integers) bad, and define S(p, q)
to be the sum of all bad numbers raised to the power of 2019. Prove that there
exists a positive integer n, such that for any p, q as described, (p − 1)(q − 1)
divides nS(p, q).
– Test 3 Day 1
|x3 + y 3 + z 3 − 3xyz| ≤ 1
– Test 3 Day 2
www.artofproblemsolving.com/community/c848182
Contributors: MathStudent2002, 61plus, fattypiggy123, mofumofu, sqing, liekkas
2019 China Team Selection Test
6 Given positive integers d ≥ 3, r > 2 and l, with 2d ≤ l < rd. Every vertice
of the graph G(V, E) is assigned to a positive integer in {1, 2, · · · , l}, such that
for any two consecutive vertices in the graph, the integers they are assigned to,
respectively, have difference no less than d, and no more than l − d.
A proper coloring of the graph is a coloring of the vertices, such that any two
consecutive vertices are not the same color. It’s given that there exist a proper
subset A of V , such that for G’s any proper coloring with r − 1 colors, and for
an arbitrary color C, either all numbers in color C appear in A, or none of the
numbers in color C appear in A.
Show that G has a proper coloring within r − 1 colors.
– Test 4 Day 1
2 A graph G(V, E) is triangle-free, but adding any edges to the graph will form
a triangle. It’s given that |V | = 2019, |E| > 2018, find the minimum of |E| .
3 60 points lie on the plane, such that no three points are collinear. Prove that
one can divide the points into 20 groups, with 3 points in each group, such that
the triangles ( 20 in total) consist of three points in a group have a non-empty
intersection.
– Test 4 Day 2
4 Prove that there exist a subset A of {1, 2, · · · , 2n } with n elements, such that
for any two different non-empty subset of A, the sum of elements of one subset
doesn’t divide another’s.
5 Find all integer n such that the following property holds: for any positive real
numbers a, b, c, x, y, z, with max(a, b, c, x, y, z) = a , a + b + c = x + y + z and
abc = xyz, the inequality
a n + bn + c n ≥ x n + y n + z n
www.artofproblemsolving.com/community/c848182
Contributors: MathStudent2002, 61plus, fattypiggy123, mofumofu, sqing, liekkas
2019 China Team Selection Test
holds.
6 Given positive integer n, k such that 2 ≤ n < 2k . Prove that there exist a
subset A of {0, 1, · · · , n} such that for any x 6= y ∈ A, xy is even, and
k
⌊ k2 ⌋
|A| ≥ · (n + 1)
2k
www.artofproblemsolving.com/community/c848182
Contributors: MathStudent2002, 61plus, fattypiggy123, mofumofu, sqing, liekkas