In triangle $ABC$, the incircle touches sides $BC,CA,AB$ at $D,E,F$ respectively. Assume there exists a point $X$ on the line $EF$ such that \[\angle{XBC} = \angle{XCB} = 45^{\circ}.\] Let $M$ be the midpoint of the arc $BC$ on the circumcircle of $ABC$ not containing $A$. Prove that the line $MD$ passes through $E$ or $F$. United Kingdom

Let the circumcircle of a triangle $ABC$ be $\Gamma$. The tangents to $\Gamma$ at $B,C$ meet at point $E$. For a point $F$ on line $BC$ which is not on the segment $BC$, let the midpoint of $EF$ be $G$. Lines $GB,GC$ meet $\Gamma$ again at points $I,H$ respectively. Let $M$ be the midpoint of $BC$. Prove that the points $F,I,H,M$ lie on a circle. Proposed by [i]Mehmet Can Baştemir[/i]

Let $ k$ be a positive integer. Set $ A \subseteq \mathbb{Z}$ is called a $ \textbf{k \minus{} set}$ if there exists $ x_1, x_2, \cdots, x_k \in \mathbb{Z}$ such that for any $ i \neq j$, $ (x_i \plus{} A) \cap (x_j \plus{} A) \equal{} \emptyset$, where $ x \plus{} A \equal{} \{ x \plus{} a \mid a \in A \}$. Prove that if $ A_i$ is $ \textbf{k}_i\textbf{ \minus{} set}$($ i \equal{} 1,2, \cdots, t$), and $ A_1 \cup A_2 \cup \cdots \cup A_t \equal{} \mathbb{Z}$, then $ \displaystyle \frac {1}{k_1} \plus{} \frac {1}{k_2} \plus{} \cdots \plus{} \frac {1}{k_t} \geq 1$.

There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n \minus{} 1$ is not divisible by $ 3$. [i]Proposed by Dusan Dukic, Serbia[/i]

There is a pile with $15$ coins on a table. At each step, Pedro choses one of the piles in the table with $a>1$ coins and divides it in two piles with $b\geq1$ and $c\geq1$ coins and writes in the board the product $abc$. He continues until there are $15$ piles with $1$ coin each. Determine all possible values that the final sum of the numbers in the board can have.

Consider a $n \times n$ grid divided into $n ^ 2$ squares of $1 \times 1$. Each of the $(n + 1) ^ 2 $ vertices of the grid is colored red or blue. Find the number of coloring such that each unit square has two red and two blue vertices.

Let $ABC$ be an acute triangle where $AC > BC$. Let $T$ denote the foot of the altitude from vertex $C$, denote the circumcentre of the triangle by $O$. Show that quadrilaterals $ATOC$ and $BTOC$ have equal area.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(f(x)-f(y))+2f(xy)=x^2f(x)+f(y^2)$$ for all real numbers $x,y$.

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

If you roll six fair dice, let $\mathsf{ p}$ be the probability that exactly five different numbers appear on the upper faces of the six dice. If $\mathsf{p} = \frac{m}{n}$ where $ m $ and $n$ are relatively prime positive integers, find $m+n.$

Let $n=p_1^{a_1}p_2^{a_2}\cdots p_t^{a_t}$ be the prime factorisation of $n$. Define $\omega(n)=t$ and $\Omega(n)=a_1+a_2+\ldots+a_t$. Prove or disprove: For any fixed positive integer $k$ and positive reals $\alpha,\beta$, there exists a positive integer $n>1$ such that i) $\frac{\omega(n+k)}{\omega(n)}>\alpha$ ii) $\frac{\Omega(n+k)}{\Omega(n)}<\beta$.

Compute the maximum value attained by $f(x)=x^{1/x^2}$.

Given a simple number $p>3$. Consider the set $M$ of the pairs $(x,y)$ with the integer coordinates in the plane such that $0 \le x < p, 0 \le y < p$. Prove that it is possible to mark $p$ points of $M$ such that not a triple of marked points will belong to one line and there will be no parallelogram with the vertices in the marked points.

Let $n > 2$ be an even positive integer and let $a_1 < a_2 < \dots < a_n$ be real numbers such that $a_{k + 1} - a_k \leq 1$ for each $1 \leq k \leq n - 1$. Let $A$ be the set of ordered pairs $(i, j)$ with $1 \leq i < j \leq n$ such that $j - i$ is even, and let $B$ the set of ordered pairs $(i, j)$ with $1 \leq i < j \leq n$ such that $j - i$ is odd. Show that $$\prod_{(i, j) \in A} (a_j - a_i) > \prod_{(i, j) \in B} (a_j - a_i)$$

The vertices of the square $ABCD$ are the centers of four circles, all of which pass through the center of the square. Prove that the intersections of the circles on the square $ABCD$ sides are vertices of a regular octagon.

Let $ABC$ be a triangle inscribed in a circle $(O)$. Let $P$ be an arbitrary point in the plane of triangle $ABC$. Points $A',B',C'$ are the reflections of $P$ about the lines $BC,CA,AB$ respectively. $X$ is the intersection, distinct from $A$, of the circle with diameter $AP$ and the circumcircle of triangle $AB'C'$. Points $Y,Z$ are defined in the same way. Prove that five circles $(O), (AB'C')$, $(BC'A'), (CA'B'), (XY Z)$ have a point in common. Nguyễn Văn Linh

Let $ABC$ be an equilateral triangle , and $P$ be a point on the circumcircle of the triangle but distinct from $A$ ,$B$ and $C$. The lines through $P$ and parallel to $BC$ , $CA$ , $AB$ intersect the lines $CA$ , $AB$ , $BC$ at $M$ , $N$ and $Q$ respectively .Prove that $M$ , $N$ and $Q$ are collinear .

$n$ points are given on a plane where $n\ge4$. All pairs of points are connected with a segment. Find the maximal number of segments which don't intersect with any other segments in their interior.

Jeremy's father drives him to school in rush hour traffic in 20 minutes. One day there is no traffic, so his father can drive him 18 miles per hour faster and gets him to school in 12 minutes. How far in miles is it to school? $ \textbf{(A) } 4 \qquad \textbf{(B) } 6 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 12 $

Consider a recursively defined sequence $a_n$ with $a_1=1$ such that, for $n \ge 2,$ $a_n$ is formed by appending the last digit of $n$ to the end of $a_{n-1}.$ For a positive integer $m,$ let $\nu_3(m)$ be the largest integer $t$ such that $3^t \mid m.$ Compute $$\sum_{n=1}^{810} \nu_3(a_n).$$

Let $n$ be an odd positive integer. Show that the equation $$ \frac{4}{n} =\frac{1}{x} + \frac{1}{y}$$ has a solution in the positive integers if and only if $n$ has a divisor of the form $4k+3$.

In a mathematical contest, some of the competitors are friends and friendship is mutual. Prove that there is a subset $M$ of the competitors such that each element of $M$ has at most three friends in $M$ and such that each competitor who is not in $M,$ has at least four friends in $M.$

For an integer $n$, define $f(n)$ to be the greatest integer $k$ such that $2^k$ divides $\binom{n}{m}$ for some $0 \le m \le n$. Compute $f(1) + f(2) + \cdots + f(2048)$.

Let $b_1$, $b_2$, $b_3$, $c_1$, $c_2$, and $c_3$ be real numbers such that for every real number $x$, we have \[ x^6 - x^5 + x^4 - x^3 + x^2 - x + 1 = (x^2 + b_1 x + c_1)(x^2 + b_2 x + c_2)(x^2 + b_3 x + c_3). \] Compute $b_1 c_1 + b_2 c_2 + b_3 c_3$.

[b]7.1[/b] Given a convex $n$-gon all of whose angles are obtuse. Prove that the sum of the lengths of the diagonals in it is greater than the sum of the lengths of the sides. [b]7.2[/b] Find all integer values for $x$ and $y$ such that $x^4 + 4y^4$ is a prime number[b]. (typo corrected)[/b] [b]7.3.[/b] Given a triangle $ABC$. Parallelograms $ABKL$, $BCMN$ and $ACFG$ are constructed on the sides, Prove that the segments $KN$, $MF$ and $GL$ can form a triangle. [img]https://cdn.artofproblemsolving.com/attachments/a/f/7a0264b62754fafe4d559dea85c67c842011fc.png[/img] [b]7.4 / 6.2[/b] Prove that a $10 \times 10$ chessboard cannot be covered with $ 25$ figures like [img]https://cdn.artofproblemsolving.com/attachments/0/4/89aafe1194628332ec13ad1c713bb35cbefff7.png[/img]. [b]7.5[/b] Find the greatest number of different natural numbers, each of which is less than $50$, and every two of which are coprime. [b]7.6.[/b] Given a triangle $ABC$.$ D$ and $E$ are the midpoints of the sides $AB$ and $BC$. Point$ M$ lies on $AC$ , $ME > EC$. Prove that $MD < AD$. [img]https://cdn.artofproblemsolving.com/attachments/e/c/1dd901e0121e5c75a4039d21b954beb43dc547.png[/img] PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983461_1964_leningrad_math_olympiad]here[/url].