The numbers \(\lfloor a\rfloor, \lfloor 2a\rfloor, \dots , \lfloor Na\rfloor\) are all different, and the numbers \(\lfloor 1/a\rfloor, \lfloor 2/a\rfloor,\dots , \lfloor M/a\rfloor\) are also all different. Find all such \(a\).
2022 points are selected from a cube, whose edge is equal to 13 units. Is it possible to place a cube with edge of 1 unit in this cube so that there is not one selected point inside it?
Solve the equation \(x^3 - \lfloor x\rfloor = 3\).
There is a system of equations \[\begin{aligned} * x + * y + * z &= 0,\\ * x + * y + * z &= 0,\\ * x + * y + * z &= 0. \end{aligned}\] Two people alternately enter a number instead of a star. Prove that the player that goes first can always ensure that the system has a non-zero solution.
There are two sets of numbers made up of 1s and \(-1\)s, and in each there are 2022 numbers. Prove that in some number of steps it is possible to turn the first set into the second one if for each step you are allowed to simultaneously change the sign of any 11 numbers of the starting set. (Two sets are considered the same if they have the same numbers in the same places.)
Note that if you turn over a sheet on which numbers are written, then the digits 0, 1, 8 will not change and the digits 6 and 9 will switch places, whilst the others will lose their meaning. How many nine-digit numbers exist that do not change when a sheet is turned over?
30 pupils in years 7 to 11 took part in the creation of 40 maths problems. Every possible pair of pupils in the same year created the same number of problems. Every possible pair of pupils in different years created a different number of problems. How many pupils created exactly one problem?
The number \(A\) is divisible by \(1, 2, 3, \dots , 9\). Prove that if \(2A\) is presented in the form of a sum of some natural numbers smaller than 10, \(2A= a_1 +a_2 +\dots +a_k\), then we can always choose some of the numbers \(a_1, a_2, \dots , a_k\) so that the sum of the chosen numbers is equal to \(A\).
Two people play a game with the following rules: one of them guesses a set of integers \((x_1, x_2, \dots , x_n)\) which are single-valued digits and can be either positive or negative. The second person is allowed to ask what is the sum \(a_1x_1 + \dots + a_nx_n\), where \((a_1, \dots ,a_n)\) is any set. What is the smallest number of questions for which the guesser recognizes the intended set?
A table of \(4\times4\) cells is given, in some cells of which a star is placed. Show that you can arrange seven stars so that when you remove any two rows and any two columns of this table, there will always be at least one star in the remaining cells. Prove that if there are fewer than seven stars, you can always remove two rows and two columns so that all the remaining cells are empty.