olymmath

VN-TST 2014

Vietnam Team Selection Test 2014.

Other problems

Problem 1

Find all f:Z→Zf:\mathbb{Z}\rightarrow\mathbb{Z} such that f(2m+f(m)+f(m)f(n))=nf(m)+mf(2m+f(m)+f(m)f(n))=nf(m)+m ∀m,n∈Z\forall m,n\in\mathbb{Z}

Problem 2

In the Cartesian plane is given a set of points with integer coordinate T={(x;y)∣x,y∈Z; ∣x∣,∣y∣≤20; (x;y)≠(0;0)}T=\{ (x;y)\mid x,y\in\mathbb{Z} ; \ |x|,|y|\leq 20 ; \ (x;y)\ne (0;0)\} We colour some points of TT such that for each point (x;y)∈T(x;y)\in T then either (x;y)(x;y) or (−x;−y)(-x;-y) is coloured. Denote NN to be the number of couples (x1;y1),(x2;y2){(x_1;y_1),(x_2;y_2)} such that both (x1;y1)(x_1;y_1) and (x2;y2)(x_2;y_2) are coloured and x1≡2x2(mod41),y1≡2y2(mod41)x_1\equiv 2x_2 \pmod {41}, y_1\equiv 2y_2 \pmod {41} . Find the all possible values of NN .

Problem 5

Find all polynomials P(x),Q(x)P(x),Q(x) which have integer coefficients and satify the following condtion: For the sequence (xn)(x_n ) defined by x0=2014,x2n+1=P(x2n),x2n=Q(x2n−1)n≥1x_0=2014,x_{2n+1}=P(x_{2n}),x_{2n}=Q(x_{2n-1}) n\geq 1 for every positive integer mm is a divisor of some non-zero element of (xn)(x_n )

Problem 6

m,n,pm,n,p are positive integers which do not simultaneously equal to zero. 33 D Cartesian space is divided into unit cubes by planes each perpendicular to one of 33 axes and cutting corresponding axis at integer coordinates. Each unit cube is filled with an integer from 11 to 6060 . A filling of integers is called Dien Bien if, for each rectangular box of size {2m+1,2n+1,2p+1}\{2m+1,2n+1,2p+1\} , the number in the unit cube which has common centre with the rectangular box is the average of the 88 numbers of the 88 unit cubes at the 88 corners of that rectangular box. How many Dien Bien fillings are there? Two fillings are the same if one filling can be transformed to the other filling via a translation.