There are eight points inside a circle of radius 1. Show that there are at least two points with distance between them less then 1.
Leo’s dad was making a pizza for lunch. He decided to place 7 pieces of pineapple on it. Assuming the pizza is a circle of a \(20\) cm radius, show that some two pieces of pineapple were placed closer than \(20\) cm apart.
Each point on a circle was painted red or green. Show that there is an isosceles triangle whose vertices are on the circumference of the circle, such that all three vertices are red or all three are green.
Anna has a garden shaped like an equilateral triangle of side \(8\) metres. She wants to plant \(17\) plants, but they need space – they need to be at least \(2\) metres apart in order for their roots to have access to all the microelements in the ground. Show that Anna’s garden is unfortunately too small.
There are 25 points on a plane, and among any three of them there can be found two points with a distance between them of less than 1. Prove that there is a circle of radius 1 containing at least 13 of these points.
In a corridor of length 100 m, 20 sections of red carpet are laid out. The combined length of the sections is 1000 m. What is the largest number there can be of distinct stretches of the corridor that are not covered by carpet, given that the sections of carpet are all the same width as the corridor?
It is known that a camera located at \(O\) cannot see the objects \(A\) and \(B\), where the angle \(AOB\) is greater than \(179^\circ\). 1000 such cameras are placed in a Cartesian plane. All of the cameras simultaneously take a picture. Prove that there will be a picture taken in which no more than 998 cameras are visible.
Prove that any convex polygon contains not more than \(35\) vertices with an angle of less than \(170^\circ\).
A circle is covered with several arcs. These arcs can overlap one another, but none of them cover the entire circumference. Prove that it is always possible to select several of these arcs so that together they cover the entire circumference and add up to no more than \(720^{\circ}\).
Prove that it is not possible to completely cover an equilateral triangle with two smaller equilateral triangles.