The convex polygon $A_1A_2...A_n$ is given in the plane. Denote by $T_k$ $(k \le n)$ the convex $k$-gon of the largest area, with vertices at the points $A_1, A_2, ..., A_n$ and by $T_k(A+1)$ the convex k-gon of the largest area with vertices at the points $A_1, A_2, ..., A_n$ in which one of the vertices is in $A_1$. Set the relationship between the order of arrangement in the sequence $A_1, A_2, ..., A_n$ vertices: 1) $T_3$ and $T_3 (A_2)$ 2) $T_k$ and $T_k (A_1) $ 3) $T_k$ and $T_{k+1}$

Let $S$ be the set of all tetrahedra which satisfy: (1) the base has area $1$, (2) the total face area is $4$, and (3) the angles between the base and the other three faces are all equal. Find the element of $S$ which has the largest volume.

Let $a, b,c$ be positive real numbers satisfying the condition $$(x + y + z) \left( \frac{1}{x} + \frac{1}{y} + \frac{1}{z}\right)= 10$$ Find the greatest value and the least value of $$T = (x^2 + y^2 + z^2) \left(\frac{1}{x^2} + \frac{1}{y^2} + \frac{1}{z^2}\right)$$ Trần Nam Dũng

Let $n$ be a positive integer. There is a board of $(n + 1) \times (n + 1)$ whose squares are numbered in a diagonal pattern, as as the picture shows. Chepito starts from the lower left square, and moving only up or to the right until he reaches the upper right box. During his tour, Chepito writes down the number of each box on the which made a change of direction, and in the end calculates the sum of all the numbers entered. Determine the maximum value of this sum. [img]https://cdn.artofproblemsolving.com/attachments/e/d/f9dc43092a1407d6fe6f1b2c741af015079946.png[/img]

A cuboid of volume $V$ contains a convex polyhedron $M$. The orthogonal projection of $M$ onto each face of the cuboid covers the entire face. What is the smallest possible volume of polyhedron $M$?

Show that \[ \max\limits_{|x|\leq t} |1 - a \cos x| \geq \tan^2 \frac{t}{2} \] for $a$ positive and $t \in (0, \frac{\pi}{2})$.

In a certain language there are $n$ letters. A sequence of letters is a word, if there are no two equal letters between two other equal letters. Find the number of words of the maximum length.

An $n \times m$ table ( $n \le m$ ) is filled in accordance with the rules of the game "Minesweeper": mines are placed at some cells (not more than one mine at the cell) and in the remaining cells one writes the number of the mines in the neighboring (by side or by vertex) cells. Then the sum of allnumbers in the table is computed (this sum is equal to $9$ for the picture). What is the largest possible value of this sum? (V. Lebed) [img]https://cdn.artofproblemsolving.com/attachments/2/9/726ccdbc57807788a5f6e88a5acb42b10a6cc0.png[/img]

Find positive reals $a, b, c$ which maximizes the value of $a+ 2b+ 3c$ subject to the constraint that $9a^2 + 4b^2 + c^2 = 91$

What maximal number of the men in checkers game can be put on the chess-board $8\times 8$ so, that every man can be taken by at least one other man ?

Show that for all positive real numbers $a, b, c$, we have that $$\frac{a+b+c}{3}-\sqrt[3]{abc} \leq \max\{(\sqrt{a}-\sqrt{b})^2, (\sqrt{b}-\sqrt{c})^2, (\sqrt{c}-\sqrt{a})^2\}$$

Find the maximum and minimum of $x + y$ such that $x + y = \sqrt{2x-1}+\sqrt{4y+3}$

The rook, standing on the surface of the checkered cube, beats the cells, located in the same row as well as on the continuations of this series through one or even several edges. (The picture shows an example for a $4 \times 4 \times 4$ cube,visible cells that some beat the rook, shaded gray.) What is the largest number do not beat each other rooks can be placed on the surface of the cube $50 \times 50 \times 50$?

There are a lot of different real numbers written on the board. It turned out that for each two numbers written, their product was also written. What is the largest possible number of numbers written on the board?

In the right triangle $ABC$ with shorter side $AC$ the hypotenuse $AB$ has length $12$. Denote $T$ its centroid and $D$ the feet of altitude from the vertex $C$. Determine the size of its inner angle at the vertex $B$ for which the triangle $DTC$ has the greatest possible area.

Let $BC$ be a chord of a circle $(O)$ such that $BC$ is not a diameter. Let $AE$ be the diameter perpendicular to $BC$ such that $A$ belongs to the larger arc $BC$ of $(O)$. Let $D$ be a point on the larger arc $BC$ of $(O)$ which is different from $A$. Suppose that $AD$ intersects $BC$ at $S$ and $DE$ intersects $BC$ at $T$. Let $F$ be the midpoint of $ST$ and $I$ be the second intersection point of the circle $(ODF)$ with the line $BC$. 1. Let the line passing through $I$ and parallel to $OD$ intersect $AD$ and $DE$ at $M$ and $N$, respectively. Find the maximum value of the area of the triangle $MDN$ when $D$ moves on the larger arc $BC$ of $(O)$ (such that $D \ne A$). 2. Prove that the perpendicular from $D$ to $ST$ passes through the midpoint of $MN$

Three line segments, all of length $1$, form a connected figure in the plane. Any two different line segments can intersect only at their endpoints. Find the maximum area of the convex hull of the figure.

Let $n \ge 4$ be an integer. Find the maximum value of the area of a $n$-gon which is inscribed in the circle of radius $1$ and has two perpendicular diagonals.

Find inside the triangle $ABC$, points $G$ and $H$ for which, respectively, the geometric mean and the harmonic mean of the distances to the sides of the triangle acquire maximum values. In which cases is the segment $GH$ parallel to one of the sides of the triangle? Find the length of such a segment $GH$.

A meeting was attended by $n$ people. They are welcome to occupy the $k$ table provided $\left( k \le \frac{n}{2} \right)$. Each table is occupied by at least two people. When the meeting begins, the moderator selects two people from each table as representatives for talk to. Suppose that $A$ is the number of ways to choose representatives to speak. Determine the maximum value of $A$ that is possible.

Let $a, b, c, d$ be distinct non-zero real numbers satisfying the following two conditions: $ac = bd$ and $\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}= 4$. Determine the largest possible value of the expression $\frac{a}{c}+\frac{c}{a}+\frac{b}{d}+\frac{d}{b}$.

Let $a, b, c, d$ be integers such that $a > b > c > d \ge -2021$ and $$\frac{a + b}{b + c}=\frac{c + d}{d + a}$$ (and $b + c \ne 0 \ne d + a$). What is the maximum possible value of $ac$?

For positive integers $n \ge 3$ and $r \ge 1$, define $$P(n, r) = (n - 2)\frac{r^2}{2} - (n - 4) \frac{r}{2}$$ We call a triple $(a, b, c)$ of natural numbers, with $a \le b \le c$, an $n$-gonal Pythagorean triple if $P(n, a)+P(n, b) = P(n, c)$. (For $n = 4$, we get the usual Pythagorean triple.) (a) Find an $n$-gonal Pythagorean triple for each $n \ge 3$. (b) Consider all triangles $ABC$ whose sides are $n$-gonal Pythagorean triples for some $n \ge 3$. Find the maximum and the minimum possible values of angle $C$.

For a given positive integer $n$ determine the maximum value of the function $f (x) = \frac{x + x^2 +...+ x^{2n-1}}{(1 + x^n)^2}$ over all $x \ge 0$ and find all positive $x$ for which the maximum is attained.

Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ . What is the greatest possible value of $a_16$?