olymmath

VN-TST 2018

Vietnam Team Selection Test 2018.

Other problems

Problem 1

Let ABCABC be a acute, non-isosceles triangle. D, E, FD,\ E,\ F are the midpoints of sides AB, BC, ACAB,\ BC,\ AC , resp. Denote by (O), (O′)(O),\ (O') the circumcircle and Euler circle of ABCABC . An arbitrary point PP lies inside triangle DEFDEF and DP, EP, FPDP,\ EP,\ FP intersect (O′)(O') at D′, E′, F′D',\ E',\ F' , resp. Point A′A' is the point such that D′D' is the midpoint of AA′AA' . Points B′, C′B',\ C' are defined similarly. a. Prove that if PO=PO′PO=PO' then O∈(A′B′C′)O\in(A'B'C') ; b. Point A′A' is mirrored by ODOD , its image is XX . Y, ZY,\ Z are created in the same manner. HH is the orthocenter of ABCABC and XH, YH, ZHXH,\ YH,\ ZH intersect BC,AC,ABBC, AC, AB at M, N, LM,\ N,\ L resp. Prove that M, N, LM,\ N,\ L are collinear.

Problem 2

For every positive integer mm , a m×2018m\times 2018 rectangle consists of unit squares (called "cell") is called complete if the following conditions are met: i. In each cell is written either a " 00 ", a " 11 " or nothing; ii. For any binary string SS with length 20182018 , one may choose a row and complete the empty cells so that the numbers in that row, if read from left to right, produce SS (In particular, if a row is already full and it produces SS in the same manner then this condition ii. is satisfied). A complete rectangle is called minimal, if we remove any of its rows and then making it no longer complete.

a. Prove that for any positive integer k≤2018k\le 2018 there exists a minimal 2k×20182^k\times 2018 rectangle with exactly kk columns containing both 00 and 11 . b. A minimal m×2018m\times 2018 rectangle has exactly kk columns containing at least some 00 or 11 and the rest of columns are empty. Prove that m≤2km\le 2^k .

Problem 3

For every positive integer n≥3n\ge 3 , let ϕn\phi_n be the set of all positive integers less than and coprime to nn . Consider the polynomial: Pn(x)=∑k∈ϕnxk−1.P_n(x)=\sum_{k\in\phi_n} {x^{k-1}}. a. Prove that Pn(x)=(xrn+1)Qn(x)P_n(x)=(x^{r_n}+1)Q_n(x) for some positive integer rnr_n and polynomial Qn(x)∈Z[x]Q_n(x)\in\mathbb{Z}[x] (not necessary non-constant polynomial). b. Find all nn such that Pn(x)P_n(x) is irreducible over Z[x]\mathbb{Z}[x] .

Problem 4

Let a∈[12, 32]a\in\left[ \tfrac{1}{2},\ \tfrac{3}{2}\right] be a real number. Sequences (un), (vn)(u_n),\ (v_n) are defined as follows: un=32n+1⋅(−1)⌊2n+1a⌋, vn=32n+1⋅(−1)n+⌊2n+1a⌋.u_n=\frac{3}{2^{n+1}}\cdot (-1)^{\lfloor2^{n+1}a\rfloor},\ v_n=\frac{3}{2^{n+1}}\cdot (-1)^{n+\lfloor 2^{n+1}a\rfloor}. a. Prove that (u0+u1+⋯+u2018)2+(v0+v1+⋯+v2018)2≤72a2−48a+10+242019.{{({{u}_{0}}+{{u}_{1}}+\cdots +{{u}_{2018}})}^{2}}+{{({{v}_{0}}+{{v}_{1}}+\cdots +{{v}_{2018}})}^{2}}\le 72{{a}^{2}}-48a+10+\frac{2}{{{4}^{2019}}}. b. Find all values of aa in the equality case.

Problem 5

In a m×nm\times n square grid, with top-left corner is AA , there is route along the edges of the grid starting from AA and visits all lattice points (called "nodes") exactly once and ending also at AA .

a. Prove that this route exists if and only if at least one of m, nm,\ n is odd. b. If such a route exists, then what is the least possible of turning points?

*A turning point is a node that is different from AA and if two edges on the route intersect at the node are perpendicular.

Problem 6

Triangle ABCABC circumscribed (O)(O) has AA -excircle (J)(J) that touches AB, BC, ACAB,\ BC,\ AC at F, D, EF,\ D,\ E , resp.

a. LL is the midpoint of BCBC . Circle with diameter LJLJ cuts DE, DFDE,\ DF at K, HK,\ H . Prove that (BDK), (CDH)(BDK),\ (CDH) has an intersecting point on (J)(J) . b. Let EF∩BC={G}EF\cap BC =\{G\} and GJGJ cuts AB, ACAB,\ AC at M, NM,\ N , resp. P∈JBP\in JB and Q∈JCQ\in JC such that ∠PAB=∠QAC=90∘.\angle PAB=\angle QAC=90{}^\circ . PM∩QN={T}PM\cap QN=\{T\} and SS is the midpoint of the larger BCBC -arc of (O)(O) . (I)(I) is the incircle of ABCABC . Prove that SI∩AT∈(O)SI\cap AT\in (O) .