Problems

Age
Difficulty
Found: 2630

The numbers from 1 to 9999 are written out in a row. How can I remove 100 digits from this row so that the remaining number is a) maximal b) minimal?

There are two identical gears with 14 teeth on a common shaft. They are aligned and four pairs of teeth are removed.

Prove that the gears can be rotated so that they form a complete gear (one containing no gaps).

If a class of 30 children is seated in the auditorium of a cinema there will always be at least one row containing no fewer than two classmates. If we do the same with a class of 26 children then at least three rows will be empty. How many rows are there in the cinema?

In order to glaze 15 windows of different shapes and sizes, 15 pieces of glass are prepared exactly for the size of the windows (windows are such that each window should have one glass). The glazier, not knowing that the glass is specifically selected for the size of each window, works like this: he approaches a certain window and sorts out the unused glass until he finds one that is large enough (that is, either an exactly suitable piece or one from which the right size can be cut), if there is no such glass, he goes to the next window, and so on, until he has assessed each window. It is impossible to make glass from several parts. What is the maximum number of windows which can be left unglazed?

Is it possible to draw five lines from one point on a plane so that there are exactly four acute angles among the angles formed by them? Angles between not only neighboring rays, but between any two rays, can be considered.

A group of 20 tourists go on a trip. The oldest member of the group is 35, the youngest is 20. Is it true that there are members of the group that are the same age?

What is the minimum number of lottery tickets for the Sport Lotto that it is necessary to buy in order to guarantee that at least one of the tickets will have one number correct. On any single ticket you can choose 6 of the available numbers 1 to 49.

Two grandmasters in turn put rooks on a chessboard (one turn – one rook) so that they cannot capture each other. The person who cannot put a rook on the chessboard loses. Who will win with the game – the first or second grandmaster?