In triangle $ABC, AB \ne AC$. Circle $\omega$ passes through $A$ and meets sides $AB$ and $AC$ at $M$ and $N$, respectively, and the side $BC$ at $P$ and $Q$ such that $Q$ lies in between $B$ and $P$. Suppose that $MP // AC, NQ // AB$, and $BP \cdot AC = CQ \cdot AB$. Find $\angle BAC$.

Let $T$ be any triangle such that its side-lengths $a, b$ and $c$ and its circumradius $R$ are positive integers. Show that: a) the inradius $r$ of $T$ is a positive integer; b) the perimeter $P$ of $T$ is a multiple of $4$; and c) all three of $a, b$ and $c$ are even.

Consider positive integers $a<b$ and the set $C\subset\{a,a+1,a+2,\dots ,b-2,b-1,b\}$. Suppose $C$ has more than $\frac{b-a+1}{2}$ elements. Prove that there are two elements $x,y\in C$ that satisfy $x+y=a+b$. [i] (From "Radu Păun" contest, Radu Miculescu)[/i]

The numbers $1, 2\ldots11$ are arranged in a line from left to right in a random order. It is observed that the middle number is larger than exactly one number to its left. Find the probability that it is larger than exactly one number to its right.

Let $a_1, a_2, \dots, a_{1000}$ be positive integers whose sum is $S$. If $a_n!$ divides $n$ for each $n = 1, 2, \dots, 1000$, compute the maximum possible value of $S$. [i]Proposed by Michael Ren[/i]

Let $ABCD$ be a quadrilateral such that the sum of a pair of opposite sides equals the sum of other pair of opposite sides $ (AB+CD=AD+BC) $. Prove that the circles inscribed in triangles $ABC$ and $ACD$ are tangent to each other.

$a$, $b$, $c$, $d$ are positive real numbers satisfying the following condition: \[\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}=4\] Prove that: \[\sqrt[3]{\frac{a^{3}+b^{3}}{2}}+\sqrt[3]{\frac{b^{3}+c^{3}}{2}}+\sqrt[3]{\frac{c^{3}+d^{3}}{2}}+\sqrt[3]{\frac{d^{3}+a^{3}}{2}}\leq 2(a+b+c+d)-4\]

Given a polynomial with integer coefficents with degree $n>0:$$$P(x)=a_nx^n+...+a_1x+a_0.$$ Assume that there exists a prime number $p$ satisfying these conditions: [i]i)[/i] $p|a_i$ for all $0\le i<n,$ [i]ii)[/i] $p\nmid a_n,$ [i]iii)[/i] $p^2\nmid a_0.$ Prove that $P(x)$ is irreducible in $\mathbb{Z}[x].$

Let $P(x), Q(x)$ be distinct polynomials of degree $2020$ with non-zero coefficients. Suppose that they have $r$ common real roots counting multiplicity and $s$ common coefficients. Determine the maximum possible value of $r + s$. [i]Demetres Christofides, Cyprus[/i]

Consider the polynomial \[P(x)=x^3+3x^2+6x+10.\] Let its three roots be $a$, $b$, $c$. Define $Q(x)$ to be the monic cubic polynomial with roots $ab$, $bc$, $ca$. Compute $|Q(1)|$. [i]Proposed by Nathan Xiong[/i]

The mean of a set of five different positive integers is 15. The median is 18. The maximum possible value of the largest of these five integers is $ \text{(A)}\ 19\qquad\text{(B)}\ 24\qquad\text{(C)}\ 32\qquad\text{(D)}\ 35\qquad\text{(E)}\ 40 $

Let $ABC$ be a triangle and let $P$ be a point in the plane of $ABC$ that is inside the region of the angle $BAC$ but outside triangle $ABC$. [b](a)[/b] Prove that any two of the following statements imply the third. [list] [b](i)[/b] the circumcentre of triangle $PBC$ lies on the ray $\stackrel{\to}{PA}$. [b](ii)[/b] the circumcentre of triangle $CPA$ lies on the ray $\stackrel{\to}{PB}$. [b](iii)[/b] the circumcentre of triangle $APB$ lies on the ray $\stackrel{\to}{PC}$.[/list] [b](b)[/b] Prove that if the conditions in (a) hold, then the circumcentres of triangles $BPC,CPA$ and $APB$ lie on the circumcircle of triangle $ABC$.

in an acute triangle $ABC$,$D$ is a point on $BC$,let $Q$ be the intersection of $AD$ and the median of $ABC$from $C$,$P$ is a point on $AD$,distinct from $Q$.the circumcircle of $CPD$ intersects $CQ$ at $C$ and $K$.prove that the circumcircle of $AKP$ passes through a fixed point differ from $A$.

Find the number of ordered pairs $(a,b)$ of positive integers less than or equal to $20$ such that \[\gcd(a,b)>1 \quad \text{and} \quad \frac{1}{\gcd(a,b)}+\frac{a+b}{\text{lcm}(a,b)} \geq 1.\] [i]Proposed by Zachary Perry[/i]

In the country of Muilejistan, there exists a network of roads connecting all its cities. The network has the particular property that for any two cities, there is a unique path without backtracking (i.e., a path where the traveler never returns along the same road). The longest possible path between two cities is 600 kilometers. For instance, the path from the city of Mlar to the city of Nlar is 600 kilometers. Similarly, the path from the city of Klar to the city of Glar is also 600 kilometers. 1. If Jalim departs from Mlar towards Nlar at noon and Kalim departs from Klar towards Glar also at noon, both traveling at the same speed, prove that they meet at some point on their journey. 2. If the distance in kilometers between any two cities is an integer, prove that the distance from Glar to Mlar is even.

Let $G$ be the complete graph on $2015$ vertices. Each edge of $G$ is dyed red, blue or white. For a subset $V$ of vertices of $G$, and a pair of vertices $(u,v)$, define \[ L(u,v) = \{ u,v \} \cup \{ w | w \in V \ni \triangle{uvw} \text{ has exactly 2 red sides} \}\]Prove that, for any choice of $V$, there exist at least $120$ distinct values of $L(u,v)$.

The diagonals $AD, BE$ and $CF$ of a convex hexagon concur at a point $M$. Suppose the six triangles $ABM, BCM, CDM, DEM, EFM$ and $FAM$ are all acute-angled and the circumcentre of all these triangles lie on a circle. Prove that the quadrilaterals $ABDE, BCEF$ and $CDFA$ have equal areas.

(1) For real numbers $x,\ a$ such that $0<x<a,$ prove the following inequality. \[\frac{2x}{a}<\int_{a-x}^{a+x}\frac{1}{t}\ dt<x\left(\frac{1}{a+x}+\frac{1}{a-x}\right). \] (2) Use the result of $(1)$ to prove that $0.68<\ln 2<0.71.$

Find a five-digit positive integer $n$ (in base $10$) such that $n^3 - 1$ is divisible by $2556$ and which minimizes the sum of digits of $n$.

Find all solutions of the differential equation $zz" - 2z'z' = 0$ which pass through the point $x=1, z=1.$

Compute $ \sum_{n \equal{} 1}^\infty\sum_{k \equal{} 1}^{n \minus{} 1}\frac {k}{2^{n \plus{} k}}$.

Define a sequence $(a_n)$ for $n\ge1$ by $a_1=2$ and $a_{n+1}=a_n^{1+n^{-3/2}}$. Is $(a_n)$ convergent (i.e. $\lim_{n\to\infty}a_n<\infty$)?

Define the function $ g(\cdot): \mathbb{Z} \to \{0,1\}$ such that $ g(n) \equal{} 0$ if $ n < 0$, and $ g(n) \equal{} 1$ otherwise. Define the function $ f(\cdot): \mathbb{Z} \to \mathbb{Z}$ such that $ f(n) \equal{} n \minus{} 1024g(n \minus{} 1024)$ for all $ n \in \mathbb{Z}$. Define also the sequence of integers $ \{a_i\}_{i \in \mathbb{N}}$ such that $ a_0 \equal{} 1$ e $ a_{n \plus{} 1} \equal{} 2f(a_n) \plus{} \ell$, where $ \ell \equal{} 0$ if $ \displaystyle \prod_{i \equal{} 0}^n{\left(2f(a_n) \plus{} 1 \minus{} a_i\right)} \equal{} 0$, and $ \ell \equal{} 1$ otherwise. How many distinct elements are in the set $ S: \equal{} \{a_0,a_1,\ldots,a_{2009}\}$? [i](Paolo Leonetti)[/i]

Cagney can frost a cupcake every $20$ seconds and Lacey can frost a cupcake every $30$ seconds. Working together, how many cupcakes can they frost in $5$ minutes? $ \textbf{(A)}\ 10 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20 \qquad\textbf{(D)}\ 25 \qquad\textbf{(E)}\ 30 $

In the county some pairs of towns connected by two-way non-stop flight. From any town we can flight to any other (may be not on one flight). Gives, that if we consider any cyclic (i.e. beginning and finish towns match) route, consisting odd number of flights, and close all flights of this route, then we can found two towns, such that we can't fly from one to other. Proved, that we can divided all country on $4$ regions, such that any flight connected towns from other regions.