Let $n >1$ be a natural number and $T_{n}(x)=x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + ... + a_1 x^1 + a_0$.\\ Assume that for each nonzero real number $t $ we have $T_{n}(t+\frac {1}{t})=t^n+\frac {1}{t^n} $.\\ Prove that for each $0\le i \le n-1 $ $gcd (a_i,n) >1$. [i]Proposed by Morteza Saghafian[/i]

Let $ABC$ be a triangle with sides $51, 52, 53$. Let $\Omega$ denote the incircle of $\bigtriangleup ABC$. Draw tangents to $\Omega$ which are parallel to the sides of $ABC$. Let $r_1, r_2, r_3$ be the inradii of the three corener triangles so formed, Find the largest integer that does not exceed $r_1 + r_2 + r_3$.

Show that for any positive integers $k$ and $1 \leq a \leq 9$, there exists $n$ such that satisfies the below statement. When $2^n=a_0+10a_1+10^2a_2+ \cdots +10^ia_i+ \cdots $ $(0 \leq a_i \leq 9$ and $a_i$ is integer), $a_k$ is equal to $a$.

Let $ABC$ be a triangle with incircle $\omega$ and incenter $I$. The circle $\omega$ is tangent to $BC$, $CA$, and $AB$ at $D$, $E$, and $F$ respectively. Point $P$ is the foot of the angle bisector from $A$ to $BC$, and point $Q$ is the foot of the altitude from $D$ to $EF$. Suppose $AI=7$, $IP=5$, and $DQ=4$. Compute the radius of $\omega$.

Let $ABC$ be an acute triangle, and let $AA_1, BB_1$, and $CC_1$ be its altitudes. Segments $AA_1$ and $B_1C_1$ meet at point $K$. The perpendicular bisector of segment $A_1K$ intersects sides $AB$ and $AC$ at $L$ and $M$, respectively. Prove that points $A,A_1, L$, and $M$ lie on a circle.

Determine all positive integer numbers $n$ satisfying the following condition: the sum of the squares of any $n$ prime numbers greater than $3$ is divisible by $n$.

There are three number-transforming machines. We input the pair $(a_1, a_2)$, and the machine returns $(b_1, b_2)$. We denote this transformation as $(a_1, a_2) \to (b_1, b_2)$. (a) The first machine can perform two transformations: - $(a, b) \to (a - 1, b - 1)$ - $(a, b) \to (a + 13, b + 5)$ If the input pair is $(5,2)$, is it possible to obtain the pair $(20,22)$ after a series of transformations? (b) The second machine can perform two transformations: - $(a, b) \to (a - 1, b - 1)$ - $(a, b) \to (2a, 2b)$ If the input pair is $(15,10)$, is it possible to obtain the pair $(27,23)$ after a series of transformations? (c) The third machine can perform two transformations: - $(a, b) \to (a - 2, b + 2)$ - $(a, b) \to (2a - b + 1, 2b - 1 - a)$ If the input pair is $(5,8)$, is it possible to obtain the pair $(13,17)$ after a series of transformations?

In how many rearrangements of the numbers $1, \ 2, \ 3, \ 4, \ 5,\ 6, \ 7, \ 8,\ 9$ do the numbers form a $\textit{hill}$, that is, the numbers form an increasing sequence at the beginning up to a peak, and then form a decreasing sequence to the end such as in $129876543$ or $258976431$?

Let $H$ be an $n\times n$ matrix all of whose entries are $\pm1$ and whose rows are mutually orthogonal. Suppose $H$ has an $a\times b$ submatrix whose entries are all $1.$ Show that $ab\le n.$

Suppose we have $2016$ points in a $2$-dimensional plane such that no three lie on a line. Two quadrilaterals are not disjoint if they share an edge or vertex, or if their edges intersect. Show that there are at least $504$ quadrilaterals with vertices among these points such that any two of the quadrilaterals are disjoint.

Prove that there does not exist a polynomial $f(x)$ with integer coefficients for which $f(2008) = 0$ and $f(2010) = 1867$.

For two sets of integers $X$ and $Y$ we define $X\cdot Y$ as the set of all products of an element of $X$ and an element of $Y$. For example, if $X=\{1, 2, 4\}$ and $Y=\{3, 4, 6\}$ then $X\cdot Y=\{3, 4, 6, 8, 12, 16, 24\}.$ We call a set $S$ of positive integers [i] good [/i] if there do not exist sets $A,B$ of positive integers, each with at least two elements and such that the sets $A\cdot B$ and $S$ are the same. Prove that the set of perfect powers greater than or equal to $2025$ is good. ([i]In any of the sets $A$, $B$, $A\cdot B$ no two elements are equal, but any two or three of these sets may have common elements. A perfect power is an integer of the form $n^k$, where $n>1$ and $k > 1$ are integers.[/i]) [i] Lajos Hajdu and Andras Sarkozy, Hungary [/i]

Suppose $a$ and $b$ are positive integers. Isabella and Vidur both fill up an $a \times b$ table. Isabella fills it up with numbers $1, 2, . . . , ab$, putting the numbers $1, 2, . . . , b$ in the first row, $b + 1, b + 2, . . . , 2b$ in the second row, and so on. Vidur fills it up like a multiplication table, putting $ij$ in the cell in row $i$ and column $j$. (Examples are shown for a $3 \times 4$ table below.) [img]https://cdn.artofproblemsolving.com/attachments/6/8/a0855d790069ecd2cd709fbc5e70f21f1fa423.png[/img] Isabella sums up the numbers in her grid, and Vidur sums up the numbers in his grid; the difference between these two quantities is $1200$. Compute $a + b$.

$n$ players participated in a competition. Any two players have played exactly one game, and there was no tie game. For a set of $k(\le n)$ players, if it is able to line the players up so that each player won every player at the back, we call the set [i]ranked[/i]. For each player who participated in the competition, the set of players who lost to the player is ranked. Prove that the whole set of players can be split into three or less ranked sets.

Let $\omega$ be the circumcircle of a triangle $ABC$. Denote by $M$ and $N$ the midpoints of the sides $AB$ and $AC$, respectively, and denote by $T$ the midpoint of the arc $BC$ of $\omega$ not containing $A$. The circumcircles of the triangles $AMT$ and $ANT$ intersect the perpendicular bisectors of $AC$ and $AB$ at points $X$ and $Y$, respectively; assume that $X$ and $Y$ lie inside the triangle $ABC$. The lines $MN$ and $XY$ intersect at $K$. Prove that $KA=KT$.

Two points $A$ and $B$ are selected independently and uniformly at random along the perimeter of a unit square with vertices at $(0,0)$, $(1,0)$, $(0,1)$, and $(1,1)$. The probability that the $y$-coordinate of $A$ is strictly greater than the $y$-coordinate of $B$ can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$. [i]Proposed by Rajiv Movva[/i]

Consider all pairs $(a, b)$ of natural numbers such that the product $a^ab^b$ written in decimal system ends with exactly $98$ zeros. Find the pair $(a, b)$ for which the product $ab$ is the smallest.

Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as \begin{align*} (x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z) \end{align*} with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.

Prove the inequality for all positive integer $n$ : \[ \left(\frac{2n-1}{e}\right)^{\frac{2n-1}{2}}<1\cdot 3\cdot 5\cdots (2n-1)<\left(\frac{2n+1}{e}\right)^{\frac{2n+1}{2}} \]

Anna writes a sequence of integers starting with the number 12. Each subsequent integer she writes is chosen randomly with equal chance from among the positive divisors of the previous integer (including the possibility of the integer itself). She keeps writing integers until she writes the integer 1 for the first time, and then she stops. One such sequence is \[ 12, 6, 6, 3, 3, 3, 1. \] What is the expected value of the number of terms in Anna’s sequence?

Let $ABC$ be an acute angled triangle with orthocenter ${H}$ and circumcenter ${O}$. Assume the circumcenter ${X}$ of ${BHC}$ lies on the circumcircle of ${ABC}$. Reflect $O$ across ${X}$ to obtain ${O'}$, and let the lines ${XH}$and ${O'A}$ meet at ${K}$. Let $L,M$ and $N$ be the midpoints of $\left[ XB \right],\left[ XC \right]$ and $\left[ BC \right]$, respectively. Prove that the points $K,L,M$ and ${N}$ are concyclic.

Let $A=2^7(7^{14}+1)+2^6\cdot 7^{11}\cdot 10^2+2^6\cdot 7^7\cdot 10^{4}+2^4\cdot 7^3\cdot 10^6$. Prove that the number $A$ ends with $14$ zeros. [i](I. Gorodnin)[/i]

A sequence $\{a_n\}$ is defined recursively by $a_1=\frac{1}{2}, $ and for $n\ge 2,$ $0<a_n\leq a_{n-1}$ and \[a_n^2(a_{n-1}+1)+a_{n-1}^2(a_n+1)-2a_na_{n-1}(a_na_{n-1}+a_n+1)=0.\] $(1)$ Determine the general formula of the sequence $\{a_n\};$ $(2)$ Let $S_n=a_1+\cdots+a_n.$ Prove that for $n\ge 1,$ $\ln\left(\frac{n}{2}+1\right)<S_n<\ln(n+1).$

Tnag is repeating the phrase "sigma sigma on the wall'' an infinite number times. Between each word, there is exactly one second of pause. Adam has heard the phrase so many times that he has come up with a game using two numbers $x$ and $y$: Start with a score of 0. [list] [*] At a random time, Adam will hear the word $a$ (each of the 5 words are equally likely to be heard). [*] Then [list] [*] if $a$ is "sigma'', Adam will multiply his score by $x$, and [*] if $a$ is any of the other words, Adam will add $y$ to his score. [/list] [/list] Let $f(x,y)$ be Adam's expected score after infinitely many steps. Find \[ \sum_{n=2}^{\infty}f\left(\frac{1}{n}, \frac{1}{n^2}\right). \]

Jacob likes to watchMickeyMouse Clubhouse! One day, he decides to create his own MickeyMouse head shown below, with two circles $\omega_1$ and $\omega_2$ and a circle $\omega$, and centers $O_1$, $O_2$, and $O$, respectively. Let $\omega_1$ and $\omega$ meet at points $P_1$ and $Q_1$, and let $\omega_2$ and $\omega$ meet at points $P_2$ and $Q_2$. Point $P_1$ is closer to $O_2$ than $Q_1$, and point $P_2$ is closer to $O_1$ than $Q_2$. Given that $P_1$ and $P_2$ lie on $O_1O_2$ such that $O_1P_1 = P_1P_2 = P_2O_2 = 2$, and $Q_1O_1 \parallel Q_2O_2$, the area of $\omega$ can be written as $n \pi$. Find $n$. [img]https://cdn.artofproblemsolving.com/attachments/6/d/d98a05ee2218e80fd84d299d47201669736d99.png[/img]