If ${a, b}$ and $c$ are positive real numbers, prove that \begin{align*} a ^ 3b ^ 6 + b ^ 3c ^ 6 + c ^ 3a ^ 6 + 3a ^ 3b ^ 3c ^ 3 &\ge{ abc \left (a ^ 3b ^ 3 + b ^ 3c ^ 3 + c ^ 3a ^ 3 \right) + a ^ 2b ^ 2c ^ 2 \left (a ^ 3 + b ^ 3 + c ^ 3 \right)}. \end{align*} [i](Montenegro).[/i]

A palindrome is a number that remains the same when its digits are reversed. Let $n$ be a product of distinct primes not divisible by $10$. Prove that infinitely many multiples of $n$ are palindromes.

The sequence $f_1, f_2, \cdots, f_n, \cdots $ of functions is defined for $x > 0$ recursively by \[f_1(x)=x , \quad f_{n+1}(x) = f_n(x) \left(f_n(x) + \frac 1n \right)\] Prove that there exists one and only one positive number $a$ such that $0 < f_n(a) < f_{n+1}(a) < 1$ for all integers $n \geq 1.$

Solve the system of equations: $\left\{ \begin{aligned} x^4+y^2-xy^3-\frac{9}{8}x = 0 \\ y^4+x^2-yx^3-\frac{9}{8}y=0 \end{aligned} \right.$

Prove that the equation \[ 2^x + 5^y - 31^z = n! \] has only a finite number of non-negative integer solutions $x,y,z,n$.

For how many values of $k$ is $12^{12}$ the least common multiple of the positive integers $6^6, 8^8,$ and $k$?

Find the sum of all distinct possible values of $x^2-4x+100$, where $x$ is an integer between 1 and 100, inclusive. [i]Proposed by Robin Park[/i]

In the triangle $ABC$ on the side $BC$, the points$ D$ and $E$ are chosen so that the angle $BAD$ is equal to the angle $EAC$. Let $I$ and $J$ be the centers of the inscribed circles of triangles $ABD$ and $AEC$ respectively, $F$ be the point of intersection of $BI$ and $EJ$, $G$ be the point of intersection of $DI$ and $CJ$. Prove that the points $I, J, F, G$ lie on one circle, the center of which belongs to the line $I_bI_c$, where $I_b$ and $I_c$ are the centers of the exscribed circles of the triangle $ABC$, which touch respectively sides $AC$ and $AB$.

For every nonnegative integer $n{}$ let $f(n)$ be the smallest number of digits $1$ which can represent the number $n{}$ using the symbols $"+", "-", "\times", "(", ")"$. For example, $80=(1+1+1+1+1)\times(1+1+1+1)\times(1+1+1+1)$ and $f(80)\leq 13$. Prove that $2\log_3 n \leq f(n) < 5\log_3 n$ for every $n>1$.

Let $P$ be a point inside triangle $ABC$. Let $AP$ meet $BC$ at $A_1$, let $BP$ meet $CA$ at $B_1$, and let $CP$ meet $AB$ at $C_1$. Let $A_2$ be the point such that $A_1$ is the midpoint of $PA_2$, let $B_2$ be the point such that $B_1$ is the midpoint of $PB_2$, and let $C_2$ be the point such that $C_1$ is the midpoint of $PC_2$. Prove that points $A_2, B_2$, and $C_2$ cannot all lie strictly inside the circumcircle of triangle $ABC$. (Australia)

Calculate $ \sum_{i=2}^{\infty}\frac{i^2-2}{i!} . $

Define a regular $n$-pointed star to be the union of $n$ line segments $P_1P_2, P_2P_3,\ldots, P_nP_1$ such that $\bullet$ the points $P_1, P_2,\ldots, P_n$ are coplanar and no three of them are collinear, $\bullet$ each of the $n$ line segments intersects at least one of the other line segments at a point other than an endpoint, $\bullet$ all of the angles at $P_1, P_2,\ldots, P_n$ are congruent, $\bullet$ all of the $n$ line segments $P_2P_3,\ldots, P_nP_1$ are congruent, and $\bullet$ the path $P_1P_2, P_2P_3,\ldots, P_nP_1$ turns counterclockwise at an angle of less than 180 degrees at each vertex. There are no regular 3-pointed, 4-pointed, or 6-pointed stars. All regular 5-pointed stars are similar, but there are two non-similar regular 7-pointed stars. How many non-similar regular 1000-pointed stars are there?

Evaluate \[ \int_e^{e^{2009}} \frac{1}{x}\left\{1\plus{}\frac{1\minus{}\ln x}{\ln x\cdot \ln \frac{x}{\ln (\ln x)}}\right\}\ dx\]

Prove that every positive rational number can be represented in the form \[\frac{a^{3}+b^{3}}{c^{3}+d^{3}}\] for some positive integers $a, b, c$, and $d$.

Find all pairs of positive integers $(a,b)$ such that: \[\dfrac{a^3+4b}{a+2b^2+2a^2b}\] is a positive integer.

Three different points $A,B$ and $C$ lie on a circle with center $M$ so that $| AB | = | BC |$. Point $D$ is inside the circle in such a way that $\vartriangle BCD$ is equilateral. Let $F$ be the second intersection of $AD$ with the circle . Prove that $| F D | = | FM |$.

Given the line $y = \dfrac{3}{4}x + 6$ and a line $L$ parallel to the given line and $4$ units from it. A possible equation for $L$ is: $\textbf{(A)}\ y = \dfrac{3}{4}x + 1 \qquad \textbf{(B)}\ y = \dfrac{3}{4}x\qquad \textbf{(C)}\ y = \dfrac{3}{4}x -\dfrac{2}{3} \qquad$ $ \textbf{(D)}\ y = \dfrac{3}{4}x -1 \qquad \textbf{(E)}\ y = \dfrac{3}{4}x + 2$

Let $f(n)$ be the probability that, if $k \in \{1, 2, ... , 2n\}$ is randomly selected, then $1 + 2 + ... +k$ will be divisible by $n$. Prove that $f(n)$ is distinct for every positive integer $n$.

Find the maximal value of \[ \left( x^3+1 \right) \left( y^3 + 1\right) , \] where $x,y \in \mathbb R$, $x+y=1$. [i]Dan Schwarz[/i]

Exhibit a $13$-digit integer $N$ that is an integer multiple of $2^{13}$ and whose digits consist of only $8$s and $9$s.

Line \(\ell\) touches circle $S_1$ in the point $X$ and circle $S_2$ in the point $Y$. We draw a line $m$ which is parallel to $\ell$ and intersects $S_1$ in a point $P$ and $S_2$ in a point $Q$. Prove that the ratio $XP/YQ$ does not depend on the choice of $m$.

Let $n,s,t$ be three positive integers, and let $A_1,\ldots, A_s, B_1,\ldots, B_t$ be non-necessarily distinct subsets of $\{1,2,\ldots,n\}$. For any subset $S$ of $\{1,\ldots,n\}$, define $f(S)$ to be the number of $i\in\{1,\ldots,s\}$ with $S\subseteq A_i$ and $g(S)$ to be the number of $j\in\{1,\ldots,t\}$ with $S\subseteq B_j$. Assume that for any $1\leq x<y\leq n$, we have $f(\{x,y\})=g(\{x,y\})$. Show that if $t<n$, then there exists some $1\leq x\leq n$ so that $f(\{x\})\geq g(\{x\})$. [i]Proposed by usjl[/i]

Determine the number of ordered quintuples $(a,b,c,d,e)$ of integers with $0\leq a<$ $b<$ $c<$ $d<$ $e\leq 30$ for which there exist polynomials $Q(x)$ and $R(x)$ with integer coefficients such that \[x^a+x^b+x^c+x^d+x^e=Q(x)(x^5+x^4+x^2+x+1)+2R(x).\] [i]Proposed by Michael Ren[/i]

There are $n \ge 2$ coins, each with a different positive integer value. Call an integer $m$ [i]sticky [/i] if some subset of these $n$ coins have total value $m$. We call the entire set of coins a stick if all the sticky numbers form a consecutive range of integers. Compute the minimum total value of a stick across all sticks containing a coin of value $100$.

A sequence $x_1, x_2, ..., x_n, ...$ consists of an initial block of $p$ positive distinct integers that then repeat periodically. This means that $\{x_1, x_2, \dots, x_p\}$ are $p$ distinct positive integers and $x_{n+p}=x_n$ for every positive integer $n$. The terms of the sequence are not known and the goal is to find the period $p$. To do this, at each move it possible to reveal the value of a term of the sequence at your choice. (a) Knowing that $1 \le p \le 10$, find the least $n$ such that there is a strategy which allows to find $p$ revealing at most $n$ terms of the sequence. (b) Knowing that $p$ is one of the first $k$ prime numbers, find for which values of $k$ there exist a strategy that allows to find $p$ revealing at most $5$ terms of the sequence.