A nonnegative integer $n$ is said to be $\textit{squarish}$ is it satisfies the following conditions: $\textbf{(i)}$ it contains no digits of $9$; $\textbf{(ii)}$ no matter how we increase exactly one of its digits with $1$, the outcome is a square. Find all squarish nonnegative integers. $\textit{(Vlad Robu)}$

There are $m$ real numbers $x_i \geq 0$ ($i=1,2,...,m$), $n \geq 2$, $\sum_{i=1}^{m} x_i=S$. Prove that\\ \[ \sum_{i=1}^{m} \sqrt[n]{\frac{x_i}{S-x_i}} \geq 2, \] The equation holds if and only if there are exactly two of $x_i$ are equal(not equal to $0$), and the rest are equal to $0$.

Find all sequences of positive integers $\{a_n\}_{n=1}^{\infty}$, for which $a_4=4$ and \[\frac{1}{a_1a_2a_3}+\frac{1}{a_2a_3a_4}+\cdots+\frac{1}{a_na_{n+1}a_{n+2}}=\frac{(n+3)a_n}{4a_{n+1}a_{n+2}}\] for all natural $n \geq 2$. [i]Peter Boyvalenkov[/i]

Let $ABC$ be triangle with circumcircle $(O)$ of fixed $BC$, $AB \ne AC$ and $BC$ not a diameter. Let $I$ be the incenter of the triangle $ABC$ and $D = AI \cap BC, E = BI \cap CA, F = CI \cap AB$. The circle passing through $D$ and tangent to $OA$ cuts for second time $(O)$ at $G$ ($G \ne A$). $GE, GF$ cut $(O)$ also at $M, N$ respectively. a) Let $H = BM \cap CN$. Prove that $AH$ goes through a fixed point. b) Suppose $BE, CF$ cut $(O)$ also at $L, K$ respectively and $AH \cap KL = P$. On $EF$ take $Q$ for $QP = QI$. Let $J$ be a point of the circimcircle of triangle $IBC$ so that $IJ \perp IQ$. Prove that the midpoint of $IJ$ belongs to a fixed circle.

Suppose $\triangle ABC$ has angles $\angle BAC = 84^\circ, \angle ABC=60^\circ,$ and $\angle ACB = 36^\circ.$ Let $D, E,$ and $F$ be the midpoints of sides $\overline{BC}, \overline{AC},$ and $\overline{AB},$ respectively. The circumcircle of $\triangle DEF$ intersects $\overline{BD}, \overline{AE},$ and $\overline{AF}$ at points $G, H,$ and $J,$ respectively. The points $G, D, E, H, J,$ and $F$ divide the circumcircle of $\triangle DEF$ into six minor arcs, as shown. Find $\overarc{DE}+2\cdot \overarc{HJ} + 3\cdot \overarc{FG},$ where the arcs are measured in degrees. [asy] import olympiad; size(6cm); defaultpen(fontsize(10pt)); pair B = (0, 0), A = (Cos(60), Sin(60)), C = (Cos(60)+Sin(60)/Tan(36), 0), D = midpoint(B--C), E = midpoint(A--C), F = midpoint(A--B); guide circ = circumcircle(D, E, F); pair G = intersectionpoint(B--D, circ), J = intersectionpoints(A--F, circ)[0], H = intersectionpoints(A--E, circ)[0]; draw(B--A--C--cycle); draw(D--E--F--cycle); draw(circ); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); dot(J); label("$A$", A, (0, .8)); label("$B$", B, (-.8, -.8)); label("$C$", C, (.8, -.8)); label("$D$", D, (0, -.8)); label("$E$", E, (.8, .2)); label("$F$", F, (-.8, .2)); label("$G$", G, (0, .8)); label("$H$", H, (-.2, -1)); label("$J$", J, (.2, -.8)); [/asy]

In a directed graph with $2013$ vertices, there is exactly one edge between any two vertices and for every vertex there exists an edge outwards this vertex. We know that whatever the arrangement of the edges, from every vertex we can reach $k$ vertices using at most two edges. Find the maximum value of $k$.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

Let $a$, $b$, $c$, and $d$ be positive real numbers such that \[a^2 + b^2 - c^2 - d^2 = 0 \quad \text{and} \quad a^2 - b^2 - c^2 + d^2 = \frac{56}{53}(bc + ad).\] Let $M$ be the maximum possible value of $\tfrac{ab+cd}{bc+ad}$. If $M$ can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $100m + n$. [i]Proposed by Robin Park[/i]

The map of a town shows a plane divided into equal equilateral triangles. The sides of these triangles are streets and their vertices are intersections; $6$ streets meet at each junction. Two cars start simultaneously in the same direction and at the same speed from points $A$ and $B$ situated on the same street (the same side of a triangle). After any intersection an admissible route for each car is either to proceed in its initial direction or turn through $120^o$ to the right or to the left. Can these cars meet? (Either prove that these cars won’t meet or describe a route by which they will meet.) [img]https://cdn.artofproblemsolving.com/attachments/2/d/2c934bcd0c7fc3d9dca9cee0b6f015076abbdb.png[/img]

A round table has room for n diners ( $n\ge 2$). There are napkins in three different colours. In how many ways can the napkins be placed, one for each seat, so that no two neighbours get napkins of the same colour?

Consider all quadratic functions $f(x) = ax^2 +bx+c$ with $a < b$ and $f(x) \ge 0$ for all $x$. What is the smallest possible value of the expression $\frac{a+b+c}{b-a}$?

Find all continuous functions $f$ such that $f(x)+ f(x^2) = 0$ for all real numbers $x$.

Let $ABCD$ be a quadrilateral inscribed in a circle $\omega$. The lines $AB$ and $CD$ meet at $P$, the lines $AD$ and $BC$ meet at $Q$, and the diagonals $AC$ and $BD$ meet at $R$. Let $M$ be the midpoint of the segment $PQ$, and let $K$ be the common point of the segment $MR$ and the circle $\omega$. Prove that the circumcircle of the triangle $KPQ$ and $\omega$ are tangent to one another.

Triangle $ABC$ is inscribed in a circle. Chords $AM$ and $AN$ intersect side $BC$ at points $K$ and $L$ respectively. Prove that if a circle passes through all of the points $K, L, M$ and $N$, then $ABC$ is an isosceles triangle. (V Zhgun)

Given an odd integer $n \geq 3$. Let $V$ be the set of vertices of a regular $n$-gon, and $P$ be the set of all regular polygons formed by points in $V$. For instance, when $n=15$, $P$ consists of $1$ regular $15$-gon, $3$ regular pentagons, and $5$ regular triangles. Initially, all points in $V$ are uncolored. Two players, $A$ and $B$, play a game where they take turns coloring an uncolored point, with player $A$ starting and coloring points red, and player $B$ coloring points blue. The game ends when all points are colored. A regular polygon in $P$ is called $\textit{good}$ if it has more red points than blue points. Find the largest positive integer $k$ such that no matter how player $B$ plays, player $A$ can ensure that there are at least $k$ $\textit{good}$ polygons.

Let $\triangle{ABC}$ be an acute angled triangle. The circle with diameter AB intersects the sides AC and BC at points E and F respectively. The tangents drawn to the circle through E and F intersect at P. Show that P lies on the altitude through the vertex C.

Triangle $ABC$ is inscribed in circle $C.$ The bisectors of the angles $A,B$ and $C$ meet the circle $C$ again at the points $A', B', C'$. Let $I$ be the incenter of $ABC,$ prove that \[\frac{IA'}{IA} + \frac{IB'}{IB}+\frac{IC'}{IC} \geq 3\]\[, IA'+IB'+IC' \geq IA+IB+IC\]

A circle of radius $2$ is centered at $A$. An equilateral triangle with side $4$ has a vertex at $A$. What is the difference between the area of the region that lies inside the circle but outside the triangle and the area of the region that lies inside the triangle but outside the circle? $ \textbf {(A) } 8-\pi \qquad \textbf {(B) } \pi + 2 \qquad \textbf {(C) } 2\pi - \frac {\sqrt{2}}{2} \qquad \textbf {(D) } 4(\pi - \sqrt{3}) \qquad \textbf {(E) } 2\pi + \frac {\sqrt{3}}{2} $

For any positive reals $a,b,c,d$ that satisfy $a^2 + b^2 + c^2 + d^2 = 4,$ show that $$\frac{a^3}{a+b} + \frac{b^3}{b+c} + \frac{c^3}{c+d} + \frac{d^3}{d+a} + 4abcd \leq 6.$$

Let $(a_n), (b_n)$, $n = 1,2,...$ be two sequences of integers defined by $a_1 = 1, b_1 = 0$ and for $n \geq 1$ $a_{n+1} = 7a_n + 12b_n + 6$ $b_{n+1} = 4a_n + 7b_n + 3$ Prove that $a_n^2$ is the difference of two consecutive cubes.

Given a convex polygon with 20 vertexes, there are many ways of traingulation it (as 18 triangles). We call the diagram of triangulation, meaning the 20 vertexes, with 37 edges(17 triangluation edges and the original 20 edges), a T-diagram. And the subset of this T-diagram with 10 edges which covers all 20 vertexes(meaning any two edges in the subset doesn't cover the same vertex) calls a "perfect matching" of this T-diagram. Among all the T-diagrams, find the maximum number of "perfect matching" of a T-diagram.

Is there a power of $2$ such that it is possible to rearrange the digits giving another power of $2$?

Partition $\{1,2,3, ... ,2024\}$ into $506$ sets $\{a_i, b_i, c_i, d_i\}$ such that $a_i<b_i<c_i<d_i$. Find the maximum of \[\sum_{i=1}^{506} (a_i-b_i-c_i+d_i)\] over all partitions. [i]Tiebreaker #2[/i]

Suppose that $\omega$ is a primitive $2007^{\text{th}}$ root of unity. Find $\left(2^{2007}-1\right)\displaystyle\sum_{j=1}^{2006}\dfrac{1}{2-\omega^j}$.

We call a table of size $n \times n$ self-describing if each cell of the table contains the total number of even numbers in its row and column other than itself. How many self-describing tables of size a) $3 \times 3$ exist? b) $4 \times 4$ exist? c) $5 \times 5$ exist? Two tables are different if they differ in at least one cell.