Fix the triangle $ABC$ on the plane. 1. Denote by $S_L,S_M$ and $S_K$ the areas of triangles whose vertices are, respectively, the bases of bisectors, medians and points of tangency of the inscribed circle of a given triangle $ABC$. Prove that $S_K\le S_L\le S_M$. 2. For the point $X$, which is inside the triangle $ABC$, consider the triangle $T_X$, the vertices of which are the points of intersection of the lines $AX, BX, CX$ with the lines $BC, AC, AB$, respectively. 2.1. Find the position of the point $X$ for which the area of ​​the triangle $T_x$ is the largest possible. 2.2. Suggest an effective criterion for comparing the areas of triangles $T_x$ for different positions of the point $X$. 2.3. Find the positions of the point $X$ for which the perimeter of the triangle $T_x$ is the smallest possible and the largest possible. 2.4. Propose an effective criterion for comparing the perimeters of triangles $T_x$ for different positions of point $X$. 2.5. Suggest and solve similar problems with respect to the extreme values ​​of other parameters (for example, the radius of the circumscribed circle, the length of the greatest height) of triangles $T_x$. 3. For the point $Y$, which is inside the circle $\omega$, circumscribed around the triangle $ABC$, consider the triangle $\Delta_Y$, the vertices of which are the points of intersection $AY, BX, CX$ with the circle $\omega$. Suggest and solve similar problems for triangles $\Delta_Y$ for different positions of point $Y$. 4. Suggest and solve similar problems for convex polygons. 5. For the point $Z$, which is inside the circle $\omega$, circumscribed around the triangle $ABC$, consider the triangle $F_Z$, the vertices of which are orthogonal projections of the point $Z$ on the lines $BC$, $AC$ and $AB$. Suggest and solve similar problems for triangles $F_Z$ for different positions of the point $Z$.

Let $P(x) = x^3 - 3x^2 + 3$. For how many positive integers $n < 1000$ does there not exist a pair $(a, b)$ of positive integers such that the equation \[ \underbrace{P(P(\dots P}_{a \text{ times}}(x)\dots))=\underbrace{P(P(\dots P}_{b \text{ times}}(x)\dots))\] has exactly $n$ distinct real solutions?

Let $n\geq 4$ be a positive integer.Out of $n$ people,each of two individuals play table tennis game(every game has a winner).Find the minimum value of $n$,such that for any possible outcome of the game,there always exist an ordered four people group $(a_{1},a_{2},a_{3},a_{4})$,such that the person $a_{i}$ wins against $a_{j}$ for any $1\leq i<j\leq 4$

In a school with $2022$ students, either a museum trip or a nature trip is organized every day during a holiday. No student participates in the same type of trip twice, and the number of students attending each trip is different. If there are no two students participating in the same two trips together, find the maximum number of trips held.

When \[x^5, \quad x+\frac{1}{x}\quad \text{and}\quad 1+\frac{2}{x} + \frac{3}{x^2}\] are multiplied, the product is a polynomial of degree $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 8 $

Points $ A_1,A_2, ... ,A_n$ inside a circle and points $ B_1,B_2,...,B_n$ on its boundary are positioned so that the segments $ A_1B_1,A_2B_2, ... ,A_nB_n$ do not intersect. A bug can go from point $ A_i$ to $ A_j$ if the segment $ A_iA_j$ does not intersect any segment $ A_kB_k$, $ k \neq i, j$. Prove that the bug can go from any point $ A_p$ to any point $ A_q$ in a finite number of steps.

Are there such pairwise distinct natural numbers $ m, n, p, q$ satisfying $ m \plus{} n \equal{} p \plus{} q$ and $ \sqrt{m} \plus{} \sqrt[3]{n} \equal{} \sqrt{p} \plus{} \sqrt[3]{q} > 2004$ ?

From a collection of $n$ persons $q$ distinct two-member teams are selected and ranked $1, \cdots, q$ (no ties). Let $m$ be the least integer larger than or equal to $2q/n$. Show that there are $m$ distinct teams that may be listed so that : [b](i)[/b] each pair of consecutive teams on the list have one member in common and [b](ii)[/b] the chain of teams on the list are in rank order. [i]Alternative formulation.[/i] Given a graph with $n$ vertices and $q$ edges numbered $1, \cdots , q$, show that there exists a chain of $m$ edges, $m \geq \frac{2q}{n}$ , each two consecutive edges having a common vertex, arranged monotonically with respect to the numbering.

Shade some squares in the grid so that: [list=1] [*]Squares with numbers are unshaded. [*]Each number is equal to the product of the number of unshaded squares it can “see” in its row and column. (A square can see another square if they’re in the same row or column and the sight line between them doesn’t have any shaded squares. Each square can see itself.) [*]The shaded squares must make one connected group. Two squares are considered to be connected if they share an edge. [/list] [asy] size(10cm); int n = 10; // Grid size pair start = (0,0); // Draw the grid for (int i = 0; i <= n; ++i) { draw((start.x + i, start.y) -- (start.x + i, start.y + n), black); // Vertical lines draw((start.x, start.y + i) -- (start.x + n, start.y + i), black); // Horizontal lines } // List of locations and corresponding labels pair locations[] = {(9.5,9.5), (3.5, 8.5), (6.5, 8.5), (2.5, 6.5), (3.5, 6.5), (4.5, 5.5), (5.5,4.5), (6.5,3.5), (7.5,3.5), (3.5,1.5), (6.5,1.5), (0.5,0.5)}; string labels[] = {"4", "6", "6", "36", "24", "16", "24", "36", "18", "6", "12", "36"}; // Add labels using a loop for (int i = 0; i < locations.length; ++i) { label(labels[i], locations[i], fontsize(16pt)); } [/asy]

Eight pieces are placed on a chessboard so that each row and each column contains exactly one piece. Prove that there are an even number of pieces on the black squares of the board.

Let $Z$ be a 6-digit positive integer, such as 247247, whose first three digits are the same as its last three digits taken in the same order. Which of the following numbers must also be a factor of $Z$? $\textbf{(A) }11\qquad\textbf{(B) }19\qquad\textbf{(C) }101\qquad\textbf{(D) }111\qquad\textbf{(E) }1111$

Given a triangle $ABC$, let $A',B',C'$ be the perpendicular feet dropped from the centroid $G$ of the triangle $ABC$ onto the sides $BC,CA,AB$ respectively. Reflect $A',B',C'$ through $G$ to $A'',B'',C''$ respectively. Prove that the lines $AA'',BB'',CC''$ are concurrent.

Let $ABCD$ be a parallelogram with $AC=BC.$ A point $P$ is chosen on the extension of ray $AB$ past $B.$ The circumcircle of $ACD$ meets the segment $PD$ again at $Q.$ The circumcircle of triangle $APQ$ meets the segment $PC$ at $R.$ Prove that lines $CD,AQ,BR$ are concurrent.

Two integers are inserted into the list $3,3,8,11,28$ to double it's range. The mode and median remain unchanged. What is the maximum possible sum of two additional numbers? $\textbf{(A) } 56\qquad \textbf{(B) } 57 \qquad \textbf{(C) } 58 \qquad \textbf{(D) } 60 \qquad \textbf{(E) } 61$

Let $H$ be the orthocenter of triangle $ABC$. Let $D$ and $E$ be points on $AB$ and $AC$ such that $DE$ is parallel to $CH$. If the circumcircle of triangle $BDH$ passes through $M$, the midpoint of $DE$, then prove that $\angle ABM=\angle ACM$

Let $ ABCD$ be a chordal/cyclic quadrilateral. Consider points $ P,Q$ on $ AB$ and $ R,S$ on $ CD$ with \[ \overline{AP}: \overline{PB} \equal{} \overline{CS}: \overline{SD}, \quad \overline{AQ}: \overline{QB} \equal{} \overline{CR}: \overline{RD}.\] How to choose $ P,Q,R,S$ such that $ \overline{PR} \cdot \overline{AB} \plus{} \overline{QS} \cdot \overline{CD}$ is minimal?

In triangle $ ABC$ the bisector of $ \angle ACB$ intersects $ AB$ at $ D$. Consider an arbitrary circle $ O$ passing through $ C$ and $ D$, so that it is not tangent to $ BC$ or $ CA$. Let $ O\cap BC \equal{} \{M\}$ and $ O\cap CA \equal{} \{N\}$. a) Prove that there is a circle $ S$ so that $ DM$ and $ DN$ are tangent to $ S$ in $ M$ and $ N$, respectively. b) Circle $ S$ intersects lines $ BC$ and $ CA$ in $ P$ and $ Q$ respectively. Prove that the lengths of $ MP$ and $ NQ$ do not depend on the choice of circle $ O$.

Let $n_1,n_2, \cdots, n_{26}$ be pairwise distinct positive integers satisfying (1) for each $n_i$, its digits belong to the set $\{1,2\}$; (2) for each $i,j$, $n_i$ can't be obtained from $n_j$ by adding some digits on the right. Find the smallest possible value of $\sum_{i=1}^{26} S(n_i)$, where $S(m)$ denotes the sum of all digits of a positive integer $m$.

A square and an equilateral triangle are inscribed in a same circle. The seven vertices form a convex heptagon $S$ inscribed in the circle ($S$ might be a hexagon if two vertices coincide). For which positions of the triangle relative to the square does $S$ have the largest and smallest area, respectively?

Given a real number $c$ and an integer $m, m \ge 2$. Real numbers $x_1, x_2,... , x_m$ satisfy the conditions $x_1 + x_2 +...+ x_m = 0$ and $\frac{x^2_1 + x^2_2 + ...+ x^2_m}{m}= c$. Find max $(x_1, x_2,..., x_m)$ if it is known to be as small as possible.

Find all real numbers with the following property: the difference of its cube and its square is equal to the square of the difference of its square and the number itself.

Suppose $f : \mathbb{R} \longrightarrow \mathbb{R}$ be a function such that \[2f (f (x)) = (x^2 - x)f (x) + 4 - 2x\] for all real $x$. Find $f (2)$ and all possible values of $f (1)$. For each value of $f (1)$, construct a function achieving it and satisfying the given equation.

Let $p$ be a prime greater than $2$. Prove that $\frac{2}{p}$ can be expressed in exactly one way in the form $$\frac{1}{x}+\frac{1}{y}$$ where $x$ and $y$ are positive integers with $x > y$.

On side $AB$ of triangle $ABC$ a point $P$ is taken such that $AP = 2PB$. It is known that $CP = 2PQ$ where $Q$ is the midpoint of $AC$. Prove that $ABC$ is a right triangle.

Let $A=\{n\in\mathbb{Z}\mid 0<n<2013\}$. A subset $B\subseteq A$ is called [b]reduced[/b] if for any two numbers $x,y\in B$, we must have $x\cdot y \notin B$. For example, any subset containing the numbers $3,5,15$ cannot be reduced, and same for a subset containing $4,16$. [list=a] [*] Find the maximal size of a reduced subset of $A$. [*] How many reduced subsets are there with that maximal size? [/list]