Given a convex quadrilateral $ABCD$.Let $\ell_A,\ell_B,\ell_C,\ell_D$ be exterior angle bisectors of quadrilateral $ABCD$. Let $\ell_A \cap \ell_B=K,\ell_B \cap \ell_C=L,\ell_C \cap \ell_D=M,\ell_D \cap \ell_A=N$.Prove that if circumcircles of triangles $ABK$ and $CDM$ be externally tangent to each other then circumcircles of the triangles $BCL$ and $DAN$ are externally tangent to each other.(L.Emelyanov)

Let $x$ be the smallest positive integer for which $2x$ is the square of an integer, $3x$ is the third power of an integer, and $5x$ is the fifth power of an integer. Find the prime factorization of $x$. (St. Wagner, Stellenbosch University)

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

Let $f:[0,1] \to \mathbb{R}$ be a continuous function with $f(1)=0.$ Prove that the limit $$\lim_{t \nearrow 1} \left( \frac{1}{1-t} \int\limits_0^1x(f(tx)-f(x)) \mathrm{d}x\right)$$ exists and find its value.

Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

For which $n{}$ can we partition a regular $n{}$-gon into finitely many triangles such that no two triangles share a side? [i]Based on a problem of the 2017 Miklós Schweitzer competition[/i]

A ray originating at point $P$ intersects a circle with center $O$ at points $A$ and $B$, with $PB > PA$. Segment $\overline{OP}$ intersects the circle at point $C$. Given that $PA = 31$, $PC = 17$, and $\angle PBO = 60^o$, find the radius of the circle.

The sum of three numbers is $ 20$. The first is $ 4$ times the sum of the other two. The second is seven times the third. What is the product of all three? $ \textbf{(A)}\ 28 \qquad \textbf{(B)}\ 40 \qquad \textbf{(C)}\ 100 \qquad \textbf{(D)}\ 400 \qquad \textbf{(E)}\ 800$

The deputies in a parliament were split into $10$ fractions. According to regulations, no fraction may consist of less than five people, and no two fractions may have the same number of members. After the vacation, the fractions disintegrated and several new fractions arose instead. Besides, some deputies became independent. It turned out that no two deputies that were in the same fraction before the vacation entered the same fraction after the vacation. Find the smallest possible number of independent deputies after the vacation.

In the triangle $\bigtriangleup ABC$ let $D$ be the foot of the altitude from $A$ to the side $BC$ and $I$, $I_A$, $I_C$ be the incenter, $A$-excenter, and $C$-excenter, respectively. Denote by $P\neq B$ and $Q\neq D$ the other intersection points of the circle $\bigtriangleup BDI_C$ with the lines $BI$ and $DI_A$, respectively. Prove that $AP=AQ$. [i]Proposed Michal Jan'ik - Czech Republic[/i]

Let $ABCDEF$ be a convex hexagon of area $1$, whose opposite sides are parallel. The lines $AB$, $CD$ and $EF$ meet in pairs to determine the vertices of a triangle. Similarly, the lines $BC$, $DE$ and $FA$ meet in pairs to determine the vertices of another triangle. Show that the area of at least one of these two triangles is at least $3/2$.

Rectangle $ABCD$ has sides in the ratio of $\sqrt2$ to $1$. If $DEC$ is an isosceles right triangle, with $E$ inside the rectangle, find angle $\angle AEB$.

Call a positive integer $n$ [i]tubular [/i] if for any two distinct primes $p$ and $q$ dividing $n, (p + q) | n$. Find the number of tubular numbers less than $100,000$. (Integer powers of primes, including $1, 3$, and $16$, are not considered [i]tubular[/i].)

Prove that for all $n \in \mathbb{Z^+}$ and for all positive real numbers satisfying $a_1a_2...a_n=1$ \[ \displaystyle\sum_{i=1}^{n} \frac{a_i}{\sqrt{{a_i}^4+3}} \leq \frac{1}{2}\displaystyle\sum_{i=1}^{n} \frac{1}{a_i} \]

Let $\mathbb{R}$ be the set of all real numbers. Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfying for all $x,y\in\mathbb{R}$ the equation $f(x)+f(y)=f(f(x)f(y))$.

Let $ABCD$ be a convex quadrilateral, and let $N$ be the midpoint of $BC$. Suppose further that $\angle AND=135^{\circ}$. Prove that $|AB|+|CD|+\frac{1}{\sqrt{2}}\cdot |BC|\ge |AD|.$

[u]Townspeople and Goons[/u] In the city of Lincoln, there is an empty jail, at least two townspeople and at least one goon. A game proceeds over several days, starting with morning. $\bullet$ Each morning, one randomly selected unjailed person is placed in jail. If at this point all goons are jailed, and at least one townsperson remains, then the townspeople win. If at this point all townspeople are jailed and at least one goon remains, then the goons win. $\bullet$ Each evening, if there is at least one goon and at least one townsperson not in jail, then one randomly selected townsperson is jailed. If at this point there are at least as many goons remaining as townspeople remaining, then the goons win. The game ends immediately after any group wins. [b]p1. [/b]Find the probability that the townspeople win if there are initially two townspeople and one goon. [b]p2.[/b] Find the smallest positive integer $n$ such that, if there are initially $2n$ townspeople and $1$ goon, then the probability the townspeople win is greater than $50\%$. [b]p3.[/b] Find the smallest positive integer $n$ such that, if there are initially $n + 1$ townspeople and $n$ goons, then the probability the townspeople win is less than $1\%$. [b]p4[/b]. Suppose there are initially $1001$ townspeople and two goons. What is the probability that, when the game ends, there are exactly $1000$ people in jail? [b]p5.[/b] Suppose that there are initially eight townspeople and one goon. One of the eight townspeople is named Jester. If Jester is sent to jail during some morning, then the game ends immediately in his sole victory. (However, the Jester does not win if he is sent to jail during some night.) Find the probability that only the Jester wins.

In how many ways can you choose $ k $ squares on a chessboard $ n \times n $ ( $ k \leq n $) so that no two of the chosen squares lie in the same row or column?

Prove that $$\frac{1}{1+a+b}+\frac{1}{1+b+c}+\frac{1}{1+c+a} <1$$ where $a, b$ and $c$ are positive numbers such that $abc = 1$. (G Galperin)

Sixteen people for groups of four people such that each two groups have at most two members in common. Prove that there exists a set of six people in which every group is not properly contained in it.

Prove the following identity for every $ n\in N$: $ \sum_{j\plus{}h\equal{}n,j\geq h}\frac{(\minus{}1)^h2^{j\minus{}h}\binom{j}{h}}{j}\equal{}\frac{2}{n}$

Prove that any triangle having two equal internal angle bisectors (each measured from a vertex to the opposite side) is isosceles.

Prove that $ p $ divides $ \varphi (1+a^p) , $ where $ a\ge 2 $ is a natural number, $ p $ is a prime, and $ \varphi $ is Euler's totient. [i]Cristinel Mortici[/i]

$60$ symbols, each of which is either $X$ or $O$, are written consecutively on a strip of paper. This strip must then be cut into pieces with each piece containing symbols symmetric about their centre, e.g. $O, XX, OXXXXX, XOX$, etc. (a) Prove that there is a way of cutting the strip so that there are no more than $24$ such pieces. (b) Give an example of such an arrangement of the signs for which the number of pieces cannot be less than $15$. (c) Try to improve the result of (b).

In a planar lake, every point can be reached by a straight line from the point $A$. The same holds for the point $B$. Show that this holds for every point on the segment $[AB]$, too.