olymmath

NMC 1989

Nordic Mathematical Contest 1989.

Other problems

Problem 1

Find a polynomial PP of lowest possible degree such that (a) PP has integer coefficients, (b) all roots of PP are integers, (c) P(0)=−1P(0) = -1 , (d) P(3)=128P(3) = 128 .

Problem 2

Three sides of a tetrahedron are right-angled triangles having the right angle at their common vertex. The areas of these sides are A,BA, B, and CC. Find the total surface area of the tetrahedron.

Problem 3

Let SS be the set of all points tt in the closed interval [−1,1][-1,1] such that for the sequence x0,x1,x2,…x_{0}, x_{1}, x_{2}, \ldots defined by the equations x0=t,xn+1=2xn2−1x_{0}=t, x_{n+1}=2 x_{n}^{2}-1, there exists a positive integer NN such that xn=1x_{n}=1 for all n≥Nn \geq N. Show that the set SS has infinitely many elements.

Problem 4

For which positive integers nn is the following statement true: if a1,a2,...,ana_1, a_2, ... , a_n are positive integers, ak≤na_k \le n for all kk and ∑k=1nak=2n\sum\limits_{k=1}^{{n}}{a_k}=2n then it is always possible to choose ai1,ai2,...,aija_{i1} , a_{i2} , ..., a_{ij} in such a way that the indices i1,i2,...,iji_1, i_2,... , i_j are different numbers, and ∑k=1jaik=n\sum\limits_{k=1}^{{{j}}}{a_{ik}}=n ?