Prove that there are infinitely many composite numbers among the numbers \(\lfloor 2^k \sqrt{2}\rfloor\) (\(k = 0, 1, \dots\)).
Prove that if \((m, 10) = 1\), then there is a repeated unit \(E_n\) that is divisible by \(m\). Will there be infinitely many repeated units?
It is known that \(\cos \alpha^{\circ} = 1/3\). Is \(\alpha\) a rational number?
Let \(f (x)\) be a polynomial of degree \(n\) with roots \(\alpha_1, \dots , \alpha_n\). We define the polygon \(M\) as the convex hull of the points \(\alpha_1, \dots , \alpha_n\) on the complex plane. Prove that the roots of the derivative of this polynomial lie inside the polygon \(M\).
a) Using geometric considerations, prove that the base and the side of an isosceles triangle with an angle of \(36^{\circ}\) at the vertex are incommensurable.
b) Invent a geometric proof of the irrationality of \(\sqrt{2}\).
Find the largest number of colours in which you can paint the edges of a cube (each edge with one colour) so that for each pair of colours there are two adjacent edges coloured in these colours. Edges are considered to be adjacent if they have a common vertex.
A class contains 33 pupils, who have a combined age of 430 years. Prove that if we picked the 20 oldest pupils they would have a combined age of no less than 260 years. The age of any given pupil is a whole number.
In a one-on-one tournament 10 chess players participate. What is the least number of rounds after which the single winner could have already been determined? (In each round, the participants are broken up into pairs. Win – 1 point, draw – 0.5 points, defeat – 0).
A chequered strip of \(1 \times N\) is given. Two players play the game. The first player puts a cross into one of the free cells on his turn, and subsequently the second player puts a nought in another one of the cells. It is not allowed for there to be two crosses or two noughts in two neighbouring cells. The player who is unable to make a move loses.
Which of the players can always win (no matter how their opponent played)?
We are given 111 different natural numbers that do not exceed 500. Could it be that for each of these numbers, its last digit coincides with the last digit of the sum of all of the remaining numbers?