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?
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?
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\)?
Robinson found a chest with books and instruments after the ship wreck. Not all the books were in readable condition, but some of the books he managed to read. One sentence read “72 chickens cost *619* p”. (The starred digits were not readable). He has not tasted a chicken for quite some time, and it was pleasant to imagine a properly cooked chicken in front of him. He also was able to decipher the cost of one chicken. Can you?