Problems

Age
Difficulty
Found: 52

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.

Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any \(k = 1, 2, 3, \dots\) the sum of the first \(k\) terms of the sequence is divisible by \(k\)?

You are given \(11\) different positive whole 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.

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?