The altitudes $AH, CH$ of an acute-angled triangle $ABC$ meet the internal bisector of angle $B$ at points $L_1, P_1$, and the external bisector of this angle at points $L_2, P_2$. Prove that the orthocenters of triangles $HL_1P_1, HL_2P_2$ and the vertex $B$ are collinear.

Let the centroid of the triangle $ABC$ be $G$ and let the line parallel to $\overline{BC}$ that passes through $A$ be $l$. Define a point, $D$ on $l$ such that $\angle DGC=90^o$. Prove that \[2[ADCG]\leq AB\cdot DC\] For clarification, [ADGC] represents the area of the quadrilateral ADGC.

There are 1000 gentlemen listed in the register of a city with numbers from 1 to 1000. Any 720 of them form a club. The mayor wants to impose a tax on each club, which is paid by all club members in equal shares (the tax is an arbitrary non-negative real number). At the same time, the total tax paid by a gentleman should not exceed his number in the register. What is the largest tax the mayor can collect? [i]Proposed by I. Bogdanov[/i]

Let $A$ be a set of positive integers such that for any two distinct elements $x, y\in A$ we have $|x-y| \geq \frac{xy}{25}.$ Prove that $A$ contains at most nine elements. Give an example of such a set of nine elements.

Find all quadrilaterals which can be covered (without overlappings) with squares with side $ 1$ and equilateral triangles with side $ 1$. (Emanuele Tron)

(i): Prove that if $n$ is a positive integer, then $$\binom{2n}{n}=\frac{(2n)!}{(n!)^2}$$ is a positive integer that is divisible by all prime numbers $p$ with $n<p\le 2n$, and that $$\binom{2n}{n}<2^{2n}.$$ (ii): For $x$ a positive real number, let $\pi(x)$ denote the number of prime numbers $p \le x$. [Thus, $\pi(10) = 4$ since there are $4$ primes, viz., $2$, $3$, $5$, and $7$, not exceeding $10$.]Prove that if $n \ge 3$ is an integer, then (a)$$\pi(2n) < \pi(n) + {{2n}\over{\log_2(n)}};$$(b)$$\pi(2^n) < {{2^{n+1}\log_2(n-1)}\over{n}};$$(c) Deduce that, for all real numbers $x \ge 8$,$$\pi(x) < {{4x \log_2(\log_2(x))}\over{\log_2(x)}}.$$

It is known about the numbers $a, b$ and $c$ that $\frac{a}{b+c-a}=\frac{b}{a ​​+ c-b}= \frac{c}{a ​​+ b-c}$. What values ​​can an expression take $\frac{(a + b) (b + c) (a + c)}{abc}$ ?

Daphne is visited periodically by her three best friends: Alice, Beatrix, and Claire. Alice visits every third day, Beatrix visits every fourth day, and Claire visits every fifth day. All three friends visited Daphne yesterday. How many days of the next $365$-day period will exactly two friends visit her? $\textbf{(A) }48\qquad \textbf{(B) }54\qquad \textbf{(C) }60\qquad \textbf{(D) }66\qquad \textbf{(E) }72\qquad$

In a bank, only the manager knows the safe's combination, which is a five-digit number. To support this combination, each of the bank's ten employees is given a five-digit number. Each of these backup numbers has in one of the five positions the same digit as the combination and in the other four positions a different digit than the one in that position in the combination. Backup numbers are: $07344$, $14098$, $27356$, $36429$, $45374$, $52207$, $63822$, $70558$, $85237$, $97665$. What is the combination to the safe?

Senators Sernie Banders and Cedric "Ced" Truz of OMOrica are running for the office of Price Dent. The election works as follows: There are $66$ states, each composed of many adults and $2017$ children, with only the latter eligible to vote. On election day, the children each cast their vote with equal probability to Banders or Truz. A majority of votes in the state towards a candidate means they "win" the state, and the candidate with the majority of won states becomes the new Price Dent. Should both candidates win an equal number of states, then whoever had the most votes cast for him wins. Let the probability that Banders and Truz have an unresolvable election, i.e., that they tie on both the state count and the popular vote, be $\frac{p}{q}$ in lowest terms, and let $m, n$ be the remainders when $p, q$, respectively, are divided by $1009$. Find $m + n$. [i]Proposed by Ashwin Sah[/i]

Let $p$ and $q$ be given prime numbers and $S$ be a subset of ${1,2,3,\dots ,p-2,p-1}$. Prove that the number of elements in the set $A=\{ (x_1,x_2,…,x_q ):x_i\in S,\sum_{i=1}^q x_i \equiv 0(mod\: p)\}$ is multiple of $q$.

Scalene triangle $ABC$ satisfies $\angle A = 60^{\circ}$. Let the circumcenter of $ABC$ be $O$, the orthocenter be $H$, and the incenter be $I$. Let $D$, $T$ be the points where line $BC$ intersects the internal and external angle bisectors of $\angle A$, respectively. Choose point $X$ on the circumcircle of $\triangle IHO$ such that $HX \parallel AI$. Prove that $OD \perp TX$.

In the figure below $WXYZ$ is a rectangle with $WX=4$ and $WZ=8$. Point $M$ lies $\overline{XY}$, point $A$ lies on $\overline{YZ}$, and $\angle WMA$ is a right angle. The areas of $\triangle WXM$ and $\triangle WAZ$ are equal. What is the area of $\triangle WMA$? [asy] pair X = (0, 0); pair W = (0, 4); pair Y = (8, 0); pair Z = (8, 4); label("$X$", X, dir(180)); label("$W$", W, dir(180)); label("$Y$", Y, dir(0)); label("$Z$", Z, dir(0)); draw(W--X--Y--Z--cycle); dot(X); dot(Y); dot(W); dot(Z); pair M = (2, 0); pair A = (8, 3); label("$A$", A, dir(0)); dot(M); dot(A); draw(W--M--A--cycle); markscalefactor = 0.05; draw(rightanglemark(W, M, A)); label("$M$", M, dir(-90)); [/asy] $ \textbf{(A) }13 \qquad \textbf{(B) }14 \qquad \textbf{(C) }15 \qquad \textbf{(D) }16 \qquad \textbf{(E) }17 \qquad $

Let $ABC$ be an acute angled triangle satisfying the conditions $AB>BC$ and $AC>BC$. Denote by $O$ and $H$ the circumcentre and orthocentre, respectively, of the triangle $ABC.$ Suppose that the circumcircle of the triangle $AHC$ intersects the line $AB$ at $M$ different from $A$, and the circumcircle of the triangle $AHB$ intersects the line $AC$ at $N$ different from $A.$ Prove that the circumcentre of the triangle $MNH$ lies on the line $OH$.

Let $ABCD$ be a cyclic quadrilateral such that $\angle ACB = 2\angle CAD$ and $\angle ACD = 2\angle BAC$. Prove that $|CA| = |CB| + |CD|$.

Let $P_n$ be the number of permutations $\pi$ of $\{1,2,\dots,n\}$ such that \[|i-j|=1\text{ implies }|\pi(i)-\pi(j)|\le 2\] for all $i,j$ in $\{1,2,\dots,n\}.$ Show that for $n\ge 2,$ the quantity \[P_{n+5}-P_{n+4}-P_{n+3}+P_n\] does not depend on $n,$ and find its value.

Let $a,b,c>0$ such that $a \geq bc^2$ , $b \geq ca^2$ and $c \geq ab^2$ . Find the maximum value that the expression : $$E=abc(a-bc^2)(b-ca^2)(c-ab^2)$$ can acheive.

Given points $A$, $B$, $C$, and $D$ on circle $\omega$ such that lines $AB$ and $CD$ intersect on point $T$ where $A$ is between $B$ and $T$, moreover $D$ is between $C$ and $T$. It is known that the line passing through $D$ which is parallel to $AB$ intersects $\omega$ again on point $E$ and line $ET$ intersects $\omega$ again on point $F$. Let $CF$ and $AB$ intersect on point $G$, $X$ be the midpoint of segment $AB$, and $Y$ be the reflection of point $T$ to $G$. Prove that $X$, $Y$, $C$, and $D$ are concyclic.

Let $a_1,a_2,\cdots$ be a strictly increasing sequence on positive integers. Is it always possible to partition the set of natural numbers $\mathbb{N}$ into infinitely many subsets with infinite cardinality $A_1,A_2,\cdots$, so that for every subset $A_i$, if we denote $b_1<b_2<\cdots$ be the elements of $A_i$, then for every $k\in \mathbb{N}$ and for every $1\le i\le a_k$, it satisfies $b_{i+1}-b_{i}\le k$?

A sequence of $28$ letters consists of $14$ of each of the letters $A$ and $B$ arranged in random order. The expected number of times that $ABBA$ appears as four consecutive letters in that sequence is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $a,b,c \geq 0$ and $a+b+c=3.$ Prove that $$\frac{a}{1+b}+\frac{b}{1+c}+\frac{c}{1+a} \geq \frac{1}{1+b}+\frac{1}{1+c}+\frac{1}{1+a}$$

Let $ABCD$ be a convex quadrilateral and let $P$ and $Q$ be variable points inside this quadrilateral so that $\angle APB=\angle CPD=\angle AQB=\angle CQD$. Prove that the lines $PQ$ obtained in this way all pass through a fixed point , or they are all parallel.

Consider two real numbers $ a\in [ - 2,\infty)\ ,\ r\in [0,\infty)$ and the natural number $ n\ge 1$. Show that: \[ r^{2n} + ar^n + 1\ge (1 - r)^{2n}\]

Let $d$ be a real number. For each integer $m \geq 0,$ define a sequence $\left\{a_{m}(j)\right\}, j=0,1,2, \ldots$ by the condition \begin{align*} a_{m}(0)&=d / 2^{m},\\ a_{m}(j+1)&=\left(a_{m}(j)\right)^{2}+2 a_{m}(j), \quad j \geq 0. \end{align*} Evaluate $\lim _{n \rightarrow \infty} a_{n}(n).$

Let $ a_1,a_{2},\ldots ,a_{100}$ be nonnegative integers satisfying the inequality \[a_1\cdot (a_1-1)\cdot\ldots\cdot (a_1-20)+a_2\cdot (a_2-1)\cdot\ldots\cdot (a_2-20)+\\ \ldots+a_{100}\cdot (a_{100}-1)\cdot\ldots\cdot (a_{100}-20)\le 100\cdot 99\cdot 98\cdot\ldots\cdot 79.\] Prove that $a_1+a_2+\ldots+a_{100}\le 9900$.