Solve the equation with integers \(x^2 + y^2 = 4z - 1\).
In a group of friends, each two people have exactly five common acquaintances. Prove that the number of pairs of friends is divisible by 3.
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?