For non-empty number sets $S, T$, define the sets $S+T=\{s+t\mid s\in S, t\in T\}$ and $2S=\{2s\mid s\in S\}$. Let $n$ be a positive integer, and $A, B$ be two non-empty subsets of $\{1,2\ldots,n\}$. Show that there exists a subset $D$ of $A+B$ such that 1) $D+D\subseteq 2(A+B)$, 2) $|D|\geq\frac{|A|\cdot|B|}{2n}$, where $|X|$ is the number of elements of the finite set $X$.

The student wrote on the board three natural numbers that are consecutive members of one arithmetic progression. Then he erased the commas separating the numbers, resulting in a seven-digit number. What is the largest number that could result?

A point $F$ inside a triangle $ABC$ is chosen so that $\angle AFB = \angle BFC = \angle CFA$. The line passing through $F$ and perpendicular to $BC$ meets the median from $A$ at point $A_1$. Points $B_1$ and $C_1$ are defined similarly. Prove that the points $A_1, B_1$, and $C_1$ are three vertices of some regular hexagon, and that the three remaining vertices of that hexagon lie on the sidelines of $ABC$.

In a triangle $ABC$ with $AB<AC<BC$, the perpendicular bisectors of $AC$ and $BC$ intersect $BC$ and $AC$ at $K$ and $L$, respectively. Let $O$, $O_1$, and $O_2$ be the circumcentres of triangles $ABC$, $CKL$, and $OAB$, respectively. Prove that $OCO_1O_2$ is a parallelogram.

Find all real polynomials $ g(x)$ of degree at most $ n \minus{} 3$, $ n\geq 3$, knowing that all the roots of the polynomial $ f(x) \equal{} x^n \plus{} nx^{n \minus{} 1} \plus{} \frac {n(n \minus{} 1)}2 x^{n \minus{} 2} \plus{} g(x)$ are real.

Circles $\omega_{1}$ and $\omega_{2}$ intersect at points $A$ and $B$. Let $t_{1}$ and $t_{2}$ be the tangents to $\omega_{1}$ and $\omega_{2}$, respectively, at point $A$. Let the second intersection of $\omega_{1}$ and $t_{2}$ be $C$, and let the second intersection of $\omega_{2}$ and $t_{1}$ be $D$. Points $P$ and $E$ lie on the ray $AB$, such that $B$ lies between $A$ and $P$, $P$ lies between $A$ and $E$, and $AE = 2 \cdot AP$. The circumcircle to $\bigtriangleup BCE$ intersects $t_{2}$ again at point $Q$, whereas the circumcircle to $\bigtriangleup BDE$ intersects $t_{1}$ again at point $R$. Prove that points $P$, $Q$, and $R$ are collinear.

On a non-rhombus parallelogram $ ABCD, $ the vertex $ B $ is projected on $ AC $ in the point $ E. $ The perpendicular on $ BD $ thru $ E $ intersects the lines $ BC $ and $ AB $ in $ F $ and $ G, $ respectively. Show that $ EF=EG $ if and only if $ \angle ABC=90^{\circ } . $ [i]Mircea Becheanu[/i]

a) The product of $n$ integers equals $n$, and their sum is zero. Prove that $n$ is divisible by $4$. b) Let $n$ is divisible by $4$. Prove that there exist $n$ integers such, that their product equals $n$, and their sum is zero.

Each square in a $5 \times 5$ grid is either filled or empty, and has up to eight adjacent neighboring squares, where neighboring squares share either a side or a corner. The grid is transformed by the following rules: [list] [*] Any filled square with two or three filled neighbors remains filled. [*] Any empty square with exactly three filled neighbors becomes a filled square. [*] All other squares remain empty or become empty. [/list] A sample transformation is shown in the figure below. [asy] import geometry; unitsize(0.6cm); void ds(pair x) { filldraw(x -- (1,0) + x -- (1,1) + x -- (0,1)+x -- cycle,gray+opacity(0.5),invisible); } ds((1,1)); ds((2,1)); ds((3,1)); ds((1,3)); for (int i = 0; i <= 5; ++i) { draw((0,i)--(5,i)); draw((i,0)--(i,5)); } label("Initial", (2.5,-1)); draw((6,2.5)--(8,2.5),Arrow); ds((10,2)); ds((11,1)); ds((11,0)); for (int i = 0; i <= 5; ++i) { draw((9,i)--(14,i)); draw((i+9,0)--(i+9,5)); } label("Transformed", (11.5,-1)); [/asy] Suppose the $5 \times 5$ grid has a border of empty squares surrounding a $3 \times 3$ subgrid. How many initial configurations will lead to a transformed grid consisting of a single filled square in the center after a single transformation? (Rotations and reflections of the same configuration are considered different.) [asy] import geometry; unitsize(0.6cm); void ds(pair x) { filldraw(x -- (1,0) + x -- (1,1) + x -- (0,1)+x -- cycle,gray+opacity(0.5),invisible); } for (int i = 1; i < 4; ++ i) { for (int j = 1; j < 4; ++j) { label("?",(i + 0.5, j + 0.5)); } } for (int i = 0; i <= 5; ++i) { draw((0,i)--(5,i)); draw((i,0)--(i,5)); } label("Initial", (2.5,-1)); draw((6,2.5)--(8,2.5),Arrow); ds((11,2)); for (int i = 0; i <= 5; ++i) { draw((9,i)--(14,i)); draw((i+9,0)--(i+9,5)); } label("Transformed", (11.5,-1)); [/asy] $$\textbf{(A) 14}~\textbf{(B) 18}~\textbf{(C) 22}~\textbf{(D) 26}~\textbf{(E) 30}$$

(a)Two circles $S_1$ and $S_2$ are placed so that they do not overlap each other, neither completely nor partially. They have centres in $O_1$ and $O_2$, respectively. Further, $L_1$ and $M_1$ are different points on $S_1$ so that $O_2L_1$ and $O_2M_1$ are tangent to $S_1$, and similarly $L_2$ and $M_2$ are different points on $S_2$ so that $O_1L_2$ and $O_1M_2$ are tangent to $S_2$. Show that there exists a unique circle which is tangent to the four line segments $O_2L_1, O_2M_1, O_1L_2$, and $O_1M_2$. (b) Four circles $S_1, S_2, S_3$ and $S_4$ are placed so that none of them overlap each other, neither completely nor partially. They have centres in $O_1, O_2, O_3$, and $O_4$, respectively. For each pair $(S_i, S_j )$ of circles, with $1 \le i < j \le 4$, we find a circle $S_{ij}$ as in part [b]a[/b]. The circle $S_{ij}$ has radius $R_{ij}$ . Show that $\frac{1}{R_{12}} + \frac{1}{R_{23}}+\frac{1}{R_{34}}+\frac{1}{R_{14}}= 2 \left(\frac{1}{R_{13}} +\frac{1}{R_{24}}\right)$

Let $\mathcal{F}$ be the set of functions $f: [0,1]\to\mathbb{R}$ that are differentiable, with continuous derivative, and $f(0)=0$, $f(1)=1$. Find the minimum of $\int_{0}^{1}\sqrt{1+x^{2}}\cdot \big(f'(x)\big)^{2}\ dx$ (where $f\in\mathcal{F}$) and find all functions $f\in\mathcal{F}$ for which this minimum is attained. [hide="Comment"] In the contest, this was the b) point of the problem. The a) point was simply ``Prove the Cauchy inequality in integral form''. [/hide]

Given positive real $a,b,c$ satisfying \[\frac{1}{\sqrt{a+1}}+\frac{3}{\sqrt{b+3}}+\frac{3}{\sqrt{c+3}}=\frac72\] Prove that $abc\leq 3$.\\ I was asked to propose a inequality for the condition of $abc<3$ inequality since <3 looks like a heart shape, then I construct a equality and with the help of wolfram, I gave the birth of this bad-looking inequality, I’m glad to see any method besides calculus.

Let $f(x)$ be a polynomial with integer coefficients. Define a sequence $a_0, a_1, \cdots $ of integers such that $a_0=0$ and $a_{n+1}=f(a_n)$ for all $n \ge 0$. Prove that if there exists a positive integer $m$ for which $a_m=0$ then either $a_1=0$ or $a_2=0$.

Find all natural numbers whose decimal notation consists of different digits of the same parity and which are perfect squares.

Let $S = \{1, \cdots, 6\}$ and $\mathcal{P}$ be the set of all nonempty subsets of $S$. Let $N$ equal the number of functions $f:\mathcal P \to S$ such that if $A,B\in \mathcal P$ are disjoint, then $f(A)\neq f(B)$. Determine the number of positive integer divisors of $N$.

Suppose that $10$ mathematics teachers gather at a circular table with $25$ seats to discuss the upcoming mathematics competition. Each teacher is assigned a unique integer ID number between $1$ and $10$, and the teachers arrange themselves in such a way that teachers with consecutive ID numbers are not separated by any other teacher (IDs $1$ and $10$ are considered consecutive). In addition, each pair of teachers is separated by at least one empty seat. Given that seating arrangements obtained by rotation are considered identical, how many ways are there for the teachers to sit at the table?

Let $ x$ and $ y$ be positive real numbers with $ x^3 \plus{} y^3 \equal{} x \minus{} y.$ Prove that \[ x^2 \plus{} 4y^2 < 1.\]

Compute $\Sigma_{n=1}^{\infty}\frac{n + 1}{n^2(n + 2)^2}$ . Your answer in simplest form can be written as $a/b$, where $a, b$ are relatively-prime positive integers. Find $a + b$.

Five different awards are to be given to three students. Each student will receive at least one award. In how many ways can the awards be distributed? $\textbf{(A)}\ 120 \qquad \textbf{(B)}\ 150 \qquad \textbf{(C)}\ 180 \qquad \textbf{(D)}\ 210 \qquad \textbf{(E)}\ 240$

Find all values of the parameter $a$ for which the sum of all solutions (meaning real solutions) of the equation $x^4 - 5x + a = 0$ is equal to $a$

Let $ O$ be the circumcircle of a $ \Delta ABC$ and let $ I$ be its incenter, for a point $ P$ of the plane let $ f(P)$ be the point obtained by reflecting $ P'$ by the midpoint of $ OI$, with $ P'$ the homothety of $ P$ with center $ O$ and ratio $ \frac{R}{r}$ with $ r$ the inradii and $ R$ the circumradii,(understand it by $ \frac{OP}{OP'}\equal{}\frac{R}{r}$). Let $ A_1$, $ B_1$ and $ C_1$ the midpoints of $ BC$, $ AC$ and $ AB$, respectively. Show that the rays $ A_1f(A)$, $ B_1f(B)$ and $ C_1f(C)$ concur on the incircle.

Find the value of $$\sum_{1\le a<b<c} \frac{1}{2^a3^b5^c}$$ (i.e. the sum of $\frac{1}{2^a3^b5^c}$ over all triples of positive integers $(a, b, c)$ satisfying $a<b<c$)

In a school there are $ 2008$ students. Students are members of certain committees. A committee has at most $ 1004$ members and every two students join a common committee. (i) Determine the smallest possible number of committees in the school. (ii) If it is further required that the union of any two committees consists of at most $ 1800$ students, will your answer in (i) still hold?

A game is played on a $n \times n$ chessboard. In the beginning Bars the cat occupies any cell according to his choice. The $d$ sparrows land on certain cells according to their choice (several sparrows may land in the same cell). Bars and the sparrows play in turns. In each turn of Bars, he moves to a cell adjacent by a side or a vertex (like a king in chess). In each turn of the sparrows, precisely one of the sparrows flies from its current cell to any other cell of his choice. The goal of Bars is to get to a cell containing a sparrow. Can Bars achieve his goal a) if $d=\lfloor \frac{3\cdot n^2}{25}\rfloor$, assuming $n$ is large enough? b) if $d=\lfloor \frac{3\cdot n^2}{19}\rfloor$, assuming $n$ is large enough? c) if $d=\lfloor \frac{3\cdot n^2}{14}\rfloor$, assuming $n$ is large enough?

Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and \[\gcd(P(0), P(1), P(2), \ldots ) = 1.\] Show there are infinitely many $n$ such that \[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]