A positive integer is said to be a “palindrome” if it reads the same from left to right as from right to left. For example 2002 is a palindrome. Find the sum of all 4-digit palindromes.

Let $N$ be the number of $2015$-tuples of (not necessarily distinct) subsets $(S_1, S_2, \dots, S_{2015})$ of $\{1, 2, \dots, 2015 \}$ such that the number of permutations $\sigma$ of $\{1, 2, \dots, 2015 \}$ satisfying $\sigma(i) \in S_i$ for all $1 \le i \le 2015$ is odd. Let $k_2, k_3$ be the largest integers such that $2^{k_2} | N$ and $3^{k_3} | N$ respectively. Find $k_2 + k_3.$ [i]Proposed by Yang Liu[/i]

Let $a,b$ be two different positive integers. Suppose that $a,b$ are relatively prime. Prove that $\dfrac{2a(a^2+b^2)}{a^2-b^2}$ is not an integer.

Convex pentagon $ABCDE$ satisfies $AB \parallel DE$, $BE \parallel CD$, $BC \parallel AE$, $AB = 30$, $BC = 18$, $CD = 17$, and $DE = 20$. Find its area. [i] Proposed by Michael Tang [/i]

Given positive numbers $a,b$. Prove that the following sentences are equivalent: ($1$) $ \sqrt{a} + 1 > \sqrt{b} $; ($2$) for every $ x > 1, ax + \frac{x}{x - 1} > b$.

For positive integers $n,a,b$, if $n=a^2 +b^2$, and $a$ and $b$ are coprime, then the number pair $(a,b)$ is called a [i]square split[/i] of $n$ (the order of $a, b$ does not count). Prove that for any positive $k$, there are only two square splits of the integer $13^k$.

If $a$, $b$ ,$c$ are three positive real numbers such that $ab+bc+ca = 1$, prove that \[ \sqrt[3]{ \frac{1}{a} + 6b} + \sqrt[3]{\frac{1}{b} + 6c} + \sqrt[3]{\frac{1}{c} + 6a } \leq \frac{1}{abc}. \]

Let $ABC$ be a triangle with $AB = 13, BC = 14, $and$ CA = 15$. Suppose $PQRS$ is a square such that $P$ and $R$ lie on line $BC, Q$ lies on line $CA$, and $S$ lies on line $AB$. Compute the side length of this square.

Let $\mathcal M$ be the set of all polynomial functions $f$ of degree at most 3 such that \[\forall x\in[-1,1]:\ |f(x)|\le 1.\] Denote $a$ the (possibly zero) coefficient of $f$ at $x^3.$ Show that there is a positive number $k$ such that \[\forall f\in\mathcal M:\ |a|\le k\] and find the least $k$ with this property.

We make groups of numbers. Each group consists of [i]five[/i] distinct numbers. A number may occur in multiple groups. For any two groups, there are exactly four numbers that occur in both groups. (a) Determine whether it is possible to make $2015$ groups. (b) If all groups together must contain exactly [i]six [/i] distinct numbers, what is the greatest number of groups that you can make? (c) If all groups together must contain exactly [i]seven [/i] distinct numbers, what is the greatest number of groups that you can make?

Find the number of pairs of integers $(a,b)$ with $1 \le a < b \le 57$ such that $a^2$ has a smaller remainder than $b^2$ when divided by $57.$

Find all pairs of integers $(m, n)$ such that $(m - n)^2 =\frac{4mn}{m + n - 1}$

Let $P$ be a point inside the triangle $ABC$, such that the angles $\angle CBP$ and $\angle PAC$ are equal. Denote the intersection of the line $AP$ and the segment $BC$ by $D$, and the intersection of the line $BP$ with the segment $AC$ by $E$. The circumcircles of the triangles $ADC$ and $BEC$ meet at $C$ and $F$. Show that the line $CP$ bisects the angle $DFE$. Please remember to hide your solution. (by using the hide tags of course.. I don't literally mean that you should hide it :ninja: )

Fred and George play a game, as follows. Initially, $x = 1$. Each turn, they pick $r \in \{3,5,8,9\}$ uniformly at random and multiply $x$ by $r$. If $x+1$ is a multiple of 13, Fred wins; if $x+3$ is a multiple of 13, George wins; otherwise, they repeat. Determine the probability that Fred wins the game.

Let $w(x)$ be largest odd divisor of $x$. Let $a,b$ be natural numbers such that $(a,b)=1$ and \\ $a+w(b+1)$ and $b+w(a+1)$ are powers of two. Prove that $a+1$ and $b+1$ are powers of two.

Let us call a sequence $(b_1, b_2, \ldots)$ of positive integers fast-growing if $b_{n+1} \geq b_n + 2$ for all $n \geq 1$. Also, for a sequence $a = (a(1), a(2), \ldots)$ of real numbers and a sequence $b = (b_1, b_2, \ldots)$ of positive integers, let us denote \[ S(a, b) = \sum_{n=1}^{\infty} \left| a(b_n) + a(b_n + 1) + \cdots + a(b_{n+1} - 1) \right|. \] a) Do there exist two fast-growing sequences $b = (b_1, b_2, \ldots)$, $c = (c_1, c_2, \ldots)$ such that for every sequence $a = (a(1), a(2), \ldots)$, if all the series \[ \sum_{n=1}^{\infty} a(n), \quad S(a, b) \quad \text{and} \quad S(a, c) \] are convergent, then the series $\sum_{n=1}^{\infty} |a(n)|$ is also convergent? b) Do there exist three fast-growing sequences $b = (b_1, b_2, \ldots)$, $c = (c_1, c_2, \ldots)$, $d = (d_1, d_2, \ldots)$ such that for every sequence $a = (a(1), a(2), \ldots)$, if all the series \[ S(a, b), \quad S(a, c) \quad \text{and} \quad S(a, d) \] are convergent, then the series $\sum_{n=1}^{\infty} |a(n)|$ is also convergent?

Beatrix is going to place six rooks on a $6\times6$ chessboard where both the rows and columns are labelled $1$ to $6$; the rooks are placed so that no two rooks are in the same row or the same column. The [i]value[/i] of a square is the sum of its row number and column number. The [i]score[/i] of an arrangement of rooks is the least value of any occupied square. The average score over all valid configurations is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

A token is placed in one square of a $m\times n$ board, and is moved according to the following rules: [list] [*]In each turn, the token can be moved to a square sharing a side with the one currently occupied. [*]The token cannot be placed in a square that has already been occupied. [*]Any two consecutive moves cannot have the same direction.[/list] The game ends when the token cannot be moved. Determine the values of $m$ and $n$ for which, by placing the token in some square, all the squares of the board will have been occupied in the end of the game.

The planet Tetraincognito covered by ocean has the shape of a regular tetrahedron with an edge of $900$ km. What area of the ocean will the tsunami' cover $2$ hours after the earthquake with the epicenter in a) the center of the face, b) the middle of the edge, if the tsunami propagation speed is $300$ km / h?

Let $ABCD$ be a convex quadrilateral. On the sides $AB$ and $CD$ there are interior points $K$ and $L$, respectively, such that $\angle BAL = \angle CDK$. Prove that the following statements are equivalent: $i) \angle BLA= \angle CKD$ $ii) AD \parallel BC $

Consider an isosceles triangle $ABC$ with $AB = AC$. Let $\omega(XYZ)$ be the circumcircle of the triangle $XY Z$. The tangents to $\omega(ABC)$ through $B$ and $C$ meet at the point $D$. The point $F$ is marked on the arc $AB$ of $\omega(ABC)$ that does not contain $C$. Let $K$ be the point of intersection of lines $AF$ and $BD$ and $L$ the point of intersection of the lines $AB$ and $CF$. Let $T$ and $S$ be the centers of the circles $\omega(BLC)$ and $\omega(BLK)$, respectively. Suppose that the circles $\omega(BTS)$ and $\omega(CFK)$ are tangent to each other at the point $P$. Prove that $P$ belongs to the line $AB$.

A natural number $n$ is given. Prove that $$\sum_{n \le p \le n^2} \frac{1}{p} < 2$$ where the sum is across all primes $p$ in the range $[n, n^2]$

Given a positive integer $n>1$. In the cells of an $n\times n$ board, marbles are placed one by one. Initially there are no marbles on the board. A marble could be placed in a free cell neighboring (by side) with at least two cells which are still free. Find the greatest possible number of marbles that could be placed on the board according to these rules.

Finite set $\{a_1, a_2, ..., a_n, b_1, b_2, ..., b_n\}=\{1, 2, …, 2n\}$ is given. If $a_1<a_2<...<a_n$ and $b_1>b_2>...>b_n$, show that $$\sum_{i=1}^n |a_i-b_i|=n^2$$

There are $ n \geq 5$ pairwise different points in the plane. For every point, there are just four points whose distance from which is $ 1$. Find the maximum value of $ n$.