The product of two natural numbers, each of which is not divisible by 10, is equal to 1000. Find the sum of these two numbers.
Does there exist a natural number which, when divided by the sum of its digits, gives a quotient and remainder both equal to the number 2011?
Prove that: \[a_1 a_2 a_3 \cdots a_{n-1}a_n \times 10^3 \equiv a_{n-1} a_n \times 10^3 \pmod4,\] where \(n\) is a natural number and \(a_i\) for \(i=1,2,\ldots, n\) are the digits of some number.
In a room there are some chairs with 4 legs and some stools with 3 legs. When each chair and stool has one person sitting on it, then in the room there are a total of 39 legs. How many chairs and stools are there in the room?
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)\).
Let \(m\) and \(n\) be integers. Prove that \(mn(m + n)\) is an even number.
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\).