The incircle and the excircle of triangle $ABC$ touch the side $AC$ at points $P$ and $Q$ respectively. The lines $BP$ and $BQ$ meet the circumcircle of triangle $ABC$ for the second time at points $P'$ and $Q'$ respectively. Prove that $$PP' > QQ'$$

Let $m$ be a positive integer and let the lines $13x+11y=700$ and $y=mx-1$ intersect in a point whose coordinates are integers. Then $m$ is: $\text{(A)} \ 4 \qquad \text{(B)} \ 5 \qquad \text{(C)} \ 6 \qquad \text{(D)} \ 7 \qquad \text{(E)} \ \text{one of the integers}~ 4,5,6,7~\text{and one other positive integer}$

Two circles $\omega_1$ and $\omega_2$ touch externally at point $P$.Let $A$ be a point on $\omega_2$ not lying on the line through the centres of the two circles.Let $AB$ and $AC$ be the tangents to $\omega_1$.Lines $BP$ and $CP$ meet $\omega_2$ for the second time at points $E$ and $F$.Prove that the line $EF$,the tangent to $\omega_2$ at $A$ and the common tangent at $P$ concur.

Let $x, y,z$ satisfy the following inequalities $\begin{cases} | x + 2y - 3z| \le 6 \\ | x - 2y + 3z| \le 6 \\ | x - 2y - 3z| \le 6 \\ | x + 2y + 3z| \le 6 \end{cases}$ Determine the greatest value of $M = |x| + |y| + |z|$.

Suppose that $a$ and $ b$ are positive integers such that $$c = a +\frac{b}{a} -\frac{1}{b}$$ is an integer. Prove that $c$ is a perfect square.

Let $m\ge 5$ be an odd integer, and let $D(m)$ denote the number of quadruples $\big(a_1, a_2, a_3, a_4\big)$ of distinct integers with $1\le a_i \le m$ for all $i$ such that $m$ divides $a_1+a_2+a_3+a_4$. There is a polynomial $$q(x) = c_3x^3+c_2x^2+c_1x+c_0$$such that $D(m) = q(m)$ for all odd integers $m\ge 5$. What is $c_1?$ $(\textbf{A})\: {-}6\qquad(\textbf{B}) \: {-}1\qquad(\textbf{C}) \: 4\qquad(\textbf{D}) \: 6\qquad(\textbf{E}) \: 11$

Find all integers $n>1$ such that every prime that divides $n^6-1$ also divides $n^5-n^3-n^2+1$.

A set $A$ of squares is given on a chessboard which is infinite in all directions. On each square of this chessboard which does not belong to $A$ there is a king. On a command all kings may be moved in such a way that each king either remains on its square or is moved to an adjacent square, which may have been occupied by another king before the command. Each square may be occupied by at most one king. Does there exist such a number $k$ and such a way of moving the kings that after $k$ moves the kings will occupy all squares of the chessboard? Consider the following cases: (a) $A$ is the set of all squares, both of whose coordinates are multiples of $100$. (There is a horizontal line numbered by the integers from $-\infty$ to $+\infty$, and a similar vertical line. Each square of the chessboard may be denoted by two numbers, its coordinates with respect to these axes.) (b) $A$ is the set of all squares which are covered by $100$ fixed arbitrary queens (i.e. each square covered by at least one queen). Remark: If $A$ consists of just one square, then $k = 1$ and the required way is the following: all kings to the left of the square of $A$ make one move to the right.

Given are positive integers $a, b$ satisfying $a \geq 2b$. Does there exist a polynomial $P(x)$ of degree at least $1$ with coefficients from the set $\{0, 1, 2, \ldots, b-1 \}$ such that $P(b) \mid P(a)$?

*. Positive numbers $x_1, x_2, ..., x_{100}$ satisfy the system $$\begin{cases} x^2_1+ x^2_2+ ... + x^2_{100} > 10 000 \\ x_1 + x_2 + ...+ x_{100} < 300 \end{cases}$$ Prove that among these numbers there are three whose sum is greater than $100$.

For what $n$ can the vertices of a regular $n$-gon be connected in a $n$-link closed polyline so that such a polyline does not have three equal links?

Let $AD$ be an internal angle bisector in triangle $\Delta ABC$. An arbitrary point $M$ is chosen on the closed segment $AD$. A parallel to $BC$ through $M$ cuts $AB$ at $N$. Let $AD, CM$ cut circumcircle of $\Delta ABC$ at $K, L$, respectively. Prove that $K,N,L$ are collinear.

Let $ABCD$ be a cyclic quadrilateral. Let $P$, $Q$, $R$ be the feet of the perpendiculars from $D$ to the lines $BC$, $CA$, $AB$, respectively. Show that $PQ=QR$ if and only if the bisectors of $\angle ABC$ and $\angle ADC$ are concurrent with $AC$.

Simplify \[\frac{1}{\log_a(abc)}+\frac{1}{\log_b(abc)}+\frac{1}{\log_c(abc)},\] where $a, b, c$ are positive real numbers.

If $a$ , $b$ , $c$ , $d$ are integers and $A=2(a-2b+c)^4+2(b-2c+a)^4+2(c-2a+b)^4$ , $B=d(d+1)(d+2)(d+3)+1$ , then prove that $\left (\sqrt{A}+1 \right )^2 +B$ cannot be a perfect square.

$I$ is incenter of $\triangle{ABC}$. The incircle touches $BC,CA,AB$ at $D,E,F$, respectively . Let $M,N,K=BI,CI,DI \cap EF$ respectively and $BN\cap CM=P,AK\cap BC=G$. Point $Q$ is intersection of the perpendicular line to $PG$ through $I$ and the perpendicular line to $PB$ through $P$. Prove that $BI$ bisect segment $PQ$.

Calculate the sum of digit of the number $$9 \times 99 \times 9999 \times ... \times \underbrace{ 99...99}_{2^n}$$ where the number of nines doubles in each factor.

Find all real values of $a$ for which the equation $x(x+1)^3=(2x+a)(x+a+1)$ has four distinct real roots.

Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths \[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\] (A triangle is non-degenerate if its vertices are not collinear.) [i]Proposed by Bruno Le Floch, France[/i]

In order to earn her vacation spending money, Alexis helped her mother remove weeds from the garden. When she was done, she came into the house to put away her gardening gloves and change into clean clothes. On her way to her room she notices Joshua with his face to the floor in the family room, looking pretty silly. "Josh, did you know you lose IQ points for sniffing the carpet?" "Shut up. I'm $\textit{not}$ sniffing the carpet. I'm $\textit{doing something}$." "Sure, if $\textit{sniffing the carpet}$ counts as $\textit{doing something}.$" At this point Alexis stands over her twin brother grinning, trying to see how silly she can make him feel. Joshua climbs to his feet and stands on his toes to make himself a half inch taller than his sister, who is ordinarily a half inch taller than Joshua. "I'm measuring something. I'm $\textit{designing}$ something." Alexis stands on her toes too, reminding her brother that she is still taller than he. "When you're done, can you design me a dress?" "Very funny." Joshua walks to the table and points to some drawings. "I'm designing the sand castle I want to build at the beach. Everything needs to be measured out so that I can build something awesome." "And this requires sniffing carpet?" inquires Alexis, who is just a little intrigued by her brother's project. "I was imagining where to put the base of a spiral staircase. Everything needs to be measured out correctly. See, the castle walls will be in the shape of a rectangle, like this room. The center of the staircase will be $9$ inches from one of the corners, $15$ inches from another, $16$ inches from another, and some whole number of inches from the furthest corner." Joshua shoots Alexis a wry smile. The twins liked to challenge each other, and Alexis knew she had to find the distance from the center of the staircase to the fourth corner of the castle on her own, or face Joshua's pestering, which might last for hours or days. Find the distance from the center of the staircase to the furthest corner of the rectangular castle, assuming all four of the distances to the corners are described as distances on the same plane (the ground).

Given a quadratic trinomial $f\left(x\right)=x^2+ax+b$. Assume that the equation $f\left(f\left(x\right)\right)=0$ has four different real solutions, and that the sum of two of these solutions is $-1$. Prove that $b\leq -\frac14$.

Prove that in Euclidean space the surfaces \[((A-\lambda E)^{-1}x,x)=1\] passing through the point $x$ and corresponding to different values of $\lambda$ are pairwise orthogonal ($A$ is a symmetric operator without multiple eigenvalues).

Let $n$ be a positive integer, and let $p$ be a prime number. Prove that if $p^p | n!$, then $p^{p+1} | n!$.

Call a polynomial $ P(x_{1}, \ldots, x_{k})$ [i]good[/i] if there exist $ 2\times 2$ real matrices $ A_{1}, \ldots, A_{k}$ such that $ P(x_{1}, \ldots, x_{k}) = \det \left(\sum_{i=1}^{k}x_{i}A_{i}\right).$ Find all values of $ k$ for which all homogeneous polynomials with $ k$ variables of degree 2 are good. (A polynomial is homogeneous if each term has the same total degree.)

Let $n\geq2$ be an integer. $n$ is a prime if it is only divisible by $1$ and $n$. Prove that there are infinitely many prime numbers.