Let $ABC$ be a triangle with $AB=AC$ and let $I$ be its incenter. Let $\Gamma$ be the circumcircle of $ABC$. Lines $BI$ and $CI$ intersect $\Gamma$ in two new points, $M$ and $N$ respectively. Let $D$ be another point on $\Gamma$ lying on arc $BC$ not containing $A$, and let $E,F$ be the intersections of $AD$ with $BI$ and $CI$, respectively. Let $P,Q$ be the intersections of $DM$ with $CI$ and of $DN$ with $BI$ respectively. (i) Prove that $D,I,P,Q$ lie on the same circle $\Omega$ (ii) Prove that lines $CE$ and $BF$ intersect on $\Omega$

Find all prime numbers $ p,q,r$, such that $ \frac{p}{q}\minus{}\frac{4}{r\plus{}1}\equal{}1$

Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$. [i]South Africa [/i]

Place the numbers $ 1, 2, 3, 4, 5, 6, 7, 8$ at the vertices of a cuboid such that the sum of any $ 3$ numbers on a side is not less than $ 10$. Find the smallest possible sum of the 4 numbers on a side.

A coordinate system was drawn on the board and points $A (1,2)$ and $B (3,1)$ were marked. The coordinate system was erased. Restore it by the two marked points.

Let $ ABC$ be an acute triangle with the incircle $ C(I,r)$ and the circumcircle $ C(O,R)$ . Denote $ D\in BC$ for which $ AD\perp BC$ and $ AD \equal{} h_a$ . Prove that $ DI^2 \equal{} (2R \minus{} h_a)(h_a \minus{} 2r)$ .

Let $X$ be a subset of $R_{+}^{*}$ with $m$ elements. Find $X$ such that the number of subsets with the same sum is maximum.

Let $AD$ be an altitude of triangle $ABC$, and let $M$, $N$ and $P$ be midpoints of $AB$, $AD$ and $BC$, respectively. Furthermore let $K$ be a foot of perpendicular from point $D$ to line $AC$, and let $T$ be point on extension of line $KD$ (over point $D$) such that $\mid DT \mid = \mid MN \mid + \mid DK \mid$. If $\mid MP \mid = 2 \cdot \mid KN \mid$, prove that $\mid AT \mid = \mid MC \mid$.

Each of the thieves in the $n$-member party ($n \ge 3$) charged a certain number of coins. All the coins were $100n$. Thieves decided to share their prey as follows: at each step, one of the bandits puts one coin to the other two. Find them all natural numbers $n \ge 3$ for which after a finite number of steps each outlaw can have $100$ coins no matter how many coins each thug has charged.

What is largest positive integer n satisfying the following inequality: $n^{2006}$ < $7^{2007}$?

Let $n$ be an integer greater than $1$, $\alpha$ is a real, $0<\alpha < 2$, $a_1,\ldots ,a_n,c_1,\ldots ,c_n$ are all positive numbers. For $y>0$, let $$f(y)=\left(\sum_{a_i\le y} c_ia_i^2\right)^{\frac{1}{2}}+\left(\sum_{a_i>y} c_ia_i^{\alpha} \right)^{\frac{1}{\alpha}}.$$ If positive number $x$ satisfies $x\ge f(y)$ (for some $y$), prove that $f(x)\le 8^{\frac{1}{\alpha}}\cdot x$.

Find the last four digits of each of the numbers $3^{1000}$ and $3^{1997}$.

Point $L$ inside triangle $ABC$ is such that $CL = AB$ and $ \angle BAC + \angle BLC = 180^{\circ}$. Point $K$ on the side $AC$ is such that $KL \parallel BC$. Prove that $AB = BK$

let P be a finite set with at least 2 elements. P is a partially ordered and connected set. $p:P^3 \to P$ is a 3-variable, monotone function which satisfies p(x,x,y)=y. Prove that there exists a non-empty subset $I \subset P$ such that $\forall x \in P$ $\forall y \in I$, we have $p(x, y, y) \in I$. [P is connected means that if each element is replaced by vertices and there is an edge between 2 vertices iff the 2 elements can be compared, then the graph is connected. p is monotone means that if $x_1\leq y_1 , x_2\leq y_2 , x_3\leq y_3$ , then $p(x_1,x_2,x_3)\leq p(y_1,y_2,y_3)$.]

Let $p$ be an odd prime and $a_1, a_2,...,a_p$ be integers. Prove that the following two conditions are equivalent: 1) There exists a polynomial $P(x)$ with degree $\leq \frac{p-1}{2}$ such that $P(i) \equiv a_i \pmod p$ for all $1 \leq i \leq p$ 2) For any natural $d \leq \frac{p-1}{2}$, $$ \sum_{i=1}^p (a_{i+d} - a_i )^2 \equiv 0 \pmod p$$ where indices are taken $\pmod p$

Given $\triangle ABC$ with circumcircle $\ell$. Point $M$ in $\triangle ABC$ such that $AM$ is the angle bisector of $\angle BAC$. Circle with center $M$ and radius $MB$ intersects $\ell$ and $BC$ at $D$ and $E$ respectively, $(B \not= D, B \not= E)$. Let $P$ be the midpoint of arc $BC$ in $\ell$ that didn't have $A$. Prove that $AP$ angle bisector of $\angle DPE$ if and only if $\angle B = 90^{\circ}$.

Let $VABC$ be a regular triangular pyramid with base $ABC$, of center $O$. Points $I$ and $H$ are the center of the inscribed circle, respectively the orthocenter $\vartriangle VBC$. Knowing that $AH = 3 OI$, determine the measure of the angle between the lateral edge of the pyramid and the plane of the base.

Pentagon $ABCDE$ is such that all five diagonals $AC, BD, CE, DA,$ and $EB$ lie entirely within the pentagon. If the area of each of the triangles $ABC, BCD, CDE,$ and $DEA$ is equal to $1$ and the area of triangle $EAB$ is equal to $2$, the area of the pentagon $ABCDE$ is closest to $ \mathrm{(A) \ } 4.42 \qquad \mathrm{(B) \ } 4.44 \qquad \mathrm {(C) \ } 4.46 \qquad \mathrm{(D) \ } 4.48 \qquad \mathrm{(E) \ } 4.5$

Find the smallest constant $ C$ such that for all real $ x,y$ \[ 1\plus{}(x\plus{}y)^2 \leq C \cdot (1\plus{}x^2) \cdot (1\plus{}y^2)\] holds.

Find all real parameters $a$ for which the equation $x^8 +ax^4 +1 = 0$ has four real roots forming an arithmetic progression.

Let $ m_1$, $ m_2$, $ \cdots$, $ m_r$ (may not distinct) and $ n_1$, $ n_2$ $ \cdots$, $ n_s$ (may not distinct) be two groups of positive integers such that for any positive integer $ d$ larger than $ 1$, the numbers of which can be divided by $ d$ in group $ m_1$, $ m_2$, $ \cdots$, $ m_r$ (including repeated numbers) are no less than that in group $ n_1$, $ n_2$ $ \cdots$, $ n_s$ (including repeated numbers). Prove that $ \displaystyle \frac{m_1 \cdot m_2 \cdots m_r}{n_1 \cdot n_2 \cdots n_s}$ is integer.

A [i]weird checkerboard[/i] is a coloring of an $8\times8$ grid constructed by making some (possibly none or all) of the following $14$ cuts: [list] [*] the $7$ vertical cuts along a gridline through the entire height of the board, [*] and the $7$ horizontal cuts along a gridline through the entire width of the board. [/list] The divided rectangles are then colored black and white such that the bottom left corner of the grid is black, and no two rectangles adjacent by an edge share a color. Compute the number of weird checkerboards that have an equal amount of area colored black and white. [center] [img]https://cdn.artofproblemsolving.com/attachments/9/b/f768a7a51c9c9bc56a1d55427c33e15e4bcd74.png[/img] [/center]

Given triangle $ABC$ with $AB<AC$. The line passing through $B$ and parallel to $AC$ meets the external angle bisector of $\angle BAC$ at $D$. The line passing through $C$ and parallel to $AB$ meets this bisector at $E$. Point $F$ lies on the side $AC$ and satisfies the equality $FC=AB$. Prove that $DF=FE$.

For some $ p$, the equation $ x^3 \plus{} px^2 \plus{} 3x \minus{} 10 \equal{} 0$ has three real solutions $ a,b,c$ such that $ c \minus{} b \equal{} b \minus{} a > 0$. Determine $ a,b,c,$ and $ p$.

Quadrilateral $ABCD$ is inscribed in circle $\Gamma$. Segments $AC$ and $BD$ intersect at $E$. Circle $\gamma$ passes through $E$ and is tangent to $\Gamma$ at $A$. Suppose the circumcircle of triangle $BCE$ is tangent to $\gamma$ at $E$ and is tangent to line $CD$ at $C$. Suppose that $\Gamma$ has radius $3$ and $\gamma$ has radius $2$. Compute $BD$.