Given natural number $a>1$ and different odd prime numbers $p_1,p_2,...,p_n$ with $a^{p_1}\equiv 1$ (mod $p_2$), $a^{p_2}\equiv 1$ (mod $p_3$), ..., $a^{p_n}\equiv 1$(mod $p_1$). Prove that a) $(a-1)\vdots p_i$ for some $i=1,..,n$ b) Can $(a-1)$ be divisible by $p_i $for exactly one $i$ of $i=1,...,n$? I. Bliznets

Let $ ABC$ be an isosceles triangle with $ AB \equal{} AC$. $ M$ is the midpoint of $ BC$ and $ O$ is the point on the line $ AM$ such that $ OB$ is perpendicular to $ AB$. $ Q$ is an arbitrary point on $ BC$ different from $ B$ and $ C$. $ E$ lies on the line $ AB$ and $ F$ lies on the line $ AC$ such that $ E, Q, F$ are distinct and collinear. Prove that $ OQ$ is perpendicular to $ EF$ if and only if $ QE \equal{} QF$.

Assume that the earth is a perfect sphere. A plane flies between $30^o N$ $45^o W$ and $30^o N$ $45^o E$ along the shortest possible route. Let $\theta$ be the northernmost latitude that the plane flies over. Compute $\sin \theta$.

Determine the smallest value of $(a+5)^2+(b-2)^2+(c-9)^2$ for all real numbers $a, b, c$ satisfying $a^2+b^2+c^2-ab-bc-ca=3$.

Calculate the following indefinite integrals. [1] $\int \frac{(x^2-1)^2}{x^4}dx$ [2] $\int \frac{e^{3x}}{\sqrt{e^x+1}}dx$ [3] $\int \sin 2x\cos 3xdx$ [4] $\int x\ln (x+1)dx$ [5] $\int \frac{x}{(x+3)^2}dx$

A set $M$ of elements $u, v, w$ is called a semigroup if an operation is defined in it is which uniquely assigns an element $w$ from $M$ to every ordered pair $(u, v)$ of elements from $M$ (you write $u \otimes v = w$) and if this algebraic operation is associative, i.e. if for all elements $u, v,w$ from $M$: $$(u \otimes v) \otimes w = u \otimes (v \otimes w).$$ Now let $c$ be a positive real number and let $M$ be the set of all non-negative real numbers that are smaller than $c$. For each two numbers $u, v$ from $M$ we define: $$u \otimes v = \dfrac{u + v}{1 + \dfrac{uv}{c^2}}$$ Investigate a) whether $M$ is a semigroup; b) whether this semigroup is regular, i.e. whether from $u \otimes v_1 = u\otimes v_2$ always $v_1 = v_2$ and from $v_1 \otimes u = v_2 \otimes u$ also $v_1 = v_2$ follows.

Let $ABCD$ be an isosceles trapezoid, whose dimensions are $AB = 6$, $BC=5=DA$, and $CD=4$. Draw circles of radius 3 centered at $A$ and $B$, and circles of radius 2 centered at $C$ and $D$. A circle contained within the trapezoid is tangent to all four of these circles. Its radius is $\frac{-k+m\sqrt{n}}p$, where $k$, $m$, $n$, and $p$ are positive integers, $n$ is not divisible by the square of any prime, and $k$ and $p$ are relatively prime. Find $k+m+n+p$.

The points of a circle are colored in green and yellow, such that every equilateral triangle inscribed in the circle has exactly 2 vertices colored in yellow. Prove that there exist a square inscribed in the circle which has at least 3 vertices colored in yellow.

A plane passing through the center of a cube intersects the cube in a cyclic hexagon. Show that this hexagon is regular.

The incircles of the faces $ABC$ and $ABD$ of a tetrahedron $ABCD$ are tangent to the edge $AB$ in the same point. Prove that the points of tangency of these incircles to the edges $AC,BC,AD,BD$ are concyclic.

Four boys bought a boat for $\textdollar 60$. The first boy paid one half of the sum of the amounts paid by the other boys; the second boy paid one third of the sum of the amounts paid by the other boys; and the third boy paid one fourth of the sum of the amounts paid by the other boys. How much did the fourth boy pay? $\textbf{(A) }\textdollar 10\qquad\textbf{(B) }\textdollar 12\qquad\textbf{(C) }\textdollar 13\qquad\textbf{(D) }\textdollar 14\qquad \textbf{(E) }\textdollar 15$

Let $ABC$ be an non-isosceles triangle with incenter $I$, circumcenter $O$ and a point $D$ on segment $BC $such that $(BID) $cut segments $AB $ at$ E $and $(CID) $cuts segment $AC $at $F$ Circle $(DEF)$ cuts segments $AB$,$AC $again at $M,N$. Let $P$ The intersection of $IB$ and $DE $ , $Q$ The intersection of $IC$and $DF$ . Prove that $EN,FM,PQ $are parallel and the median of vertex $I$in triangle $IPQ$ bisects the arc $BAC$ of $(O)$.

On day $1$ of the new year, John Adams and Samuel Adams each drink one gallon of tea. For each positive integer $n$, on the $n$th day of the year, John drinks $n$ gallons of tea and Samuel drinks $n^2$ gallons of tea. After how many days does the combined tea intake of John and Samuel that year first exceed $900$ gallons? [i]Proposed by Aidan Duncan[/i] [hide=Solution] [i]Solution. [/i] $\boxed{13}$ The total amount that John and Samuel have drank by day $n$ is $$\dfrac{n(n+1)(2n+1)}{6}+\dfrac{n(n+1)}{2}=\dfrac{n(n+1)(n+2)}{3}.$$ Now, note that ourdesired number of days should be a bit below $\sqrt[3]{2700}$. Testing a few values gives $\boxed{13}$ as our answer. [/hide]

Let $n$ be a positive integer. Each of the numbers $1,2,3,\ldots,100$ is painted with one of $n$ colors in such a way that two distinct numbers with a sum divisible by $4$ are painted with different colors. Determine the smallest value of $n$ for which such a situation is possible.

Find all polynomials $P(x,y)$ with real coefficients such that for all real numbers $x,y$ and $z$: $$P(x,2yz)+P(y,2zx)+P(z,2xy)=P(x+y+z,xy+yz+zx).$$ [i]Proposed by Sina Saleh[/i]

For real numbers $x$ and $y$, let $M$ be the maximum value of the expression $x^4y + x^3y + x^2y + xy + xy^2 + xy^3 + xy^4$, subject to $x + y = 3$. Find $[M]$.

The vertices of the regular $n$-gon are marked. Two players play the following game: they, in turn, select a vertex and connect it by a segment to either the adjacent vertex or the center of the $n$-gon. The winner is a player if after his move it is possible to get any vertex from any other vertex moving along segments. For each integer $n\geqslant 3$ determine who has a winning strategy.

There are $2024$ points of general position marked on the coordinate plane (i.e., points among which there are no three lying on the same straight line). Is there a polynomial of two variables $f(x,y)$ a) of degree $2025$; b) of degree $2024$ such that it equals to zero exactly at these marked points? [i]Proposed by Navid Safaei[/i]

Equiangular octagon $ABCDEFGH$ is inscribed in a circle centered at $O$. Chords $AD$ and $BG$ intersect at $K$. Given that $AB = 2$ and the octagon has area $15$, compute the area of $HAKBO$.

Three mutually externally tangent circles are internally tangent to a circle with radius $1$. If two of the inner circles have radius $\frac{1}{3}$, the largest possible radius of the third inner circle can be expressed in the form $\frac{a+b\sqrt{c}}{d}$ where $c$ is squarefree and $\gcd(a,b,d)=1$. Find $a+b+c+d$.

Given triangle $ABC$ variable points $X$ and $Y$ are chosen on segments $AB$ and $AC$, respectively. Point $Z$ on line $BC$ is chosen such that $ZX=ZY$. The circumcircle of $XYZ$ cuts the line $BC$ for the second time at $T$. Point $P$ is given on line $XY$ such that $\angle PTZ = 90^ \circ$. Point $Q$ is on the same side of line $XY$ with $A$ furthermore $\angle QXY = \angle ACP$ and $\angle QYX = \angle ABP$. Prove that the circumcircle of triangle $QXY$ passes through a fixed point (as $X$ and $Y$ vary).

Find the largest integer $k$ such that $$k\leq\sqrt{2}+\sqrt[3]{\frac{3}{2}}+\sqrt[4]{\frac{4}{3}}+\sqrt[5]{\frac{5}{4}}+\cdots+\sqrt[2015]{\frac{2015}{2014}}.$$

For every pair of positive integers $(x, y)$ we define $f(x,y)$ as follows: $f(x,1) = x$ $f(x,y) = 0$ if $y > x$ $f(x +1,y) = y[f(x,y)+ f(x, y-1)]$ Evaluate $f(5, 5)$.

For an integer $n \ge 2$, let $G_n$ be an $n \times n$ grid of unit cells. A subset of cells $H \subseteq G_n$ is considered \textit{quasi-complete} if and only if each row of $G_n$ has at least one cell in $H$ and each column of $G_n$ has at least one cell in $H$. A subset of cells $K \subseteq G_n$ is considered \textit{quasi-perfect} if and only if there is a proper subset $L \subset K$ such that $|L| = n$ and no two elements in $L$ are in the same row or column. Let $\vartheta(n)$ be the smallest positive integer such that every quasi-complete subset $H \subseteq G_n$ with $|H| \ge \vartheta(n)$ is also quasi-perfect. Moreover, let $\varrho(n)$ be the number of quasi-complete subsets $H \subseteq G_n$ with $|H| = \vartheta(n) - 1$ such that $H$ is not quasi-perfect. Compute $\vartheta(20) + \varrho(20)$.

In some squares of a $2012\times 2012$ grid there are some beetles, such that no square contain more than one beetle. At one moment, all the beetles fly off the grid and then land on the grid again, also satisfying the condition that there is at most one beetle standing in each square. The vector from the centre of the square from which a beetle $B$ flies to the centre of the square on which it lands is called the [i]translation vector[/i] of beetle $B$. For all possible starting and ending configurations, find the maximum length of the sum of the [i]translation vectors[/i] of all beetles.