Problems

Age
Difficulty
Found: 79

You are given a table of size \(m \times n\) (\(m, n > 1\)). In it, the centers of all cells are marked. What is the largest number of marked centers that can be chosen so that no three of them are the vertices of a right triangle?

There are several cities (more than one) in a country; some pairs of cities are connected by roads. It is known that you can get from every city to any other city by driving along several roads. In addition, the roads do not form cycles, that is, if you leave a certain city on some road and then move so as not to pass along one road twice, it is impossible to return to the initial city. Prove that in this country there are at least two cities, each of which is connected by a road with exactly one city.

In the TV series “The Secret of Santa Barbara” there are 20 characters. Each episode contains one of the events: some character discovers the Mystery, some character discovers that someone knows the Mystery, some character discovers that someone does not know the Mystery. What is the maximum number of episodes that this tv series can last?

On the planet Tau Ceti, the landmass takes up more than half the surface area. Prove that the Tau Cetians can drill a hole through the centre of their planet that connects land to land.

A raisin bag contains 2001 raisins with a total weight of 1001 g, and no raisin weighs more than 1.002 g.

Prove that all the raisins can be divided onto two scales so that they show a difference in weight not exceeding 1 g.

Find the first 99 decimal places in the number expansion of \((\sqrt{26} + 5)^{99}\).

An area of airspace contains clouds. It turns out that the area can be divided by 10 aeroplanes into regions such that each region contains no more than one cloud. What is the largest number of clouds an aircraft can fly through whilst holding a straight line course.

In a communication system consisting of 2001 subscribers, each subscriber is connected with exactly \(n\) others. Determine all the possible values of \(n\).

A raisin bag contains 2001 raisins with a total weight of 1001 g, and no raisin weighs more than 1.002 g.

Prove that all the raisins can be divided onto two scales so that they show a difference in weight not exceeding 1 g.