Let $P,Q,R$ be three points on a circle $k_1$ with $|PQ|=|PR|$ and $|PQ|>|QR|$. Let $k_2$ be the circle with center in $P$ that goes through $Q$ and $R$. The circle with center $Q$ through $R$ intersects $k_1$ in another point $X\ne R$ and intersects $k_2$ in another point $Y\ne R$. The two points $X$ and $R$ lie on different sides of the line through $PQ$. Show that the three points $P$, $X$, $Y$ lie on a common line.

The area of a circle whose circumference is $ 24\pi$ is $ k\pi$. What is the value of $ k$? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 144$

Let $ABC$ a triangle and $k$ a circle such that: (1) The circle $k$ passes through $A$ and $B$ and touches the line $AC.$ (2) The tangent to $k$ at $B$ intersects the line $AC$ in a point $X\ne C.$ (3) The circumcircle $\omega$ of $BXC$ intersects $k$ in a point $Q\ne B.$ (4) The tangent to $\omega$ at $X$ intersects the line $AB$ in a point $Y.$ Prove that the line $XY$ is tangent to the circumcircle of $BQY.$

Provided the equation $xyz = p^n(x + y + z)$ where $p \geq 3$ is a prime and $n \in \mathbb{N}$. Prove that the equation has at least $3n + 3$ different solutions $(x,y,z)$ with natural numbers $x,y,z$ and $x < y < z$. Prove the same for $p > 3$ being an odd integer.

a) Prove that you can rearrange the numbers $1, 2, ... , 32$ in such a way, that for every couple of numbers none of the numbers between them will equal their arithmetic mean. b) Can you rearrange the numbers $1, 2, ... , 100$ in such a way, that for every couple of numbers none of the numbers between them will equal their arithmetic mean?

Positive integer $q{}$ is $m-additive$ $(m\in\mathbb{N}, m\geq2)$ if there exist pairwise distinct positive integers $a_1,a_2,\ldots,a_m$ such that $q=a_1+a_2+\ldots+a_m$ and $a_i | a_{i+1}$ for $i=1,2,\ldots,m-1$. [b]a)[/b] Prove that $1993$ is $8$-additive, but $9$-additive. [b]b)[/b] Determine the greatest integer $m$ for which $2102$ is $m$-additive.

There are seven piles with $2014$ pebbles each and a pile with $2008$ pebbles. Ana and Beto play in turns and Ana always plays first. One move consists of removing pebbles from all the piles. From each pile is removed a different amount of pebbles, between $1$ and $8$ pebbles. The first player who cannot make a move loses. a) Who has a winning strategy? b) If there were seven piles with $2015$ pebbles each and a pile with $2008$ pebbles, who has a winning strategy?

Let $ABC$ be a triangle and let $D$ be a point on the segment $BC, D\neq B$ and $D\neq C$. The circle $ABD$ meets the segment $AC$ again at an interior point $E$. The circle $ACD$ meets the segment $AB$ again at an interior point $F$. Let $A'$ be the reflection of $A$ in the line $BC$. The lines $A'C$ and $DE$ meet at $P$, and the lines $A'B$ and $DF$ meet at $Q$. Prove that the lines $AD, BP$ and $CQ$ are concurrent (or all parallel).

Let $ABC$ be a right-angled triangle in $A$ such that $AB<AC$. Let $M$ be the midpoint of $BC$ and let $D$ be the intersection of $AC$ with the perpendicular line to $BC$ which passes through $M$. Let $E$ be the intersection point of the parallel line to $AC$ which passes through $M$ with the perpendicular line to $BD$ which passes through $B$. Prove that triangles $AEM$ and $MCA$ are similar if and only if $\angle ABC=60^{\circ}$.

Square $ABCD$ is divided into $n^2$ equal small squares by lines parallel to its sides.A spider starts from $A$ and moving only rightward or upwards,tries to reach $C$.Every "movement" of the spider consists of $k$ steps rightward and $m$ steps upwards or $m$ steps rightward and $k$ steps upwards(it can follow any possible order for the steps of each "movement").The spider completes $l$ "movements" and afterwards it moves without limitation (it still moves rightwards and upwards only).If $n=m\cdot l$,find the number of the possible paths the spider can follow to reach $C$.Note that $n,m,k,l\in \mathbb{N^{*}}$ with $k<m$.

[b]8.[/b] Let $f$ be a bounded real function defined on the unit cube $H$ of the $n$-dimensional space and, for a given $y$, let $A_y$ and $B_y$ denote the parts of the interior of $H$ on which $f>y$ and $f<y$, respectively. Show that $f$ is integrable in the Riemannian sense if and only if for every $y$ almost all points of $A_y$ and $B_y$ are inner points. [b](R. 9)[/b]

Let $ E$ be the set of all real functions on $ I\equal{}[0,1]$. Prove that one cannot define a topology on $ E$ in which $ f_n\rightarrow f$ holds if and only if $ f_n$ converges to $ f$ almost everywhere.

There is a finite set of points in the plane, where each point is painted in any of $ n $ different colors $ (n \ge 4) $. It is known that there is at least one point of each color and that the distance between any pair of different colored points is less than or equal a 1. Prove that it is possible to choose 3 colors so that, by removing all points of those colors, the remaining set of points can be covered with a radius circle $ \frac {1} {\sqrt {3}} $.

The number of real values of $ x$ satisfying the equation $ 2^{2x^2 \minus{} 7x \plus{} 5} \equal{} 1$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ \text{more than 4}$

Let $ab$ be a two digit number. A positive integer $n$ is a [i]relative[/i] of $ab$ if: [list] [*] The units digit of $n$ is $b$. [*] The remaining digits of $n$ are nonzero and add up to $a$.[/list] Find all two digit numbers which divide all of their relatives.

Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. A circle $\Gamma$ is internally tangent to $\omega$ at $A$ and also tangent to $BC$ at $D$. Let $AB$ and $AC$ intersect $\Gamma$ at $P$ and $Q$ respectively. Let $M$ and $N$ be points on line $BC$ such that $B$ is the midpoint of $DM$ and $C$ is the midpoint of $DN$. Lines $MP$ and $NQ$ meet at $K$ and intersect $\Gamma$ again at $I$ and $J$ respectively. The ray $KA$ meets the circumcircle of triangle $IJK$ again at $X\neq K$. Prove that $\angle BXP = \angle CXQ$. [i]Kian Moshiri, United Kingdom[/i]

A function $f:[0,\infty)\to[0,\infty)$ is integrable and $$\int_0^\infty f(x)^2 dx<\infty,\quad \int_0^\infty xf(x) dx <\infty$$ Prove the following inequality. $$\left(\int_0^\infty f(x) dx \right)^3 \leq 8\left(\int_0^\infty f(x)^2 dx \right) \left(\int_0^\infty xf(x) dx \right)$$

Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$ over the integers for every $i$.

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Let $n\geq 2$ be an integer. Consider the solutions of the system $$\begin{cases} n=a+b-c \\ n=a^2+b^2-c^2 \end{cases}$$ where $a,b,c$ are integers. Show that there is at least one solution and that the solutions are finitely many.

The [i]Cantor set[/i] is defined as the set of real numbers $x$ such that $0 \le x < 1$ and the digit $1$ does not appear in the base-$3$ expansion of $x.$ Two numbers are uniformly and independently selected at random from the Cantor set. Compute the expected value of their difference. (Formally, one can pick a number $x$ uniformly at random from the Cantor set by first picking a real number $y$ uniformly at random from the interval $[0, 1)$, writing it out in binary, reading its digits as if they were in base-$3,$ and setting $x$ to $2$ times the result.)

For every positive integer $ n$ consider \[ A_n\equal{}\sqrt{49n^2\plus{}0,35n}. \] (a) Find the first three digits after decimal point of $ A_1$. (b) Prove that the first three digits after decimal point of $ A_n$ and $ A_1$ are the same, for every $ n$.

The trapezoid is composed of three conguent right isosceles triangles as shown in the figure. It is necessary to cut it into $4$ equal parts. How to do it? [img]https://cdn.artofproblemsolving.com/attachments/f/e/87b07ae823190f26b70bfa22824679a829e649.png[/img]

A [i]hedgehog[/i] is a circle without its boundaries. The diameter of the hedgehog is the diameter of the corresponding circle. We say that the hedgehog sits at the at the point where the center of the circle is located. We are given a triangle with sides $a, b, c$, with hedgehogs sitting at its vertices. It is known that inside the triangle there is a point from which you can reach any side of the triangle by walking along a straight line without hitting any hedgehog. What is the largest possible sum of the diameters of these hedgehogs? [i]Proposed by Oleksiy Masalitin[/i]

A square array of dots with $7$ rows and $7$ columns is given. Each dot is colored either blue or red. Whenever two dots of the same color are adjacent in the same row or column, they are joined by a line segment of the same color as the dots. If they are adjacent but of difference colors, they are then joined by a purple line segment. There are $20$ red line segments and $19$ blue line segments. Find the positive difference between the maximum and minimum number of red dots. [asy] size(4cm); for (int i = 0; i <= 7; ++i) { for (int j = 0; j <= 7; ++j) { dot((i,j)); } } [/asy] $ \mathrm{(A) \ } 4 \qquad \mathrm{(B) \ } 5 \qquad \mathrm {(C) \ } 6 \qquad \mathrm{(D) \ } 7 \qquad \mathrm{(E) \ } 8$