For each positive integer $n$, denote by $\omega(n)$ the number of distinct prime divisors of $n$ (for example, $\omega(1)=0$ and $\omega(12)=2$). Find all polynomials $P(x)$ with integer coefficients, such that whenever $n$ is a positive integer satisfying $\omega(n)>2023^{2023}$, then $P(n)$ is also a positive integer with \[\omega(n)\ge\omega(P(n)).\] Greece (Minos Margaritis - Iasonas Prodromidis)

Suppose a biased coin gives head with probability $\dfrac{2}{3}$. The coin is tossed repeatedly, if it shows heads then player $A$ rolls a fair die, otherwise player $B$ rolls the same die. The process ends when one of the players get a $6$, and that player is declared the winner. If the probability that $A$ will win is given by $\dfrac{m}{n}$ where $m,n$ are coprime, then what is the value of $m^2n$?

Solve the equation in postive integers $$x^2+y^2+1998=1997x-1999y.$$

Suppose there are $2017$ spies, each with $\frac{1}{2017}$th of a secret code. They communicate by telephone; when two of them talk, they share all information they know with each other. What is the minimum number of telephone calls that are needed for all 2017 people to know all parts of the code?

Diagonal $ DB$ of rectangle $ ABCD$ is divided into $ 3$ segments of length $ 1$ by parallel lines $ L$ and $ L'$ that pass through $ A$ and $ C$ and are perpendicular to $ DB$. The area of $ ABCD$, rounded to the nearest tenth, is [asy]size(200); defaultpen(linewidth(0.7)+fontsize(10)); real x=sqrt(6), y=sqrt(3), a=0.4; pair D=origin, A=(0,y), B=(x,y), C=(x,0), E=foot(C,B,D), F=foot(A,B,D); real r=degrees(B); pair M1=F+3*dir(r)*dir(90), M2=F+3*dir(r)*dir(-90), N1=E+3*dir(r)*dir(90), N2=E+3*dir(r)*dir(-90); markscalefactor=0.02; draw(B--C--D--A--B--D^^M1--M2^^N1--N2^^rightanglemark(A,F,B,6)^^rightanglemark(N1,E,B,6)); pair W=A+a*dir(135), X=B+a*dir(45), Y=C+a*dir(-45), Z=D+a*dir(-135); label("A", A, NE); label("B", B, NE); label("C", C, dir(0)); label("D", D, dir(180)); label("$L$", (x/2,0), SW); label("$L^\prime$", C, SW); label("1", D--F, NW); label("1", F--E, SE); label("1", E--B, SE); clip(W--X--Y--Z--cycle); [/asy] $ \textbf{(A)}\ 4.1 \qquad \textbf{(B)}\ 4.2 \qquad \textbf{(C)}\ 4.3 \qquad \textbf{(D)}\ 4.4 \qquad \textbf{(E)}\ 4.5$

Let $a, b, c$ be the lengths of the sides of a triangle, and let $S$ be its area. We know that $S = \frac14 (c^2 - a^2 - b^2)$. Prove that $\angle C = 135^o$.

Let $n \geq 3$ be a positive integer. A [i]chipped $n$-board[/i] is a $2 \times n$ checkerboard with the bottom left square removed. Lino wants to tile a chipped $n$-board and is allowed to use the following types of tiles: [list] [*] Type 1: any $1 \times k$ board where $1 \leq k \leq n$ [*] Type 2: any chipped $k$-board where $1 \leq k \leq n$ that must cover the left-most tile of the $2 \times n$ checkerboard. [/list] Two tilings $T_1$ and $T_2$ are considered the same if there is a set of consecutive Type 1 tiles in both rows of $T_1$ that can be vertically swapped to obtain the tiling $T_2$. For example, the following three tilings of a chipped $7$-board are the same: [img]http://i.imgur.com/8QaSgc0.png[/img] For any positive integer $n$ and any positive integer $1 \leq m \leq 2n - 1$, let $c_{m,n}$ be the number of distinct tilings of a chipped $n$-board using exactly $m$ tiles (any combination of tile types may be used), and define the polynomial $$P_n(x) = \sum^{2n-1}_{m=1} c_{m,n}x^m.$$ Find, with justification, polynomials $f(x)$ and $g(x)$ such that $$P_n(x) = f(x)P_{n-1}(x) + g(x)P_{n-2}(x)$$ for all $n \geq 3$.

The numbers $1, 2, 3, . . . , 101$ are written in a row in some order. Prove that it is always possible to erase $90 $ of the numbers so that the remaining $11$ numbers remain arranged in either increasing or decreasing order.

A cafe has 3 tables and 5 individual counter seats. People enter in groups of size between 1 and 4, inclusive, and groups never share a table. A group of more than 1 will always try to sit at a table, but will sit in counter seats if no tables are available. Conversely, a group of 1 will always try to sit at the counter first. One morning, $M$ groups consisting of a total of $N$ people enter and sit down. Then, a single person walks in, and realizes that all the tables and counter seats are occupied by some person or group. What is the minimum possible value of $M + N$?

For coprime positive integers $a,b$,denote $(a^{-1}\bmod{b})$ by the only integer $0\leq m<b$ such that $am\equiv 1\pmod{b}$ (1)Prove that for pairwise coprime integers $a,b,c$, $1<a<b<c$,we have\[(a^{-1}\bmod{b})+(b^{-1}\bmod{c})+(c^{-1}\bmod{a})>\sqrt a.\] (2)Prove that for any positive integer $M$,there exists pairwise coprime integers $a,b,c$, $M<a<b<c$ such that \[(a^{-1}\bmod{b})+(b^{-1}\bmod{c})+(c^{-1}\bmod{a})< 100\sqrt a.\]

On the board are written $n$ natural numbers, $n\in \mathbb{N}$. In one move it is possible to choose two equal written numbers and increase one by $1$ and decrease the other by $1$. Prove that in this the game cannot be played more than $\frac{n^3}{6}$ moves.

Let $x$ be a real number such that $\sin^{10}x+\cos^{10} x = \tfrac{11}{36}$. Then $\sin^{12}x+\cos^{12} x = \tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Finds the sum of the infinite series $1+2\left(\dfrac{1}{1998}\right)+3\left(\dfrac{1}{1998}\right)^2+4\left(\dfrac{1}{1998}\right)^3+\cdots$.

Let $ABC$ be a triangle, let $I$ be its incenter, let $\Omega$ be its circumcircle, and let $\omega$ be the $A$- mixtilinear incircle. Let $D,E$ and $T$ be the intersections of $\omega$ and $AB,AC$ and $\Omega$, respectively, let the line $IT$ cross $\omega$ again at $P$, and let lines $PD$ and $PE$ cross the line $BC$ at $M$ and $N$ respectively. Prove that points $D,E,M,N$ are concyclic. What is the center of this circle?

Let $f(r)$ be the number of lattice points inside the circle radius $r$, center the origin. Show that $\lim_{r\to \infty} \frac{f(r)}{r^2}$ exists and find it. If the limit is $k$, put $g(r) = f(r) - kr^2$. Is it true that $\lim_{r\to \infty} \frac{g(r)}{r^h} = 0$ for any $h < 2$?

You are given $n \geq 3$ distinct real numbers. Prove that one can choose either $3$ numbers with positive sum, or $2$ numbers with negative sum. [i]Proposed by Mykhailo Shtandenko[/i]

If $ ABCDEFG$ is a regular $ 7$-gon with side $ 1$, show that: $ \frac{1}{AC}\plus{}\frac{1}{AD}\equal{}1$.

$32$ competitors participate in a tournament. No two of them are equal and in a one against one match the better always wins. Show that the gold, silver, and bronze medal winners can be found in $39$ matches.

Thirty numbers are placed on a circle. For every number $A$ we have: $A$ equals the absolute value of $(B- C)$, where $B$ and $C$ follow $A$ clockwise. The total sum of the numbers equals $1$. Find all the numbers. (Folklore)

How many four-digit integers $abcd$, with $a \neq 0$, have the property that the three two-digit integers $ab<bc<cd$ form an increasing arithmetic sequence? One such number is $4692$, where $a=4$, $b=6$, $c=9$, and $d=2$. $\textbf{(A)}\ 9\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 16\qquad\textbf{(D)}\ 17\qquad\textbf{(E)}\ 20$

What is $10 \cdot \left(\tfrac{1}{2} + \tfrac{1}{5} + \tfrac{1}{10}\right)^{-1}?$ ${ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ \frac{25}{2}\qquad\textbf{(D)}}\ \frac{170}{3}\qquad\textbf{(E)}\ 170$

Let $\omega$ be the circumcircle of triangle $ABC$, $O$ be its center, $A'$ be the point of $\omega$ opposite to $A$, and $D$ be a point on a minor arc $BC$ of $\omega$. A point $D'$ is the reflection of $D$ about $BC$. The line $A'D'$ meets for the second time at point $E$. The perpendicular bisector to $D'E$ meets $AB$ and $AC$ at points $F$ and $G$ respectively. Prove that $\angle FOG = 180^\circ - 2\angle BAC$.

$ 30$ students participated in the mathematical Olympiad. Each of them was given $ 8$ problems to solve. Jury estimated their work with the following rule: 1) Each problem was worth $ k$ points, if it wasn't solved by exactly $ k$ students; 2) Each student received the maximum possible points in each problem or got $ 0$ in it; Lasha got the least number of points. What's the maximal number of points he could have? Remark: 1) means that if the problem was solved by exactly $ k$ students, than each of them got $ 30 \minus{} k$ points in it.

$(POL 2)$ Given two segments $AB$ and $CD$ not in the same plane, find the locus of points $M$ such that $MA^2 +MB^2 = MC^2 +MD^2.$

$SABCD$ is quadrangular pyramid. Lateral faces are acute triangles with orthocenters lying in one plane. $ABCD$ is base of pyramid and $AC$ and $BD$ intersects at $P$, where $SP$ is height of pyramid. Prove that $AC \perp BD$