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\).
Several Top Secret Objects are connected by an underground railway in such a way that each Object is directly connected to no more than three others and from each Object one can reach any other Object by going and by changing no more than once. What is the maximum number of Top Secret Objects?
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.
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 that order in a row in this number?
On the selection to the government of the planet of liars and truth tellers \(12\) candidates gave a speech about themselves. After a while, one said: “before me only once did someone lie” Another said: “And now-twice.” “And now – thrice” – said the third, and so on until the \(12\)th, who said: “And now \(12\) times someone has lied.” Then the presenter interrupted the discussion. It turned out that at least one candidate correctly counted how many times someone had lied before him. So how many times have the candidates lied?
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.