Problem #PRU-78244

Problems Algebra and arithmetic Absolute value Absolute value of a number (other) Number systems Decimal number system Algebraic equations and systems of equations Higher order equations. Palindromic polynomial equations Equations of higher order (other)

11–13 4.0

Problem

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_{1} x_{1} + \dots + a_{n} x_{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?

To see the solution register and get verified.