Sets $A,B$ satisfy that $A\cup B=\{a_1,a_2,a_3\}$. If $A\neq B$, then $(A,B)$ is different from $(B,A)$. The number of such sets $(A,B)$ is $\text{(A)}8\qquad\text{(B)}9\qquad\text{(C)}26\qquad\text{(D)}27$

Find the value of $ x$ that satisfies the equation \[ 25^{\minus{}2}\equal{}\frac{5^{48/x}}{5^{26/x}\cdot25^{17/x}}. \]$ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 9$

Prove that the set of all divisors of a positive integer which is not a perfect square can be divided into pairs so that in each pair one number is divisible by another.

Let $a$ be a positive real number. Evaluate $I=\int_0^{+\infty} \frac{\sin x\cos x}{x(x^2+a^2)}dx.$

Does a convex heptagon exist which can be divided into 2011 equal triangles?

Let be some points on a plane, no three collinear. We associate a positive or a negative value to every segment formed by these. Prove that the number of points, the number of segments with negative associated value, and the number of triangles that has a negative product of the values of its sides, share the same parity.

In triangle $ABC$, $\omega$ is its circumcircle and $O$ is the center of this circle. Points $M$ and $N$ lie on sides $AB$ and $AC$ respectively. $\omega$ and the circumcircle of triangle $AMN$ intersect each other for the second time in $Q$. Let $P$ be the intersection point of $MN$ and $BC$. Prove that $PQ$ is tangent to $\omega$ iff $OM=ON$. [i]proposed by Mr.Etesami[/i]

Let $n$ be an integer $> 1$. In a circular arrangement of $n$ lamps $L_0, \cdots, L_{n-1}$, each one of which can be either ON or OFF, we start with the situation that all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \cdots$. If $L_{j-1}$ ($j$ is taken mod n) is ON, then $Step_j$ changes the status of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the status of any of the other lamps. If $L_{j-1}$ is OFF, then $Step_j$ does not change anything at all. Show that: [i](a)[/i] There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again. [i](b)[/i] If $n$ has the form $2^k$, then all lamps are ON after $n^2 - 1$ steps. [i](c) [/i]If $n$ has the form $2^k +1$, then all lamps are ON after $n^2 -n+1$ steps.

Let $I$ be the incenter of triangle $ABC$, and let $A_1$, $B_1$, and $C_1$ be arbitrary points lying on segments $AI$,$BI$, and $CI$, respectively. The perpendicular bisectors of segments $AA_1$, $BB_1$, and $CC_1$ form triangles $A_2B_2C_2$. Prove that the circumcenter of triangle $A_2B_2C_2$ coincides with the circumcenter of triangle $ABC$ if and only if $I$ is the orthocenter of triangle $A_1B_1C_1$.

$ c$ is a positive integer. Consider the following recursive sequence: $ a_1\equal{}c, a_{n\plus{}1}\equal{}ca_{n}\plus{}\sqrt{(c^2\minus{}1)(a_n^2\minus{}1)}$, for all $ n \in N$. Prove that all the terms of the sequence are positive integers.

In an acute-angled triangle $ ABC$, $ D$ is the foot of the altitude from $ A$, and $ P$ a point on segment $ AD$. The lines $ BP$ and $ CP$ meet $ AC$ and $ AB$ at $ E$ and $ F$ respectively. Prove that $ AD$ bisects the angle $ EDF$.

The one hundred U.S. Senators are standing in a line in alphabetical order. Each senator either always tells the truth or always lies. The $i$th person in line says: "Of the $101-i$ people who are not ahead of me in line (including myself), more than half of them are truth-tellers.'' How many possibilities are there for the set of truth-tellers on the U.S. Senate? [i]Proposed by James Lin[/i]

Let $p$ be a prime number, and $X$ be the set of cubes modulo $p$, including $0$. Denote by $C_2(k)$ the number of ordered pairs $(x, y) \in X \times X$ such that $x + y \equiv k \pmod p$. Likewise, denote by $C_3(k)$ the number of ordered pairs $(x, y, z) \in X \times X \times X$ such that $x + y + z \equiv k \pmod p$. Prove that there are integers $a, b$ such that for all $k$ not in $X$, we have \[ C_3(k) = a\cdot C_2(k) + b. \] [i]Proposed by Murilo Corato, Brazil.[/i]

Compute $1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}.$

Let $ ABC $ be an inscribed triangle in circle $ (O) $. Let $ D $ be the intersection of the two tangent lines of $ (O) $ at $ B $ and $ C $. The circle passing through $ A $ and tangent to $ BC $ at $ B $ intersects the median passing $ A $ of the triangle $ ABC $ at $ G $. Lines $ BG, CG $ intersect $ CD, BD $ at $ E, F $ respectively. a) The line passing through the midpoint of $ BE $ and $ CF $ cuts $ BF, CE $ at $ M, N $ respectively. Prove that the points $ A, D, M, N $ belong to the same circle. b) Let $ AD, AG $ intersect the circumcircle of the triangles $ DBC, GBC $ at $ H, K $ respectively. The perpendicular bisectors of $ HK, HE$, and $HF $ cut $ BC, CA$, and $AB $ at $ R, P$, and $Q $ respectively. Prove that the points $ R, P$, and $Q $ are collinear.

In how many different orders can the characters $P \ U \ M \ \alpha \ C$ be arranged such that the $M$ is to the left of the $\alpha$ and the $\alpha$ is to the left of the $C?$

Is there a sequence $ a_1,a_2,\ldots$ of positive reals satisfying simoultaneously the following inequalities for all positive integers $ n$: a) $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le n^2$ b) $ \frac1{a_1}\plus{}\frac1{a_2}\plus{}\ldots\plus{}\frac1{a_n}\le2008$?

Consider $K$ a polygon in plane, such that the distance between any two vertices is not greater than $1$. Let $X$ and $Y$ be two points inside $K$. Show that there exist a point $Z$, lying on the border of K, such that $XZ + Y Z \le 1$

Thirty-four countries participated in a jury session of the IMO, each represented by the leader and the deputy leader of the team. Before the meeting, some participants exchanged handshakes, but no team leader shook hands with his deputy. After the meeting, the leader of the Illyrian team asked every other participant the number of people they had shaken hands with, and all the answers she got were different. How many people did the deputy leader of the Illyrian team greet ?

Let $p$ be an odd prime. Prove that: \[\displaystyle\sum_{k\equal{}1}^{p\minus{}1}k^{2p\minus{}1} \equiv \frac{p(p\plus{}1)}{2} \pmod{p^2}\]

The diagonals $AC$ and $BD$ of the cyclic quadrilateral $ABCD$ intersect at a point O. It is known that $\angle BAD = 60^o$ and $AO = 3OC$. Prove that the sum of some two sides of a quadrilateral is equal to the sum of the other two sides.

Find all continuous functions $f : \mathbb R \to \mathbb R$ such that for all $x \in \mathbb R$ and for all $n \in \mathbb N^{\ast}$ we have \[ n^2 \int_{x}^{x + \frac{1}{n}} f(t) \, dt = n f(x) + \frac12 . \] [i]Mihai Piticari[/i]

Two players play the following game. At the outset there are two piles, containing $10,000$ and $20,000$ tokens,respectively . A move consists of removing any positive number of tokens from a single pile $or$ removing $x>0$ tokens from one pile and $y>0$ tokens from the other , where $x+y$ is divisible by $2015$. The player who can not make a move loses. Which player has a winning strategy

Let $ ABC $ be a triangle, $ M_A $ be the midpoint of the side $ BC, $ and $ P_A $ be the orthogonal projection of $ A $ on $ BC. $ Similarly, define $ M_B,M_C,P_B,P_C. M_BM_C $ intersects $ P_BP_C $ at $ S_A, $ and the tangent of the circumcircle of $ ABC $ at $ A $ meets $ BC $ at $ T_A. $ Similarly, define $ S_B,S_C,T_B,T_C. $ Show that the perpendiculars through $ A,B,C, $ to $ S_AT_A,S_BT_B, $ respectively, $ S_CT_C, $ are concurent. [i]Flavian Georgescu[/i]

Frankie the Frog starts his morning at the origin in $\mathbb{R}^2$. He decides to go on a leisurely stroll, consisting of $3^1+3^{10}+3^{11}+3^{100}+3^{111}+3^{1000}$ moves, starting with the first move. On the $n$th move, he hops a distance of $$\max\{k\in\mathbb{Z}:3^k|n\}+1,$$ then turns $90^{\circ}$ counterclockwise. What is the square of the distance from his final position to the origin?