Problems

Age
Difficulty
Found: 211

Let \(f (x)\) be a polynomial of degree \(n\) with roots \(\alpha_1, \dots , \alpha_n\). We define the polygon \(M\) as the convex hull of the points \(\alpha_1, \dots , \alpha_n\) on the complex plane. Prove that the roots of the derivative of this polynomial lie inside the polygon \(M\).

a) Using geometric considerations, prove that the base and the side of an isosceles triangle with an angle of \(36^{\circ}\) at the vertex are incommensurable.

b) Invent a geometric proof of the irrationality of \(\sqrt{2}\).

At a round table, 2015 people are sitting down, each of them is either a knight or a liar. Knights always tell the truth, liars always lie. They were given one card each, and on each card a number is written; all the numbers on the cards are different. Looking at the cards of their neighbours, each of those sitting at the table said: “My number is greater than that of each of my two neighbors.” After that, \(k\) of the sitting people said: “My number is less than that of each of my two neighbors.” At what maximum \(k\) could this occur?

One hundred cubs found berries in the forest: the youngest managed to grab 1 berry, the next youngest cub – 2 berries, the next – 4 berries, and so on, until the oldest who got \(2^{99}\) berries. The fox suggested that they share the berries “fairly.” She can approach two cubs and distribute their berries evenly between them, and if this leaves an extra berry, then the fox eats it. With such actions, she continues, until all the cubs have an equal number of berries. What is the largest number of berries that the fox can eat?

Hannah Montana wants to leave the round room which has six doors, five of which are locked. In one attempt she can check any three doors, and if one of them is not locked, then she will go through it. After each attempt her friend Michelle locks the door, which was opened, and unlocks one of the neighbouring doors. Hannah does not know which one exactly. How should she act in order to leave the room?

There are 30 students in a class: excellent students, mediocre students and slackers. Excellent students answer all questions correctly, slackers are always wrong, and the mediocre students answer questions alternating one by one correctly and incorrectly. All the students were asked three questions: “Are you an excellent pupil?”, “Are you a mediocre student?”, “Are you a slacker?”. 19 students answered “Yes” to the first question, to the second 12 students answered yes, to the third 9 students answered yes. How many mediocre students study in this class?

100 switched on and 100 switched off lights are randomly arranged in two boxes. Each flashlight has a button, the button of which turns off an illuminated flashlight and switches on a turned off flashlight. Your eyes are closed and you can not see if the flashlight is on. But you can move the flashlights from a box to another box and press the buttons on them. Think of a way to ensure that the burning flashlights in the boxes are equally split.

Gary drew an empty table of \(50 \times 50\) and wrote on top of each column and to the left of each row a number. It turned out that all 100 written numbers are different, and 50 of them are rational, and the remaining 50 are irrational. Then, in each cell of the table, he wrote down a product of numbers written at the top of its column and to the left of the row (the “multiplication table”). What is the largest number of products in this table which could be rational numbers?

The triangle \(C_1C_2O\) is given. Within it the bisector \(C_2C_3\) is drawn, then in the triangle \(C_2C_3O\) – bisector \(C_3C_4\) and so on. Prove that the sequence of angles \(\gamma_n = C_{n + 1}C_nO\) tends to a limit, and find this limit if \(C_1OC_2 = \alpha\).