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?
In a dark room on a shelf there are 4 pairs of socks of two different sizes and two different colours that are not arranged in pairs. What is the minimum number of socks necessary to move from the drawer to the suitcase, without leaving the room, so that there are two pairs of socks of different sizes and colours in the suitcase?
Determine all natural numbers \(m\) and \(n\) such as \(m! + 12 = n^2\).
Determine all integer solutions of the equation \(yk = x^2 + x\). Where \(k\) is an integer greater than \(1\).
The board has the form of a cross, which is obtained if corner boxes of a square board of \(4 \times 4\) are erased. Is it possible to go around it with the help of the knight chess piece and return to the original cell, having visited all the cells exactly once?
Valentina added a number (not equal to 0) taken to the power of four and the same number to the power two and reported the result to Peter. Can Peter determine the unique number that Valentina chose?
Solve the equation \(\lfloor x^3\rfloor + \lfloor x^2\rfloor + \lfloor x\rfloor = \{x\} - 1\).