There are a thousand tickets with numbers 000, 001, ..., 999 and a hundred boxes with the numbers 00, 01, ..., 99. A ticket is allowed to be dropped into a box if the number of the box can be obtained from the ticket number by erasing one of the digits. Is it possible to arrange all of the tickets into 50 boxes?
The nonzero numbers \(a\), \(b\), \(c\) are such that every two of the three equations \(ax^{11} + bx^4 + c = 0\), \(bx^{11} + cx^4 + a = 0\), \(cx^{11} + ax^4 + b = 0\) have a common root. Prove that all three equations have a common root.
2011 numbers are written on a blackboard. It turns out that the sum of any of these written numbers is also one of the written numbers. What is the minimum number of zeroes within this set of 2011 numbers?
Does there exist a real number \({\alpha}\) such that the number \(\cos {\alpha}\) is irrational, and all the numbers \(\cos 2{\alpha}\), \(\cos 3{\alpha}\), \(\cos 4{\alpha}\), \(\cos 5{\alpha}\) are rational?
What is the maximum number of pairwise non-parallel segments with endpoints at the vertices of a regular \(n\)-gon?
The sequence of numbers \(a_1, a_2, \dots\) is given by the conditions \(a_1 = 1\), \(a_2 = 143\) and
for all \(n \geq 2\).
Prove that all members of the sequence are integers.
Solve the inequality: \(\lfloor x\rfloor \times \{x\} < x - 1\).
The teacher wrote on the board in alphabetical order all possible \(2^n\) words consisting of \(n\) letters A or B. Then he replaced each word with a product of \(n\) factors, correcting each letter A by \(x\), and each letter B by \((1 - x)\), and added several of the first of these polynomials in \(x\). Prove that the resulting polynomial is either a constant or increasing function in \(x\) on the interval \([0, 1]\).
We are given a polynomial \(P(x)\) and numbers \(a_1\), \(a_2\), \(a_3\), \(b_1\), \(b_2\), \(b_3\) such that \(a_1a_2a_3 \ne 0\). It turned out that \(P (a_1x + b_1) + P (a_2x + b_2) = P (a_3x + b_3)\) for any real \(x\). Prove that \(P (x)\) has at least one real root.
We are given \(n+1\) different natural numbers, which are less than \(2n\) (\(n>1\)). Prove that among them there will always be three numbers, where the sum of two of them is equal to the third.