AoPS Community 2012 China Team Selection Test

China Team Selection Test 2012

www.artofproblemsolving.com/community/c4968
by yunxiu, littletush

– TST 1

Day 1

n n
Complex numbers xi , yi satisfy |xi | = |yi | = 1 for i = 1, 2, . . . , n. Let x = 1
xi , y = 1
P P
1 n n yi
i=1 i=1
n
and zi = xyi + yxi − xi yi . Prove that
P
|zi | 6 n.
i=1

2 Given a scalene triangle ABC. Its incircle touches BC, AC, AB at D, E, F respectvely. Let
L, M, N be the symmetric points of D with EF ,of E with F D,of F with DE,respectively. Line
AL intersects BC at P ,line BM intersects CA at Q,line CN intersects AB at R. Prove that
P, Q, R are collinear.

Let xn = 2n n for all n ∈ Z . Prove there exist infinitely many finite sets A, B of positive
+


3
integers, satisfying A ∩ B = ∅, and Q
xi
i∈A
Q = 2012.
xj
j∈B

Day 2

1 Given two circles ω1 , ω2 , S denotes all ∆ABC satisfies that ω1 is the circumcircle of ∆ABC,
ω2 is the A- excircle of ∆ABC , ω2 touches BC, CA, AB at D, E, F . S is not empty, prove that
the centroid of ∆DEF is a fixed point.

2 For a positive integer n, denote by τ (n) the number of its positive divisors. For a positive integer
n, if τ (m) < τ (n) for all m < n, we call n a good number. Prove that for any positive integer k,
there are only finitely many good numbers not divisible by k.

3 n being a given integer, find all functions f : Z → Z, such that for all integers x, y we have
f (x + y + f (y)) = f (x) + ny.

– TST 2

Day 1

© 2019 AoPS Incorporated 1

AoPS Community 2012 China Team Selection Test

1 In a simple graph G, we call t pairwise adjacent vertices a t-clique. If a vertex is connected with
all other vertices in the graph, we call it a central vertex. Given are two integers n, k such that
3 1
≤ n < k < n. Let G be a graph on n vertices such that
2 2
(1) G does not contain a (k + 1)-clique;
(2) if we add an arbitrary edge to G, that creates a (k + 1)-clique.
Find the least possible number of central vertices in G.

2 Prove that there exists a positive real number C with the following property: for any integer
n ≥ 2 and any subset X of the set {1, 2, . . . , n} such that |X| ≥ 2, there exist x, y, z, w ∈ X(not
necessarily distinct) such that
0 < |xy − zw| < Cα−4
|X|
where α = n .

3 Let a1 < a2 be two given integers. For any integer n ≥ 3, let an be the smallest integer which is
larger than an−1 and can be uniquely represented as ai +aj , where 1 ≤ i < j ≤ n−1. Given that
there are only a finite number of even numbers in {an }, prove that the sequence {an+1 − an } is
eventually periodic, i.e. that there exist positive integers T, N such that for all integers n > N ,
we have
aT +n+1 − aT +n = an+1 − an .

Day 2

1 Given an integer n ≥ 2. Prove that there only exist a finite number of n-tuples of positive
integers (a1 , a2 , . . . , an ) which simultaneously satisfy the following three conditions:
- a1 > a2 > . . . > an ;
- gcd(aP
1 , a2 , . . . , an ) = 1;
- a1 = ni=1 gcd(ai , ai+1 ),where an+1 = a1 .

2 Given two integers m, n which are greater than 1. r, s are two given positive real numbers such
that r < s. For all aij ≥ 0 which are not all zeroes,find the maximal value of the expression

( nj=1 ( m s rs r1
P P
i=1 aij ) )
f = Pm Pn s 1 .
( i=1 ) j=1 arij ) r ) s

3 Given an integer n ≥ 2, a function f : Z → {1, 2, . . . , n} is called good, if for any integer

k, 1 ≤ k ≤ n − 1 there exists an integer j(k) such that for every integer m we have

f (m + j(k)) ≡ f (m + k) − f (m) (mod n + 1).

© 2019 AoPS Incorporated 2

AoPS Community 2012 China Team Selection Test

Find the number of good functions.

– TST 3

Day 1

1 In an acute-angled ABC, ∠A > 60◦ , H is its orthocenter. M, N are two points on AB, AC
respectively, such that ∠HM B = ∠HN C = 60◦ . Let O be the circumcenter of triangle HM N .
D is a point on the same side with A of BC such that 4DBC is an equilateral triangle. Prove
that H, O, D are collinear.

2 Given an integer k ≥ 2. Prove that there exist k pairwise distinct positive integers a1 , a2 , . . . , ak
such that for any Qk non-negative
Qk integers b1 , b2 , . . . , bk , c1 , c2 , . . . , ck satisfying a1 ≤ bi ≤ 2ai , i =
ci
1, 2, . . . , k and i=1 bi < i=1 bi , we have
k
Y k
Y
k bci i < bi .
i=1 i=1

3 Find the smallest possible value of a real number c such that for any 2012-degree monic poly-
nomial
P (x) = x2012 + a2011 x2011 + . . . + a1 x + a0
with real coefficients, we can obtain a new polynomial Q(x) by multiplying some of its coeffi-
cients by −1 such that every root z of Q(x) satisfies the inequality

|Im z| ≤ c |Re z| .

Day 2

1 Given an integer n ≥ 4. S = {1, 2, . . . , n}. A, B are two subsets of S such that for every pair of
(a, b), a ∈ A, b ∈ B, ab + 1 is a perfect square. Prove that

min{|A|, |B|} ≤ log2 n.

2 Find all integers k ≥ 3 with the following property: There exist integers m, n such that 1 < m <
k, 1 < n < k, gcd(m, k) = gcd(n, k) = 1, m + n > k and k | (m − 1)(n − 1).

3 In some squares of a 2012 × 2012 grid there are some beetles, such that no square contain
more than one beetle. At one moment, all the beetles fly off the grid and then land on the grid
again, also satisfying the condition that there is at most one beetle standing in each square.

© 2019 AoPS Incorporated 3

AoPS Community 2012 China Team Selection Test

The vector from the centre of the square from which a beetle B flies to the centre of the square
on which it lands is called the translation vector of beetle B.
For all possible starting and ending configurations, find the maximum length of the sum of the
translation vectors of all beetles.

© 2019 AoPS Incorporated 4

Art of Problem Solving is an ACS WASC Accredited School.