Prove that \(n^2 + 1\) is not divisible by \(3\) for any natural \(n\).
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?
Prove that for a real positive \(\alpha\) and a positive integer \(d\), \(\lfloor \alpha / d\rfloor = \lfloor \lfloor \alpha\rfloor / d\rfloor\) is always satisfied.
Prove that if \(p\) is a prime number and \(1 \leq k \leq p - 1\), then \(\binom{p}{k}\) is divisible by \(p\).
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\).
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 their properties, Robinson came across a three-digit prime number whose last digit equals the sum of the first two digits. What are the options for the last digit of this number, given that none of its digits is zero?
Prove the divisibility rule for \(4\): a number is divisible by \(4\) if and only if the number made by the
last two digits of the original number is divisible by \(4\);
Can you come up with a divisibility rule for \(8\)?