let $ w_1 $ and $ w_2 $ two circles such that $ w_1 \cap w_2 = \{ A , B \} $ let $ X $ a point on $ w_2 $ and $ Y $ on $ w_1 $ such that $ BY \bot BX $ suppose that $ O $ is the center of $ w_1 $ and $ X' = w_2 \cap OX $ now if $ K = w_2 \cap X'Y $ prove $ X $ is the midpoint of arc $ AK $

Find all the positive primes $p$ for which there exist integers $m,n$ satisfying : $p=m^2+n^2$ and $m^3+n^3-4$ is divisible by $p$.

Find the largest possible volume for a tetrahedron which lies inside a hemisphere of radius $1$.

Let $Y$ and $Z$ be the feet of the altitudes of a triangle $ABC$ drawn from angles $B$ and $C$, respectively. Let $U$ and $V$ be the feet of the perpendiculars from $Y$ and $Z$ on the straight line $BC$. The straight lines $YV$ and $ZU$ intersect at a point $L$. Prove that $AL \perp BC$.

Let $p$ be a prime number and let $X$ be a finite set containing at least $p$ elements. A collection of pairwise mutually disjoint $p$-element subsets of $X$ is called a $p$-family. (In particular, the empty collection is a $p$-family.) Let $A$(respectively, $B$) denote the number of $p$-families having an even (respectively, odd) number of $p$-element subsets of $X$. Prove that $A$ and $B$ differ by a multiple of $p$.

The coefficient of $x^7$ in the expansion of $(\frac{x^2}{2}-\frac{2}{x})^8$ is: $ \textbf{(A)}\ 56\qquad\textbf{(B)}\ -56\qquad\textbf{(C)}\ 14\qquad\textbf{(D)}\ -14\qquad\textbf{(E)}\ 0 $

Consider a regular polygon with $2^n$ sides, for $n \ge 2$, inscribed in a circle of radius $1$. Denote the area of this polygon by $A_n$. Compute $\prod_{i=2}^{\infty}\frac{A_i}{A_{i+1}}$

Let $G$ be a connected simple graph. When we add an edge to $G$ (between two unconnected vertices), then using at most $17$ edges we can reach any vertex from any other vertex. Find the maximum number of edges to be used to reach any vertex from any other vertex in the original graph, i.e. in the graph before we add an edge.

Paul starts with the number $19$. In one step, he can add $1$ to his number, divide his number by $2$, or divide his number by $3$. What is the minimum number of steps Paul needs to get to $1$?

How many non-congruent triangles with perimeter $ 7$ have integer side lengths? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Let $P$ be a convex polygon, and let $n \ge 3$ be a positive integer. On each side of $P$, erect a regular $n$-gon that shares that side of $P$, and is outside $P$. If none of the interiors of these regular n-gons overlap, we call P $n$-[i]good[/i]. (a) Find the largest value of $n$ such that every convex polygon is $n$-[i]good[/i]. (b) Find the smallest value of $n$ such that no convex polygon is $n$-[i]good[/i].

The circles $W_1, W_2, W_3$ in the plane are pairwise externally tangent to each other. Let $P_1$ be the point of tangency between circles $W_1$ and $W_3$, and let $P_2$ be the point of tangency between circles $W_2$ and $W_3$. $A$ and $B$, both different from $P_1$ and $P_2$, are points on $W_3$ such that $AB$ is a diameter of $W_3$. Line $AP_1$ intersects $W_1$ again at $X$, line $BP_2$ intersects $W_2$ again at $Y$, and lines $AP_2$ and $BP_1$ intersect at $Z$. Prove that $X, Y$, and $Z$ are collinear.

Ahmad and Salem play the following game. Ahmad writes two integers (not necessarily different) on a board. Salem writes their sum and product. Ahmad does the same thing: he writes the sum and product of the two numbers which Salem has just written. They continue in this manner, not stopping unless the two players write the same two numbers one after the other (for then they are stuck!). The order of the two numbers which each player writes is not important. Thus if Ahmad starts by writing $3$ and $-2$, the first five moves (or steps) are as shown: (a) Step 1 (Ahmad) $3$ and $-2$ (b) Step 2 (Salem) $1$ and $-6$ (c) Step 3 (Ahmad) $-5$ and $-6$ (d) Step 4 (Salem) $-11$ and $30$ (e) Step 5 (Ahmad) $19$ and $-330$ (i) Describe all pairs of numbers that Ahmad could write, and ensure that Salem must write the same numbers, and so the game stops at step 2. (ii) What pair of integers should Ahmad write so that the game finishes at step 4? (iii) Describe all pairs of integers which Ahmad could write at step 1, so that the game will finish after finitely many steps. (iv) Ahmad and Salem decide to change the game. The first player writes three numbers on the board, $u, v$ and $w$. The second player then writes the three numbers $u + v + w,uv + vw + wu$ and $uvw$, and they proceed as before, taking turns, and using this new rule describing how to work out the next three numbers. If Ahmad goes first, determine all collections of three numbers which he can write down, ensuring that Salem has to write the same three numbers at the next step.

Denote in the triangle $ABC$ by $T_A,T_B,T_C$ the touch points of the exscribed circles of $\vartriangle ABC$, tangent to sides $BC, AC$ and $AB$ respectively. Let $O$ be the center of the circumcircle of $\vartriangle ABC$, and $I$ is the center of it's inscribed circle. It is known that $OI\parallel AC$. Prove that $\angle T_A T_B T_C= 90^o - \frac12 \angle ABC$. (Anton Trygub)

If the interior angles of a triangle $ABC$ satisfy the equality, $$\sin ^2 A + \sin ^2 B + \sin^2 C = 2 \left( \cos ^2 A + \cos ^2 B + \cos ^2 C \right),$$ prove that the triangle must have a right angle.

Prove that, we find infinite numbers such that, this number writeable $1999k+1$ for $k \in {\mathbb N}$ and all digits are equal.