We define the following sequence: $a_0=a_1=1$, $a_{n+1}=14a_n-a_{n-1}$. Prove that $2a_n-1$ is a perfect square.

Let $ABCD$ be an inscribed quadrilateral whose diagonals are connected internally. are perpendicular to each other and intersect at the point $P$. Prove that the line connecting the midpoints of the opposite sides of the quadrilateral $ABCD$ bisects the lines $OP$ ($O$ is the center of the circle circumscribed around quadrilateral $ABCD$). (Alexander Dunyak)

An integer $x$ is selected at random between 1 and $2011!$ inclusive. The probability that $x^x - 1$ is divisible by $2011$ can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m$. [i]Author: Alex Zhu[/i]

Let $AB$ and $AC$ be two distinct rays not lying on the same line, and let $\omega$ be a circle with center $O$ that is tangent to ray $AC$ at $E$ and ray $AB$ at $F$. Let $R$ be a point on segment $EF$. The line through $O$ parallel to $EF$ intersects line $AB$ at $P$. Let $N$ be the intersection of lines $PR$ and $AC$, and let $M$ be the intersection of line $AB$ and the line through $R$ parallel to $AC$. Prove that line $MN$ is tangent to $\omega$. [i]Warut Suksompong, Thailand[/i]

Determine all functions $f : R\to R$ satisfying: $$f(xy + 2x + 2y - 1) = f(x)f(y) + f(y) + x -2$$ for all real numbers $x, y$.

Find the tangents of the angles of a triangle knowing that they are positive integers.

Is there a strictly increasing function $f:\mathbb{R}\to\mathbb{R}$ such that $f'(x)=f(f(x))$ for all $x?$

Two congruent rectangles are located as shown in the figure. Find the area of the shaded part. [img]https://cdn.artofproblemsolving.com/attachments/2/e/10b164535ab5b3a3b98ce1a0b84892cd11d76f.png[/img]

Prove that any triangle can be cut into $2019$ quadrilaterals such that each quadrilateral is both inscribed and circumscribed. (Nairi Sedrakyan)

There are $172$ two-way direct airways between $20$ cities, at most one between any two cities. Prove that one can reach any city from any other city with at most one transfer.

Let $M = \{1,2,\cdots , 10\}$, and let $T$ be a set of 2-element subsets of $M$. For any two different elements $\{a,b\}, \{x,y\}$ in $T$, the integer $(ax+by)(ay+bx)$ is not divisible by 11. Find the maximum size of $T$.

Compute the number of ordered pairs $(m,n)$ of positive integers that satisfy the equation $\text{lcm}(m,n)+\gcd(m,n)=m+n+30$. [i]Proposed by Ankit Bisain[/i]

Let $p$ be a prime and suppose $2^{2p} \equiv 1 (\text{mod}$ $ 2p+1)$ is prime. Prove that $2p+1$ is prime$^{1}$ [size=75]$^{1}$This is a special case of Pocklington's theorem. A proof of this special case is required.[/size]

Do there exist infinitely many triples of positive integers $(a, b, c)$ such that $a$, $b$, $c$ are pairwise coprime, and $a! + b! + c!$ is divisible by $a^2 + b^2 + c^2$? [i]Proposed by Anzo Teh Zhao Yang[/i]

Quadrilateral $ABCD$ is both cyclic and circumscribed. Its incircle touches its sides $AB$ and $CD$ at points $X$ and $Y$, respectively. The perpendiculars to $AB$ and $CD$ drawn at $A$ and $D$, respectively, meet at point $U$; those drawn at $X$ and $Y$ meet at point $V$, and finally, those drawn at $B$ and $C$ meet at point $W$. Prove that points $U$, $V$ and $W$ are collinear. [i]Proposed by A. Golovanov[/i]

Alex has $75$ red tokens and $75$ blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token, and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end? ${ \textbf{(A)}\ 62 \qquad\textbf{(B)}\ 82 \qquad\textbf{(C)}\ 83\qquad\textbf{(D}}\ 102\qquad\textbf{(E)}\ 103 $

The two intersections of the circles $k_i$ and $k_{i + 1}$ are $P_i$ and $Q_i$ ($1 \le i \le 5, k_6 = k_1$). On the circle $k_1$ lies an arbitrary point $A$. Then the points $B, C, D, E, F, G, H, I, J, K$ lie on the circles $k_2, k_3, k_4, k_5, k_1, k_2, k_3, k_4, k_5, k_1$ respectively, such that $AP_1B, BP_2C, CP_3D, DP_4E, EP_5F, F Q_1G, GQ_2H, HQ_3I, IQ_4J, JQ_5K$ are straight line triplets. Prove that that $K = A$. [img]https://1.bp.blogspot.com/-g6rF1hcPE08/X9j1SEJT7-I/AAAAAAAAMzc/2rWIiWTHZ34zfWVeGujkCxRW1hSCw5oOwCLcBGAsYHQ/s16000/2016%2BDurer%2BC..4.png[/img] [i]Circles can have different radii, and They can be located in different ways from the figure. We assume that during editing none neither of the two points mentioned above coincide.[/i]

There is the number $1$ on the board at the beginning. If the number $a$ is written on the board, then we can also write a natural number $b$ such that $a + b + 1$ is a divisor of $a^2 + b^2 + 1$. Can any positive integer appear on the board after a certain time? Justify your answer.

Compute the number of non-empty subsets $S$ of $\{-3, -2, -1, 0, 1, 2, 3\}$ with the following property: for any $k \ge 1$ distinct elements $a_1, \dots, a_k \in S$ we have $a_1 + \dots + a_k \neq 0$. [i]Proposed by Evan Chen[/i]

We want to cover a rectangular $5 \times 137$ with the following figures, prove that this is impossible. \[\text{Squars are the same and all are } \Huge{1 \times 1}\] [asy] import graph; size(400); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen xdxdff = rgb(0.49,0.49,1); draw((2,4)--(0,4),linewidth(2pt)); draw((0,4)--(0,0),linewidth(2pt)); draw((0,0)--(2,0),linewidth(2pt)); draw((2,0)--(2,1),linewidth(2pt)); draw((2,1)--(0,1),linewidth(2pt)); draw((1,0)--(1,4),linewidth(2pt)); draw((2,4)--(2,3),linewidth(2pt)); draw((2,3)--(0,3),linewidth(2pt)); draw((0,2)--(1,2),linewidth(2pt)); label("(1)", (0.56,-1.54), SE*lsf); draw((4,2)--(4,1),linewidth(2pt)); draw((7,2)--(7,1),linewidth(2pt)); draw((4,2)--(7,2),linewidth(2pt)); draw((4,1)--(7,1),linewidth(2pt)); draw((6,0)--(6,3),linewidth(2pt)); draw((5,3)--(5,0),linewidth(2pt)); draw((5,0)--(6,0),linewidth(2pt)); draw((5,3)--(6,3),linewidth(2pt)); label("(2)", (5.13,-1.46), SE*lsf); draw((9,0)--(9,3),linewidth(2pt)); draw((10,3)--(10,0),linewidth(2pt)); draw((12,3)--(12,0),linewidth(2pt)); draw((11,0)--(11,3),linewidth(2pt)); draw((9,2)--(12,2),linewidth(2pt)); draw((12,1)--(9,1),linewidth(2pt)); draw((9,3)--(10,3),linewidth(2pt)); draw((11,3)--(12,3),linewidth(2pt)); draw((12,0)--(11,0),linewidth(2pt)); draw((9,0)--(10,0),linewidth(2pt)); label("(3)", (10.08,-1.48), SE*lsf); draw((14,1)--(17,1),linewidth(2pt)); draw((15,2)--(17,2),linewidth(2pt)); draw((15,2)--(15,0),linewidth(2pt)); draw((15,0)--(14,0)); draw((14,1)--(14,0),linewidth(2pt)); draw((16,2)--(16,0),linewidth(2pt)); label("(4)", (15.22,-1.5), SE*lsf); draw((14,0)--(16,0),linewidth(2pt)); draw((17,2)--(17,1),linewidth(2pt)); draw((19,3)--(19,0),linewidth(2pt)); draw((20,3)--(20,0),linewidth(2pt)); draw((20,3)--(19,3),linewidth(2pt)); draw((19,2)--(20,2),linewidth(2pt)); draw((19,1)--(20,1),linewidth(2pt)); draw((20,0)--(19,0),linewidth(2pt)); label("(5)", (19.11,-1.5), SE*lsf); dot((0,0),ds); dot((0,1),ds); dot((0,2),ds); dot((0,3),ds); dot((0,4),ds); dot((1,4),ds); dot((2,4),ds); dot((2,3),ds); dot((1,3),ds); dot((1,2),ds); dot((1,1),ds); dot((2,1),ds); dot((2,0),ds); dot((1,0),ds); dot((5,0),ds); dot((6,0),ds); dot((5,1),ds); dot((6,1),ds); dot((5,2),ds); dot((6,2),ds); dot((5,3),ds); dot((6,3),ds); dot((7,2),ds); dot((7,1),ds); dot((4,1),ds); dot((4,2),ds); dot((9,0),ds); dot((9,1),ds); dot((9,2),ds); dot((9,3),ds); dot((10,0),ds); dot((11,0),ds); dot((12,0),ds); dot((10,1),ds); dot((10,2),ds); dot((10,3),ds); dot((11,1),ds); dot((11,2),ds); dot((11,3),ds); dot((12,1),ds); dot((12,2),ds); dot((12,3),ds); dot((14,0),ds); dot((15,0),ds); dot((16,0),ds); dot((15,1),ds); dot((14,1),ds); dot((16,1),ds); dot((15,2),ds); dot((16,2),ds); dot((17,2),ds); dot((17,1),ds); dot((19,0),ds); dot((20,0),ds); dot((19,1),ds); dot((20,1),ds); dot((19,2),ds); dot((20,2),ds); dot((19,3),ds); dot((20,3),ds); clip((-0.41,-10.15)--(-0.41,8.08)--(21.25,8.08)--(21.25,-10.15)--cycle); [/asy]

Given integer $n$, let $W_n$ be the set of complex numbers of the form $re^{2qi\pi}$, where $q$ is a rational number so that $q_n \in Z$ and $r$ is a real number. Suppose that p is a polynomial of degree $ \ge 2$ such that there exists a non-constant function $f : W_n \to C$ so that $p(f(x))p(f(y)) = f(xy)$ for all $x, y \in W_n$. If $p$ is the unique monic polynomial of lowest degree for which such an $f$ exists for $n = 65$, find $p(10)$.

In equilateral triangle $ABC$, a circle $\omega$ is drawn such that it is tangent to all three sides of the triangle. A line is drawn from $A$ to point $D$ on segment $BC$ such that $AD$ intersects $\omega$ at points $E$ and $F$. If $EF = 4$ and $AB = 8$, determine $|AE - FD|$.

For a positive integer $n$, numbers $2n+1$ and $3n+1$ are both perfect squares. Is it possible for $5n+3$ to be prime?

Show that, for any sequence $a_1,a_2,\ldots$ of real numbers, the two conditions \[ \lim_{n\to\infty}\frac{e^{(ia_1)} + e^{(ia_2)} + \cdots + e^{(ia_n)}}n = \alpha \] and \[ \lim_{n\to\infty}\frac{e^{(ia_1)} + e^{(ia_2)} + \cdots + e^{(ia_{n^2})}}{n^2} = \alpha \] are equivalent.

Given $\triangle ABC$ and it's orthocenter $H$. Point $P$ is arbitrary chosen on the side $ BC$. Let $Q$ and $R$ be reflections of point $P$ over sides $AB, AC$. It is given that points $Q,H,R$ are collinear. Prove that $\triangle ABC$ is right angled.