Can seven phones be connected with wires so that each phone is connected to exactly three others?
Write out in a row the numbers from \(1\) to \(9\) (every number once) so that every two consecutive numbers give a two-digit number that is divisible by \(7\) or by \(13\).
Prove that the sum of
a) any number of even numbers is even;
b) an even number of odd numbers is even;
c) an odd number of odd numbers is odd.
Prove that the product of
a) two odd numbers is odd;
b) an even number with any integer is even.
7 natural numbers are written around the edges of a circle. It is known that in each pair of adjacent numbers one is divisible by the other. Prove that there will be another pair of numbers that are not adjacent that share this property.
Prove that for any number \(d\), which is not divisible by \(2\) or by \(5\), there is a number whose decimal notation contains only ones and which is divisible by \(d\).
It is known that \[35! = 10333147966386144929 * 66651337523200000000.\] Find the number replaced by an asterisk.
\(2n\) diplomats sit around a round table. After a break the same \(2n\) diplomats sit around the same table, but this time in a different order.
Prove that there will always be two diplomats with the same number of people sitting between them, both before and after the break.
Prove that if \(a, b, c\) are odd numbers, then at least one of the numbers \(ab-1\), \(bc-1\), \(ca-1\) is divisible by 4.
10 natural numbers are written on a blackboard. Prove that it is always possible to choose some of these numbers and write “\(+\)” or “\(-\)” between them so that the resulting algebraic sum is divisible by 1001.