olymmath

VN-TST 2003

Vietnam Team Selection Test 2003.

Day 1

Problem 1

  • Day 1

Let be four positive integers m,n,p,qm, n, p, q , with p<mp < m given and q<nq < n . Take four points A(0;0),B(p;0),C(m;q)A(0; 0), B(p; 0), C (m; q) and D(m;n)D(m; n) in the coordinate plane. Consider the paths ff from AA to DD and the paths gg from BB to CC such that when going along ff or gg , one goes only in the positive directions of coordinates and one can only change directions (from the positive direction of one axe coordinate into the the positive direction of the other axe coordinate) at the points with integral coordinates. Let SS be the number of couples (f,g)(f, g) such that ff and gg have no common points. Prove that

S=(nm+n)⋅(qm+q−p)−(qm+q)⋅(nm+n−p).S = \binom{n}{m+n} \cdot \binom{q}{m+q-p} - \binom{q}{m+q} \cdot \binom{n}{m+n-p}.

Answer, solutions and source

Problem 2

  • Day 1

Given a triangle ABCABC . Let OO be the circumcenter of this triangle ABCABC . Let HH , KK , LL be the feet of the altitudes of triangle ABCABC from the vertices AA , BB , CC , respectively. Denote by A0A_{0} , B0B_{0} , C0C_{0} the midpoints of these altitudes AHAH , BKBK , CLCL , respectively. The incircle of triangle ABCABC has center II and touches the sides BCBC , CACA , ABAB at the points DD , EE , FF , respectively. Prove that the four lines A0DA_{0}D , B0EB_{0}E , C0FC_{0}F and OIOI are concurrent. (When the point OO concides with II , we consider the line OIOI as an arbitrary line passing through OO .)

Answer, solutions and source

Problem 3

  • Day 1

Let f(0,0)=52003,f(0,n)=0f(0, 0) = 5^{2003}, f(0, n) = 0 for every integer n≠0n \neq 0 and  f(m,n)=f(m−1,n)−2⋅⌊f(m−1,n)2⌋+⌊f(m−1,n−1)2⌋+⌊f(m−1,n+1)2⌋\begin{array}{c}\ f(m, n) = f(m-1, n) - 2 \cdot \Bigg\lfloor \frac{f(m-1, n)}{2}\Bigg\rfloor + \Bigg\lfloor\frac{f(m-1, n-1)}{2}\Bigg\rfloor + \Bigg\lfloor\frac{f(m-1, n+1)}{2}\Bigg\rfloor \end{array} for every natural number m>0m > 0 and for every integer nn .

Prove that there exists a positive integer MM such that f(M,n)=1f(M, n) = 1 for all integers nn such that ∣n∣≤(52003−1)2|n| \leq \frac{(5^{2003}-1)}{2} and f(M,n)=0f(M, n) = 0 for all integers n such that ∣n∣>52003−12.|n| > \frac{5^{2003}-1}{2}.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

On the sides of triangle ABCABC take the points M1,N1,P1M_1, N_1, P_1 such that each line MM1,NN1,PP1MM_1, NN_1, PP_1 divides the perimeter of ABCABC in two equal parts ( M,N,PM, N, P are respectively the midpoints of the sides BC,CA,ABBC, CA, AB ).

I. Prove that the lines MM1,NN1,PP1MM_1, NN_1, PP_1 are concurrent at a point KK . II. Prove that among the ratios KABC,KBCA,KCAB\frac{KA}{BC}, \frac{KB}{CA}, \frac{KC}{AB} there exist at least a ratio which is not less than 13\frac{1}{\sqrt{3}} .

Answer, solutions and source

Problem 5

  • Day 2

Let AA be the set of all permutations a=(a1,a2,…,a2003)a = (a_1, a_2, \ldots, a_{2003}) of the 2003 first positive integers such that each permutation satisfies the condition: there is no proper subset SS of the set {1,2,…,2003}\{1, 2, \ldots, 2003\} such that {ak∣k∈S}=S.\{a_k | k \in S\} = S.

For each a=(a1,a2,…,a2003)∈Aa = (a_1, a_2, \ldots, a_{2003}) \in A , let d(a)=∑k=12003(ak−k)2.d(a) = \sum^{2003}_{k=1} \left(a_k - k \right)^2.

I. Find the least value of d(a)d(a) . Denote this least value by d0d_0 . II. Find all permutations a∈Aa \in A such that d(a)=d0d(a) = d_0 .

Answer, solutions and source

Problem 6

  • Day 2

Let nn be a positive integer. Prove that the number 2n+12^n + 1 has no prime divisor of the form 8⋅k−18 \cdot k - 1 , where kk is a positive integer.

Answer, solutions and source