olymmath

FI-MO 2010

Finnish national mathematics olympiad 2010.

Other problems

Problem 1

Let ABCABC be right angled triangle with sides s1,s2,s3s_1,s_2,s_3 medians m1,m2,m3m_1,m_2,m_3 . Prove that m12+m22+m32=34(s12+s22+s32)m_1^2+m_2^2+m_3^2=\frac{3}{4}(s_1^2+s_2^2+s_3^2) .

Problem 2

Determine the least n∈Nn\in\mathbb{N} such that n!=1⋅2⋅3⋯(n−1)⋅nn!=1\cdot 2\cdot 3\cdots (n-1)\cdot n has at least 20102010 positive factors.

Problem 3

Let P(x)P(x) be a polynomial with integer coefficients and roots 19971997 and 20102010 . Suppose further that ∣P(2005)∣<10|P(2005)|<10 . Determine what integer values P(2005)P(2005) can get.

Problem 4

In a football season, even number nn of teams plays a simple series, i.e. each team plays once against each other team. Show that ona can group the series into n−1n-1 rounds such that in every round every team plays exactly one match.

Problem 5

Let SS be a non-empty subset of a plane. We say that the point PP can be seen from AA if every point from the line segment APAP belongs to SS . Further, the set SS can be seen from AA if every point of SS can be seen from AA . Suppose that SS can be seen from AA , BB and CC where ABCABC is a triangle. Prove that SS can also be seen from any other point of the triangle ABCABC .