Problems

Age
Difficulty
Found: 2545

On a line, there are 50 segments. Prove that either it is possible to find some 8 segments all of which have a shared intersection, or there can be found 8 segments, no two of which intersect.

It is known that \[35! = 10333147966386144929 * 66651337523200000000.\] Find the number replaced by an asterisk.

10 people collected a total of 46 mushrooms in a forest. It is known that no two people collected the same number of mushrooms. How many mushrooms did each person collect?

10 magazines lie on a coffee table, completely covering it. Prove that you can remove five of them so that the remaining magazines will cover at least half of the table.

A family went to the bridge at night. The dad can cross it in 1 minute, the mum in 2 minutes, the child in 5 minutes, and the grandmother in 10 minutes. They have one flashlight. The bridge only withstands two people. How can they cross the bridge in 17 minutes? (If two people cross, then they pass with the lower of the two speeds. They cannot pass along the bridge without a flashlight. They cannot shine the light from afar. They cannot carry anyone in their arms. They cannot throw the flashlight.)

Prove that the infinite decimal \(0.1234567891011121314 \dots\) (after the decimal point, all of the natural numbers are written out in order) is an irrational number.

There are \(n\) cities in a country. Between each two cities an air service is established by one of two airlines. Prove that out of these two airlines at least one is such that from any city you can get to any other city whilst traveling on flights only of this airline.

Several stones weigh 10 tons together, each weighing not more than 1 ton.

a) Prove that this load can be taken away in one go on five three-ton trucks.

b) Give an example of a set of stones satisfying the condition for which four three-ton trucks may not be enough to take the load away in one go.