Problems

Age
Difficulty
Found: 1113

We are given 51 two-digit numbers – we will count one-digit numbers as two-digit numbers with a leading 0. Prove that it is possible to choose 6 of these so that no two of them have the same digit in the same column.

Find \(m\) and \(n\) knowing the relation \(\binom{n+1}{m+1}: \binom{n+1}{m}:\binom{n+1}{m-1} = 5:5:3\).

Prove that in a three-digit number, that is divisible by 37, you can always rearrange the numbers so that the new number will also be divisible by 37.

\(N\) points are given, no three of which lie on one line. Each two of these points are connected by a segment, and each segment is coloured in one of the \(k\) colours. Prove that if \(N > \lfloor k!e\rfloor\), then among these points one can choose three such that all sides of the triangle formed by them will be colored in one colour.

For a given polynomial \(P (x)\) we describe a method that allows us to construct a polynomial \(R (x)\) that has the same roots as \(P (x)\), but all multiplicities of 1. Set \(Q (x) = (P(x), P'(x))\) and \(R (x) = P (x) Q^{-1} (x)\). Prove that

a) all the roots of the polynomial \(P (x)\) are the roots of \(R (x)\);

b) the polynomial \(R (x)\) has no multiple roots.

Prove that for \(n> 0\) the polynomial \(nx^{n + 1} - (n + 1) x^n + 1\) is divisible by \((x - 1)^2\).