Can the equality \(K \times O \times T = U \times W \times E \times N \times H \times Y\) be true if the numbers from 1 to 9 are substituted for the letters? Different letters correspond to different numbers.
Which five-digit numbers are there more of: ones that are not divisible by 5 or those with neither the first nor the second digit on the left being a five?
The sequence of numbers \(a_1, a_2, \dots\) is given by the conditions \(a_1 = 1\), \(a_2 = 143\) and
for all \(n \geq 2\).
Prove that all members of the sequence are integers.
You are given 11 different natural numbers that are less than or equal to 20. Prove that it is always possible to choose two numbers where one is divisible by the other.
Can there be exactly 100 roads in a state in which three roads leave each city?
Let \(p\) be a prime number, and \(a\) an integer number not divisible by \(p\). Prove that there is a positive integer \(b\) such that \(ab \equiv 1 \pmod p\).
In a graph, three edges emerge from each vertex. Can there be a 1990 edges in this graph?
A professional tennis player plays at least one match each day for training purposes. However in order to ensure he does not over-exert himself he plays no more than 12 matches a week. Prove that it is possible to find a group of consecutive days during which the player plays a total of 20 matches.
A country is called a Fiver if, in it, each city is connected by airlines with exactly with five other cities (there are no international flights).
a) Draw a scheme of airlines for a country that is made up of 10 cities.
b) How many airlines are there in a country of 50 cities?
c) Can there be a Fiver country, in which there are exactly 46 airlines?
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\).