olymmath

IL-GROSSMAN 1999

Grossman Olympiad 1999.

Other problems

Problem 1

For any 1616 positive integers n,a1,a2,...,a15n,a_1,a_2,...,a_{15} we define T(n,a1,a2,...,a15)=(a1n+a2n+...+a15n)a1a2...a15T(n,a_1,a_2,...,a_{15}) = (a_1^n+a_2^n+ ...+a_{15}^n)a_1a_2...a_{15} . Find the smallest nn such that T(n,a1,a2,...,a15)T(n,a_1,a_2,...,a_{15}) is divisible by 1515 for any choice of a1,a2,...,a15a_1,a_2,...,a_{15} .

Problem 2

Find the smallest positive integer nn for which 0<n4−[n4]<10−50 <\sqrt[4]{n}- [\sqrt[4]{n}]< 10^{-5} .

Problem 3

For every triangle ABCABC , denote by D(ABC)D(ABC) the triangle whose vertices are the tangency points of the incircle of △ABC\vartriangle ABC with the sides. Assume that △ABC\vartriangle ABC is not equilateral. (a) Prove that D(ABC)D(ABC) is also not equilateral. (b) Find in the sequence T1=△ABC,Tk+1=D(Tk)T_1 = \vartriangle ABC, T_{k+1} = D(T_k) for k∈Nk \in N a triangle whose largest angle α\alpha satisfies 0<α−60o<0.0001o0 < \alpha -60^o < 0.0001^o

Problem 4

Consider a polynomial f(x)=x4+ax3+bx2+cx+df(x) = x^4 +ax^3 +bx^2 +cx+d with integer coefficients. Prove that if f(x)f(x) has exactly one real root, then it can be factored into nonconstant polynomials with rational coefficients