In a table with $88$ rows and $253$ columns, each cell is colored either purple or yellow. Suppose that for each yellow cell $c$, $$x(c)y(c)\geq184.$$ Where $x(c)$ is the number of purple cells that lie in the same row as $c$, and $y(c)$ is the number of purple cells that lie in the same column as $c$.\\ Find the least possible number of cells that are colored purple.

For a positive integer $n$ and nonzero digits $a$, $b$, and $c$, let $A_n$ be the $n$-digit integer each of whose digits is equal to $a$; let $B_n$ be the $n$-digit integer each of whose digits is equal to $b$, and let $C_n$ be the $2n$-digit (not $n$-digit) integer each of whose digits is equal to $c$. What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$? $\textbf{(A)} \text{ 12} \qquad \textbf{(B)} \text{ 14} \qquad \textbf{(C)} \text{ 16} \qquad \textbf{(D)} \text{ 18} \qquad \textbf{(E)} \text{ 20}$

Let $P$ be a given point inside the triangle $ABC$. Suppose $L,M,N$ are the midpoints of $BC, CA, AB$ respectively and \[PL: PM: PN= BC: CA: AB.\] The extensions of $AP, BP, CP$ meet the circumcircle of $ABC$ at $D,E,F$ respectively. Prove that the circumcentres of $APF, APE, BPF, BPD, CPD, CPE$ are concyclic.

One quadrant of the Cartesian coordinate system is tiled with $1\times 2$ dominoes. The dominoes don’t overlap with each other, they cover the entire quadrant and they all fit in the quadrant. Farringdon the flea is initially sitting at the origin and is allowed to jump from one corner of a domino to the opposite corner any number of times. Is it possible that the dominoes are arranged in such a way that Farringdon is unable to move to a distance greater than 2023 from the origin?

Two polygons are given on the plane. Assume that the distance between any two vertices of the same polygon is at most 1, and that the distance between any two vertices of different polygons is at least $ 1/\sqrt{2}$. Prove that these two polygons have no common interior points. By the way, can two sides of a polygon intersect?

For which natural $n$ there exists a natural number multiple of $n$, whose decimal notation consists only of the digits $8$ and $9$ (possibly only from numbers $8$ or only from numbers $9$)?

Let $\Lambda$ be the set of points in the plane whose coordinates are integers and let $F$ be the collection of all functions from $\Lambda$ to $\{1,-1\}.$ We call a function $f$ in $F$ [i]perfect[/i] if every function $g$ in $F$ that differs from $f$ at finitely many points satisfies the condition \[ \sum_{0<d(P,Q)<2010} \frac{f(P)f(Q)-g(P)g(Q)}{d(P,Q)} \geq 0 \] where $d(P,Q)$ denotes the distance between $P$ and $Q.$ Show that there exist infinitely many [i]perfect[/i] functions that are not translates of each other.

Find all differentiable functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the conditions: $ \text{(i)}\quad\forall x\in\mathbb{Z} \quad f'(x) =0 $ $ \text{(ii)}\quad\forall x\in\mathbb{R}\quad f'(x)=0\implies f(x)=0 $

Find the least six-digit palindrome that is a multiple of $45$. Note that a palindrome is a number that reads the same forward and backwards such as $1441$ or $35253$.

A pupil has tried to make a copy of a convex polygon, drawn inside the unit circle. He draw one side, from its end -- another, and so on. Having finished, he has noticed that the first and the last vertices do not coincide, but are situated $d$ units of length far from each other. The pupil draw angles precisely, but made relative error less than $p$ in the lengths of sides. Prove that $d < 4p$.

Let $\triangle{ABC}$ be a triangle with incenter $I,$ and let $M$ be the midpoint of $\overline{BC}.$ Line $AM$ intersects the circumcircle of triangle $\triangle{IBC}$ at points $P$ and $Q.$ Suppose that $AP=13, AQ=83,$ and $BC=56.$ Find the perimeter of $\triangle{ABC}.$

Let $S=\{1,2,3,\ldots,n\}$, $n$ an odd number. Find the parity of number of permutations $\sigma : S \Rightarrow S$ such that the sequence defined by \[a(i)=|\sigma(i)-i|\] is monotonous.

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.