olymmath

VN-TST 1995

Vietnam Team Selection Test 1995.

Other problems

Problem 1

Let be given a triangle ABCABC with BC=aBC = a , CA=bCA = b , AB=cAB = c . Six distinct points A1A_1 , A2A_2 , B1B_1 , B2B_2 , C1C_1 , C2C_2 not coinciding with AA , BB , CC are chosen so that A1A_1 , A2A_2 lie on line BCBC ; B1B_1 , B2B_2 lie on CACA and C1C_1 , C2C_2 lie on ABAB . Let α\alpha , β\beta , γ\gamma three real numbers satisfy A1A2→=αaBC→\overrightarrow{A_1A_2} = \frac {\alpha}{a}\overrightarrow{BC} , B1B2→=βbCA→\overrightarrow{B_1B_2} = \frac {\beta}{b}\overrightarrow{CA} , C1C2→=γcAB→\overrightarrow{C_1C_2} = \frac {\gamma}{c}\overrightarrow{AB} . Let dAd_A , dBd_B , dCd_C be respectively the radical axes of the circumcircles of the pairs of triangles AB1C1AB_1C_1 and AB2C2AB_2C_2 ; BC1A1BC_1A_1 and BC2A2BC_2A_2 ; CA1B1CA_1B_1 and CA2B2CA_2B_2 . Prove that dAd_A , dBd_B and dCd_C are concurrent if and only if αa+βb+γc≠0\alpha a + \beta b + \gamma c \neq 0 .

Problem 2

Find all integers kk such that for infinitely many integers n≥3n \ge 3 the polynomial P(x)=xn+1+kxn−870x2+1945x+1995P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995 can be reduced into two polynomials with integer coefficients.

Problem 3

Find all integers aa , bb , nn greater than 11 which satisfy (a3+b3)n=4(ab)1995\left(a^3 + b^3\right)^n = 4(ab)^{1995}

Problem 4

A graph has nn vertices and 12(n2−3n+4)\frac {1}{2}\left(n^2 - 3n + 4\right) edges. There is an edge such that, after removing it, the graph becomes unconnected. Find the greatest possible length kk of a circuit in such a graph.

Problem 5

For any nonnegative integer nn , let f(n)f(n) be the greatest integer such that 2f(n)∣n+12^{f(n)} | n + 1 . A pair (n,p)(n, p) of nonnegative integers is called nice if 2f(n)>p2^{f(n)} > p . Find all triples (n,p,q)(n, p, q) of nonnegative integers such that the pairs (n,p)(n, p) , (p,q)(p, q) and (n+p+q,n)(n + p + q, n) are all nice.

Problem 6

Consider the function f(x)=2x3−33x2−1f(x) = \frac {2x^3 - 3}{3x^2 - 1} .

1.1. Prove that there is a continuous function g(x)g(x) on R\mathbb{R} satisfying f(g(x))=xf(g(x)) = x and g(x)>xg(x) > x for all real xx .

2.2. Show that there exists a real number a>1a > 1 such that the sequence {an}\{a_n\} , n=1,2,…n = 1, 2, \ldots , defined as follows a0=aa_0 = a , an+1=f(an)a_{n + 1} = f(a_n) , ∀n∈N\forall n\in\mathbb{N} is periodic with the smallest period 19951995 .