On a plane, $n$ straight lines are drawn. Two domains are called [i]adjacent [/i] if they border by a line segment. Prove that the domains into which the plane is divided by these lines can be painted two colors so that no two [i]adjacent [/i] domains are of the same color.

Let $a, b, r,$ and $s$ be positive integers ($a \ge 2$), where $a$ and $b$ have no common prime factor. Prove that if $a^r + b^r$ is divisible by $a^s + b^s$, then $r$ is divisible by $s$.

In a class, there are $n{}$ children of different heights. Denote by $A{}$ the number of ways to arrange them all in a row, numbered $1,2,\ldots,n$ from left to right, so that each person with an odd number is shorter than each of his neighbors. Let $B{}$ be the number of ways to organize $n-1$ badminton games between these children so that everyone plays at most two games with children shorter than himself and at most one game with children taller than himself (the order of the games is not important). Prove that $A = B$.

A sequence of integers $a_{1}, a_{2}, \cdots$ is called $good$ if: • $a_{1}=1$, and; • $a_{i+1}-a_{i}$ is either $1$ or $2$ for all $i \geq 1$. Find all positive integers n that cannot be written as a sum $n = a_{1} + a_{2} + \cdots + a_{k}$, such that the integers $a_{1} , a_{2} , \cdots , a_{k}$ forms a good sequence.

The train consists of six cars. On average, each carriage carries $18$ passengers. After one car was uncoupled, the average number of passengers in the remaining cars was reduced to $15$. How many passengers were in the uncoupled car?

Let $ a$ be a fix natural number . Prove that the set of prime divisors of $ 2^{2^{n}} \plus{} a$ for $ n \equal{} 1,2,\cdots$ is infinite

The following isosceles trapezoid consists of equal equilateral triangles with side length $1$. The side $A_1E$ has length $3$ while the larger base $A_1A_n$ has length $n-1$. Starting from the point $A_1$ we move along the segments which are oriented to the right and up(obliquely right or left). Calculate (in terms of $n$ or not) the number of all possible paths we can follow, in order to arrive at points $B,\Gamma,\Delta, E$, if $n$ is an integer greater than $3$. [color=#00CCA7][Need image][/color]

Let $A=\{P_1,P_2,…,P_{2011}\}$ be a set of points that lie in a circle $K(P_1,1)$. With $x_k$ we denote the distance between $P_k$ and the closest to it point from $A$. Prove that: $\sum_{i=1}^{2011} x_i^2 \leq \frac{9}{4}$.

$64$ people are in a single elimination rock-paper-scissors tournament, which consists of a $6$-round knockout bracket. Each person has a different rock-paper-scissors skill level, and in any game, the person with the higher skill level will always win. For how many players $P$ is it possible that $P$ wins the first four rounds that he plays? (A $6$-round knockout bracket is a tournament which works as follows: (a) In the first round, all 64 competitors are paired into $32$ groups, and the two people in each group play each other. The winners advance to the second round, and the losers are eliminated. (b) In the second round, the remaining $32$ players are paired into $16$ groups. Again, the winner of each group proceeds to the next round, while the loser is eliminated. (c) Each round proceeds in a similar way, eliminating half of the remaining players. After the sixth round, only one player will not have been eliminated. That player is declared the champion.) [i]In the game of rock-paper-scissors, two players each choose one of rock, paper, or scissors to play. Rock beats scissors, scissors beats paper, and paper beats rock. If the players play the same thing, the match is considered a draw.[/i]

Seven squares are arranged to form a rectangle as shown below. The side length of the smallest square is $3$ cm. What is the perimeter in centimeters of the rectangle formed by the $7$ squares? [asy] draw((0,0)--(57,0)--(57,63)--(0,63)--cycle); draw((12,27)--(12,39)); draw((24,27)--(24,63)); draw((27,0)--(27,30)); draw((0,27)--(27,27)); draw((24,30)--(57,30)); draw((0,39)--(24,39)); [/asy]

Let $f(x)=x^2+4x+2$. Let $r$ be the difference between the largest and smallest real solutions of the equation $f(f(f(f(x))))=0$. Then $r=a^{\frac{p}{q}}$ for some positive integers $a$, $p$, $q$ so $a$ is square-free and $p,q$ are relatively prime positive integers. Compute $a+p+q$.

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

Suppose that $ a, b, c, d$ are real numbers satisfying $ a \geq b \geq c \geq d \geq 0$, $ a^2 \plus{} d^2 \equal{} 1$, $ b^2 \plus{} c^2 \equal{} 1$, and $ ac \plus{} bd \equal{} 1/3$. Find the value of $ ab \minus{} cd$.

Let $BM$ be a median of right-angled nonisosceles triangle $ABC$ ($\angle B = 90$), and $H_a$, $H_c$ be the orthocenters of triangles $ABM$, $CBM$ respectively. Lines $AH_c$ and $CH_a$ meet at point $K$. Prove that $\angle MBK = 90$.

Let $M$ the midpoint of $AC$ of an acutangle triangle $ABC$ with $AB>BC$. Let $\Omega$ the circumcircle of $ABC$. Let $P$ the intersection of the tangents to $\Omega$ in point $A$ and $C$ and $S$ the intersection of $BP$ and $AC$. Let $AD$ the altitude of triangle $ABP$ with $D$ in $BP$ and $\omega$ the circumcircle of triangle $CSD$. Let $K$ and $C$ the intersections of $\omega$ and $\Omega (K\neq C)$. Prove that $\angle CKM=90^\circ$.

There are $30$ men with their $30$ wives sitting at a round table. Show that there always exist two men who are on the same distance from their wives. (The seats are arranged at vertices of a regular polygon.)

Let $ P(x)$ be a polynomial such that when $ P(x)$ is divided by $ x \minus{} 19$, the remainder is $ 99$, and when $ P(x)$ is divided by $ x \minus{} 99$, the remainder is $ 19$. What is the remainder when $ P(x)$ is divided by $ (x \minus{} 19)(x \minus{} 99)$? $ \textbf{(A)}\ \minus{}x \plus{} 80 \qquad \textbf{(B)}\ x \plus{} 80 \qquad \textbf{(C)}\ \minus{}x \plus{} 118 \qquad \textbf{(D)}\ x \plus{} 118 \qquad \textbf{(E)}\ 0$

Find a relation between the angles of a triangle such that this could be separated in two isosceles triangles by a line. [i]Dan Brânzei[/i]

The coordinate of an object is given as a function of time by $x = 8t - 3t^2$, where $x$ is in meters and $t$ is in seconds. Its average velocity over the interval from $ t = 1$ to $t = 2 \text{ s}$ is $ \textbf{(A)}\ -2\text{ m/s}\qquad\textbf{(B)}\ -1\text{ m/s}\qquad\textbf{(C)}\ -0.5\text{ m/s}\qquad\textbf{(D)}\ 0.5\text{ m/s}\qquad\textbf{(E)}\ 1\text{ m/s} $

A $\triangle$ or $\bigcirc$ is placed in each of the nine squares in a 3-by-3 grid. Shown below is a sample configuration with three $\triangle$s in a line. [asy] //diagram by kante314 size(3.3cm); defaultpen(linewidth(1)); real r = 0.37; path equi = r * dir(-30) -- (r+0.03) * dir(90) -- r * dir(210) -- cycle; draw((0,0)--(0,3)--(3,3)--(3,0)--cycle); draw((0,1)--(3,1)--(3,2)--(0,2)--cycle); draw((1,0)--(1,3)--(2,3)--(2,0)--cycle); draw(circle((3/2,5/2),1/3)); draw(circle((5/2,1/2),1/3)); draw(circle((3/2,3/2),1/3)); draw(shift(0.5,0.38) * equi); draw(shift(1.5,0.38) * equi); draw(shift(0.5,1.38) * equi); draw(shift(2.5,1.38) * equi); draw(shift(0.5,2.38) * equi); draw(shift(2.5,2.38) * equi); [/asy] How many configurations will have three $\triangle$s in a line and three $\bigcirc$s in a line? $\textbf{(A) } 39 \qquad \textbf{(B) } 42 \qquad \textbf{(C) } 78 \qquad \textbf{(D) } 84 \qquad \textbf{(E) } 96$

[b]p1.[/b] Find the value of the parameter $a$ for which the following system of equations does not have solutions: $$ax + 2y = 1$$ $$2x + ay = 1$$ [b]p2.[/b] Find all solutions of the equation $\cos(2x) - 3 \sin(x) + 1 = 0$. [b]p3.[/b] A circle of a radius $r$ is inscribed into a triangle. Tangent lines to this circle parallel to the sides of the triangle cut out three smaller triangles. The radiuses of the circles inscribed in these smaller triangles are equal to $1,2$ and $3$. Find $r$. [b]p4.[/b] Does there exist an integer $k$ such that $\log_{10}(1 + 49367 \cdot k)$ is also an integer? [b]p5.[/b] A plane is divided by $3015$ straight lines such that neither two of them are parallel and neither three of them intersect at one point. Prove that among the pieces of the plane obtained as a result of such division there are at least $2010$ triangular pieces. PS. You should use hide for answers.

This morning, Emi dropped the watch and from there it started to move more slowly. When, according to the clock, $2$ minutes have passed, in reality it has already been $3$. Now it is $6:25$ pm and the clock says it is $3:30$ pm. What time did Emi drop the watch?

Given a circle $(O)$ with center $O$ and $P$ a point outside $(O)$. $A$ and $B$ are points on $(O)$ such that $PA$ and $PB$ are tangents to $(O)$. The line $\ell$ through $P$ intersects $(O)$ at points $C$ and $D$, respectively ($C$ lies between $P$ and $D$). Line $BF$ is parallel to line $PA$ and intersects line $AC$ and line $AD$ at $E$ and $F$, respectively. Prove that $BE = BF$.

Suppose \(40\) objects are placed along a circle at equal distances. In how many ways can \(3\) objects be chosen from among them so that no two of the three chosen objects are adjacent nor diametrically opposite?

Prove that for each natural number $m$, there is a natural number $N$ such that for each $b$ that $2\leq b\leq1389$ sum of digits of $N$ in base $b$ is larger than $m$.