There is a triangle with side lengths \(a\), \(b\) and \(c\). Does there exist a triangle with side lengths \(|a-b|\), \(|b-c|\) and \(|c-a|\)? Does it depend on what \(a\), \(b\) and \(c\) are?
Recall that a triangle can be formed with side lengths \(x\), \(y\) and \(z\) if and only if all the inequalities \(x+y>z\), \(y+z>x\) and \(z+x>y\) hold.
There is a triangle with side lenghts \(a\), \(b\) and \(c\). Does there exist a triangle with sides of lengths \(a^2+bc\), \(b^2+ca\) and \(c^2+ab\)? Does it depend on the values of \(a\), \(b\) and \(c\)?
In good conditions, bacteria in a Petri cup spread quite fast, doubling every second. If there was initially one bacterium, then in \(32\) seconds the bacteria will cover the whole surface of the cup.
Now suppose that there are initially \(4\) bacteria. At what time will the bacteria cover the surface of the cup?
A piece containing exactly \(4\) black cells is cut out from a regular \(8\) by \(8\) chessboard. You are only allowed to cut along the edges of the cells and the piece must be connected - namely you cannot have cells attached only with a vertex, they have to share a common edge.
Find the largest possible area of such a piece.
In a distant village, there are \(3\) houses and \(3\) wells. Inhabitants of each house want to have access to all \(3\) wells. Is it possible to build non-intersecting straight paths from each house to each well? All houses and well must be level (that is, none of them are higher up, like on a mountain, nor are any of them on lower ground, like in a valley).
Find all \(n\) such that a closed system of \(n\) gears in a plane can rotate. We call a system closed if the first gear wheel is connected to the second and the \(n\)th, the second is connected to the first and the third, the third is connected to the second and the fourth, the fourth is connected to the third and the fifth, and so on until the \(n\)th is connected to the \(n-1\)th and the first. In the picture, we have a closed system of three gears.
Show that there are no rational numbers \(a,b\) such that \(a^2 + b^2 = 3\).
There are infinitely many couples at a party. Each pair is separated to form two queues of people, where each person is standing next to their partner. Suppose the queue on the left has the property that every nonempty collection of people has a person (from the collection) standing in front of everyone else from that collection. A jester comes into the room and joins the right queue at the back after the two queues are formed.
Each person in the right queue would like to shake hand with a person in the left queue. However, no two of them would like to shake hand with the same person in the left queue. If \(p\) is standing behind \(q\) in the right queue, \(p\) will only shake hand with someone standing behind \(q\)’s handshake partner. Show that it is impossible to shake hands without leaving out someone from the left queue.
Suppose \(x,y\) are real numbers such that \(x < y + \varepsilon\) for every \(\varepsilon > 0\). Show that \(x \leq y\).