Prove that the product of
a) two odd numbers is odd;
b) an even number with any integer is even.
A road of length 1 km is lit with streetlights. Each streetlight illuminates a stretch of road of length 1 m. What is the maximum number of streetlights that there could be along the road, if it is known that when any single streetlight is extinguished the street will no longer be fully illuminated?
Several guests are sitting at a round table. Some of them are familiar with each other; mutually acquainted. All the acquaintances of any guest (counting himself) sit around the table at regular intervals. (For another person, these gaps may be different.) It is known that any two have at least one common acquaintance. Prove that all guests are familiar with each other.
15 MPs take part in a debate. During the debate, each one criticises exactly \(k\) of the 14 other contributors. For what minimum value of \(k\) is it possible to definitively state that there will be two MPs who have criticised one another?
In the number \(1234096\dots\) each digit, starting with the 5th digit, is equal to the final digit of the sum of the previous 4 digits. Will the digits 8123 ever occur in a row in this number?
During the election for the government of the planet of Liars and
Truth-Tellers, \(12\) candidates each
gave a short speech about themselves.
After everyone had spoken, one alien said: “So far, only one lie has
been told today.”
Then another said: “And now two have been said so far.”
The third said: “And now three lies have been told so far,” and so on —
until the twelfth alien said: “And now twelve lies have been told so
far.”
It turned out that at least one candidate had correctly counted how many
lies had been told before their own statement.
How many lies were said that day in total?
There are 30 ministers in a parliament. Each two of them are either friends or enemies, and each is friends with exactly six others. Every three ministers form a committee. Find the total number of committees in which all three members are friends or all three are enemies.
Two people play the following game. Each player in turn rubs out 9 numbers (at his choice) from the sequence \(1, 2, \dots , 100, 101\). After eleven such deletions, 2 numbers will remain. The first player is awarded so many points, as is the difference between these remaining numbers. Prove that the first player can always score at least 55 points, no matter how played the second.
A six-digit phone number is given. How many seven-digit numbers are there from which one can obtain this six-digit number by deleting one digit?
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.