a) There are 21 coins on a table with the tails side facing upwards. In one operation, you are allowed to turn over any 20 coins. Is it possible to achieve the arrangement were all coins are facing with the heads side upwards in a few operations?
b) The same question, if there are 20 coins, but you are allowed to turn over 19.
From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.
The number of permutations of a set of \(n\) elements is denoted by \(P_n\).
Prove the equality \(P_n = n!\).
Write in terms of prime factors the numbers 111, 1111, 11111, 111111, 1111111.
Let \(a\), \(b\), \(c\) be integers; where \(a\) and \(b\) are not equal to zero.
Prove that the equation \(ax + by = c\) has integer solutions if and only if \(c\) is divisible by \(d = \mathrm{GCD} (a, b)\).
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.
Let \(m\) and \(n\) be integers. Prove that \(mn(m + n)\) is an even number.
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\).
Prove that any \(n\) numbers \(x_1,\dots , x_n\) that are not pairwise congruent modulo \(n\), represent a complete system of residues, modulo \(n\).