olymmath

CN-TST 2017

China Team Selection Test 2017.

Test 1

Test 2

Problem 7

  • Test 2

Let nn be a positive integer. Let DnD_n be the set of all divisors of nn and let f(n)f(n) denote the smallest natural mm such that the elements of DnD_n are pairwise distinct in mod mm . Show that there exists a natural NN such that for all n≥Nn \geq N , one has f(n)≤n0.01f(n) \leq n^{0.01} .

Answer, solutions and source

Problem 8

  • Test 2

20172017 engineers attend a conference. Any two engineers if they converse, converse with each other in either Chinese or English. No two engineers converse with each other more than once. It is known that within any four engineers, there was an even number of conversations and furthermore within this even number of conversations:

i) At least one conversation is in Chinese. ii) Either no conversations are in English or the number of English conversations is at least that of Chinese conversations.

Show that there exists 673673 engineers such that any two of them conversed with each other in Chinese.

Answer, solutions and source

Problem 9

  • Test 2

Let ABCDABCD be a quadrilateral and let ll be a line. Let ll intersect the lines AB,CD,BC,DA,AC,BDAB,CD,BC,DA,AC,BD at points X,X′,Y,Y′,Z,Z′X,X',Y,Y',Z,Z' respectively. Given that these six points on ll are in the order X,Y,Z,X′,Y′,Z′X,Y,Z,X',Y',Z' , show that the circles with diameter XX′,YY′,ZZ′XX',YY',ZZ' are coaxal.

Answer, solutions and source

Problem 12

  • Test 2

Let MM be a subset of R\mathbb{R} such that the following conditions are satisfied:

a) For any x∈M,n∈Zx \in M, n \in \mathbb{Z} , one has that x+n∈Mx+n \in \mathbb{M} . b) For any x∈Mx \in M , one has that −x∈M-x \in M . c) Both MM and R\mathbb{R} \ MM contain an interval of length larger than 00 .

For any real xx , let M(x)={n∈Z+∣nx∈M}M(x) = \{ n \in \mathbb{Z}^{+} | nx \in M \} . Show that if α,β\alpha,\beta are reals such that M(α)=M(β)M(\alpha) = M(\beta) , then we must have one of α+β\alpha + \beta and α−β\alpha - \beta to be rational.

Answer, solutions and source

Test 3

Test 4

Problem 19

  • Test 4

Prove that : ∑k=058C2017+k58−kC2075−kk=∑p=029C4091−2p58−2p\sum_{k=0}^{58}C_{2017+k}^{58-k}C_{2075-k}^{k}=\sum_{p=0}^{29}C_{4091-2p}^{58-2p}

Answer, solutions and source

Problem 20

  • Test 4

In ΔABC\varDelta{ABC} ,the excircle of AA is tangent to segment BCBC ,line ABAB and ACAC at E,D,FE,D,F respectively. EZEZ is the diameter of the circle. B1B_1 and C1C_1 are on DFDF , and BB1⊥BCBB_1\perp{BC} , CC1⊥BCCC_1\perp{BC} .Line ZB1,ZC1ZB_1,ZC_1 intersect BCBC at X,YX,Y respectively.Line EZEZ and line DFDF intersect at HH , ZKZK is perpendicular to FDFD at KK .If HH is the orthocenter of ΔXYZ\varDelta{XYZ} ,prove that: H,K,X,YH,K,X,Y are concyclic.

Answer, solutions and source

Problem 21

  • Test 4

Find the numbers of ordered array (x1,...,x100)(x_1,...,x_{100}) that satisfies the following conditions: ( ii ) x1,...,x100∈{1,2,..,2017}x_1,...,x_{100}\in\{1,2,..,2017\} ; ( iiii ) 2017∣x1+...+x1002017|x_1+...+x_{100} ; ( iiiiii ) 2017∣x12+...+x10022017|x_1^2+...+x_{100}^2 .

Answer, solutions and source

Problem 22

  • Test 4

Given integer d>1,md>1,m ,prove that there exists integer k>l>0k>l>0 , such that (22k+d,22l+d)>m.(2^{2^k}+d,2^{2^l}+d)>m.

Answer, solutions and source

Problem 23

  • Test 4

Given integer m≥2m\geq2 , x1,...,xmx_1,...,x_m are non-negative real numbers,prove that: (m−1)m−1(x1m+...+xmm)≥(x1+...+xm)m−mmx1...xm(m-1)^{m-1}(x_1^m+...+x_m^m)\geq(x_1+...+x_m)^m-m^mx_1...x_m and please find out when the equality holds.

Answer, solutions and source

Problem 24

  • Test 4

A plane has no vertex of a regular dodecahedron on it,try to find out how many edges at most may the plane intersect the regular dodecahedron?

Answer, solutions and source

Test 5

Problem 25

  • Test 5

Given n≥3n\ge 3 . consider a sequence a1,a2,...,ana_1,a_2,...,a_n , if (ai,aj,ak)(a_i,a_j,a_k) with i+k=2j (i<j<k) and ai+ak≠2aja_i+a_k\ne 2a_j , we call such a triple a NOT−APNOT-AP triple. If a sequence has at least one NOT−APNOT-AP triple, find the least possible number of the NOT−APNOT-AP triple it contains.

Answer, solutions and source

Problem 26

  • Test 5

Find the least positive number m such that for any polynimial f(x) with real coefficients, there is a polynimial g(x) with real coefficients (degree not greater than m) such that there exist 2017 distinct number a1,a2,...,a2017a_1,a_2,...,a_{2017} such that g(ai)=f(ai+1)g(a_i)=f(a_{i+1}) for i=1,2,...,2017 where indices taken modulo 2017.

Answer, solutions and source

Problem 27

  • Test 5

For a rational point (x,y), if xy is an integer that divided by 2 but not 3, color (x,y) red, if xy is an integer that divided by 3 but not 2, color (x,y) blue. Determine whether there is a line segment in the plane such that it contains exactly 2017 blue points and 58 red points.

Answer, solutions and source

Problem 28

  • Test 5

Given a circle with radius 1 and 2 points C, D given on it. Given a constant l with 0<l≤20<l\le 2 . Moving chord of the circle AB=l and ABCD is a non-degenerated convex quadrilateral. AC and BD intersects at P. Find the loci of the circumcenters of triangles ABP and BCP.

Answer, solutions and source

Problem 29

  • Test 5

A(x,y), B(x,y), and C(x,y) are three homogeneous real-coefficient polynomials of x and y with degree 2, 3, and 4 respectively. we know that there is a real-coefficient polinimial R(x,y) such that B(x,y)2−4A(x,y)C(x,y)=−R(x,y)2B(x,y)^2-4A(x,y)C(x,y)=-R(x,y)^2 . Proof that there exist 2 polynomials F(x,y,z) and G(x,y,z) such that F(x,y,z)2+G(x,y,z)2=A(x,y)z2+B(x,y)z+C(x,y)F(x,y,z)^2+G(x,y,z)^2=A(x,y)z^2+B(x,y)z+C(x,y) if for any x, y, z real numbers A(x,y)z2+B(x,y)z+C(x,y)≥0A(x,y)z^2+B(x,y)z+C(x,y)\ge 0

Answer, solutions and source

Problem 30

  • Test 5

We call a graph with n vertices k−flowing−chromatick-flowing-chromatic if:

  1. we can place a chess on each vertex and any two neighboring (connected by an edge) chesses have different colors.
  2. we can choose a hamilton cycle v1,v2,⋯ ,vnv_1,v_2,\cdots , v_n , and move the chess on viv_i to vi+1v_{i+1} with i=1,2,⋯ ,ni=1,2,\cdots ,n and vn+1=v1v_{n+1}=v_1 , such that any two neighboring chess also have different colors.
  3. after some action of step 2 we can make all the chess reach each of the n vertices. Let T(G) denote the least number k such that G is k-flowing-chromatic. If such k does not exist, denote T(G)=0. denote χ(G)\chi (G) the chromatic number of G. Find all the positive number m such that there is a graph G with χ(G)≤m\chi (G)\le m and T(G)≥2mT(G)\ge 2^m without a cycle of length small than 2017.

Answer, solutions and source