A spherical planet is surrounded by 25 point asteroids. Prove, that at any given moment there will be a point on the surface of the planet from which an astronomer will not be able to see more than 11 asteroids.
It is known that in a convex \(n\)-gon (\(n > 3\)) no three diagonals pass through one point. Find the number of points (other than the vertex) where pairs of diagonals intersect.
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.
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.
Are there any irrational numbers \(a\) and \(b\) such that the degree of \(a^b\) is a rational number?
In a square which has sides of length 1 there are 100 figures, the total area of which sums to more than 99. Prove that in the square there is a point which belongs to all of these figures.
Every point in a plane, which has whole-number co-ordinates, is plotted in one of \(n\) colours. Prove that there will be a rectangle made out of 4 points of the same colour.
Every evening Ross arrives at a random time to the bus stop. Two bus routes stop at this bus stop. One of the routes takes Ross home, and the other takes him to visit his friend Rachel. Ross is waiting for the first bus and depending on which bus arrives, he goes either home or to his friend’s house. After a while, Ross noticed that he is twice as likely to visit Rachel than to be at home. Based on this, Ross concludes that one of the buses runs twice as often as the other. Is he right? Can buses run at the same frequency when the condition of the task is met? (It is assumed that buses do not run randomly, but on a certain schedule).
Two points are placed inside a convex pentagon. Prove that it is always possible to choose a quadrilateral that shares four of the five vertices on the pentagon, such that both of the points lie inside or on the boundary the quadrilateral.