Michael thinks of a number no less than \(1\) and no greater than \(1000\). Victoria is only allowed to ask questions to which Michael can answer “yes” or “no” (Michael always tells the truth). Can Victoria figure out which number Michael thought of by asking \(10\) questions?
The parliament of a certain country has two houses with an equal number of members. In order to make a decision on an important issue all the members voted and there were no abstentions. When the chairman announced that the decision had been taken with a 23-vote advantage, the opposition leader declared that the results had been rigged. How did he know it?
Is it possible to find natural numbers \(x\), \(y\) and \(z\) which satisfy the equation \(28x+30y+31z=365\)?
Four numbers (from 1 to 9) have been used to create two numbers with four-digits each. These two numbers are the maximum and minimum numbers, respectively, possible. The sum of these two numbers is equal to 11990. What could the two numbers be?
Prove that if \(p\) is a prime number, then \((a + b)^p - a^p - b^p\) is divisible by \(p\) for any integers \(a\) and \(b\).
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?
What figure should I put in place of the “?” in the number \(888 \dots 88\,?\,99 \dots 999\) (eights and nines are written 50 times each) so that it is divisible by 7?
On a table there are 2022 cards with the numbers 1, 2, 3, ..., 2022. Two players take one card in turn. After all the cards are taken, the winner is the one who has a greater last digit of the sum of the numbers on the cards taken. Find out which of the players can always win regardless of the opponent’s strategy, and also explain how he should go about playing.
Prove the divisibility rule for \(3\): the number is divisible by \(3\) if and only if the sum of its digits is divisible by \(3\).
While studying numbers and its properites, Robinson came across a 3-digit prime number with the last digit being equal to the sum of the first two digits. What was the last digit of that number if among the number did not have any zeros among it’s digits?