olymmath

CN-TST 2015

China Team Selection Test 2015.

Test 1

Problem 1

  • Test 1

The circle Γ\Gamma through AA of triangle ABCABC meets sides AB,ACAB,AC at EE , FF respectively, and circumcircle of ABCABC at PP . Prove: Reflection of PP across EFEF is on BCBC if and only if Γ\Gamma passes through OO (the circumcentre of ABCABC ).

Answer, solutions and source

Problem 3

  • Test 1

Fix positive integers k,nk,n . A candy vending machine has many different colours of candy, where there are 2n2n candies of each colour. A couple of kids each buys from the vending machine 22 candies of different colours. Given that for any k+1k+1 kids there are two kids who have at least one colour of candy in common, find the maximum number of kids.

Answer, solutions and source

Problem 5

  • Test 1

FIx positive integer nn . Prove: For any positive integers a,b,ca,b,c not exceeding 3n2+4n3n^2+4n , there exist integers x,y,zx,y,z with absolute value not exceeding 2n2n and not all 00 , such that ax+by+cz=0ax+by+cz=0

Answer, solutions and source

Problem 6

  • Test 1

There are some players in a Ping Pong tournament, where every 22 players play with each other at most once. Given: (1) Each player wins at least aa players, and loses to at least bb players. ( a,b≥1a,b\geq 1 ) (2) For any two players A,BA,B , there exist some players P1,...,PkP_1,...,P_k ( k≥2k\geq 2 ) (where P1=AP_1=A , Pk=BP_k=B ), such that PiP_i wins Pi+1P_{i+1} ( i=1,2...,k−1i=1,2...,k-1 ). Prove that there exist a+b+1a+b+1 distinct players Q1,...Qa+b+1Q_1,...Q_{a+b+1} , such that QiQ_i wins Qi+1Q_{i+1} ( i=1,...,a+bi=1,...,a+b )

Answer, solutions and source

Test 2

Problem 7

  • Test 2

For a positive integer nn , and a non empty subset AA of {1,2,...,2n}\{1,2,...,2n\} , call AA good if the set {u±v∣u,v∈A}\{u\pm v|u,v\in A\} does not contain the set {1,2,...,n}\{1,2,...,n\} . Find the smallest real number cc , such that for any positive integer nn , and any good subset AA of {1,2,...,2n}\{1,2,...,2n\} , ∣A∣≤cn|A|\leq cn .

Answer, solutions and source

Problem 10

  • Test 2

Let nn be a positive integer, let f1(x),…,fn(x)f_1(x),\ldots,f_n(x) be nn bounded real functions, and let a1,…,ana_1,\ldots,a_n be nn distinct reals. Show that there exists a real number xx such that ∑i=1nfi(x)−∑i=1nfi(x−ai)<1\sum^n_{i=1}f_i(x)-\sum^n_{i=1}f_i(x-a_i)<1 .

Answer, solutions and source

Problem 11

  • Test 2

Set SS to be a subset of size 6868 of {1,2,...,2015}\{1,2,...,2015\} . Prove that there exist 33 pairwise disjoint, non-empty subsets A,B,CA,B,C such that ∣A∣=∣B∣=∣C∣|A|=|B|=|C| and ∑a∈Aa=∑b∈Bb=∑c∈Cc\sum_{a\in A}a=\sum_{b\in B}b=\sum_{c\in C}c

Answer, solutions and source

Test 3

Problem 13

  • Test 3

△ABC\triangle{ABC} is isosceles with AB=AC>BCAB = AC >BC . Let DD be a point in its interior such that DA=DB+DCDA = DB+DC . Suppose that the perpendicular bisector of ABAB meets the external angle bisector of ∠ADB\angle{ADB} at PP , and let QQ be the intersection of the perpendicular bisector of ACAC and the external angle bisector of ∠ADC\angle{ADC} . Prove that B,C,P,QB,C,P,Q are concyclic.

Answer, solutions and source

Problem 14

  • Test 3

Let XX be a non-empty and finite set, A1,...,AkA_1,...,A_k kk subsets of XX , satisying:

(1) ∣Ai∣≤3,i=1,2,...,k|A_i|\leq 3,i=1,2,...,k (2) Any element of XX is an element of at least 44 sets among A1,....,AkA_1,....,A_k .

Show that one can select [3k7][\frac{3k}{7}] sets from A1,...,AkA_1,...,A_k such that their union is XX .

Answer, solutions and source

Problem 15

  • Test 3

Let a,ba,b be two integers such that their gcd has at least two prime factors. Let S={x∣x∈N,x≡a(modb)}S = \{ x \mid x \in \mathbb{N}, x \equiv a \pmod b \} and call y∈Sy \in S irreducible if it cannot be expressed as product of two or more elements of SS (not necessarily distinct). Show there exists tt such that any element of SS can be expressed as product of at most tt irreducible elements.

Answer, solutions and source

Problem 17

  • Test 3

Let GG be the complete graph on 20152015 vertices. Each edge of GG is dyed red, blue or white. For a subset VV of vertices of GG , and a pair of vertices (u,v)(u,v) , define L(u,v)={u,v}∪{w∣w∈V∋△uvw has exactly 2 red sides}L(u,v) = \{ u,v \} \cup \{ w | w \in V \ni \triangle{uvw} \text{ has exactly 2 red sides} \}Prove that, for any choice of VV , there exist at least 120120 distinct values of L(u,v)L(u,v) .

Answer, solutions and source