Problems

Age
Difficulty
Found: 578

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}\).

\(x_1\) is the real root of the equation \(x^2 + ax + b = 0\), \(x_2\) is the real root of the equation \(x^2 - ax - b = 0\).

Prove that the equation \(x^2 + 2ax + 2b = 0\) has a real root, enclosed between \(x_1\) and \(x_2\). (\(a\) and \(b\) are real numbers).

We are given a \(100\times 100\) square grid and \(N\) counters. All of the possible arrangements of the counters on the grid which follow the following rule are considered: no two counters lie in adjacent squares.

What is the largest value of \(N\) for which, in every single possible arrangement of counters following this rule, it is possible to find at least one counter such that moving it to an adjacent square does not break the rule. Squares are considered adjacent if they share a side.

With a non-zero number, the following operations are allowed: \(x \rightarrow \frac{1+x}{x}\), \(x \rightarrow \frac{1-x}{x}\). Is it true that from every non-zero rational number one can obtain each rational number with the help of a finite number of such operations?

What is the largest number of counters that can be put on the cells of a chessboard so that on each horizontal, vertical and diagonal (not only on the main ones) there is an even number of counters?

Seven triangular pyramids stand on the table. For any three of them, there is a horizontal plane that intersects them along triangles of equal area. Prove that there is a plane intersecting all seven pyramids along triangles of equal area.