A line passing through the incenter $I$ of the triangle $ABC$ intersect its incircle at $D$ and $E$ and its circumcircle at $F$ and $G$, in such a way that the point $D$ lies between $I$ and $F$. Prove that: $DF \cdot EG \geq r^{2}$.

Let $a$ and $b$ be two primes having at least two digits, such that $a > b$. Show that \[240|\left(a^4-b^4\right)\] and show that 240 is the greatest positive integer having this property.

Find all three-digit numbers whose remainders after division by $11$ give quotient, equal to the sum of the squares of its digits.

Let $n \ge 2$ be a natural number and suppose that positive numbers $a_0,a_1,...,a_n$ satisfy the equality $(a_{k-1}+a_{k})(a_{k}+a_{k+1})=a_{k-1}-a_{k+1}$ for each $k =1,2,...,n -1$. Prove that $a_n< \frac{1}{n-1}$

Consider the set of 30 parabolas defined as follows: all parabolas have as focus the point (0,0) and the directrix lines have the form $y=ax+b$ with a and b integers such that $a\in \{-2,-1,0,1,2\}$ and $b\in \{-3,-2,-1,1,2,3\}$. No three of these parabolas have a common point. How many points in the plane are on two of these parabolas? ${ \textbf{(A)}\ 720\qquad\textbf{(B)}\ 760\qquad\textbf{(C)}\ 810\qquad\textbf{(D}}\ 840\qquad\textbf{(E)}\ 870 $

Find the point $ p $ in the first quadrant on the line $ y = 2x $ such that the distance between $ p $ and $ p' $, the point reflected across the line $ y = x $, is equal to $ \sqrt{32} $.

Show that the equation $\{x^3\}+\{y^3\}=\{z^3\}$ has infinitely many rational non-integer solutions.

Let $A,B\in\mathbb{C}^{n\times n}$ with $\rho(AB - BA) = 1$. Show that $(AB - BA)^2 = 0$.

There are $13$ positive integers greater than $\sqrt{15}$ and less than $\sqrt[3]{B}$. What is the smallest integer value of $B$?

Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that \[ m^2 + f(n) \mid mf(m) +n \] for all positive integers $m$ and $n$.

Let $x_1,x_2,\dots ,x_6$ be nonnegative real numbers such that $x_1+x_2+x_3+x_4+x_5+x_6=1$, and $x_1x_3x_5+x_2x_4x_6 \geq \frac{1}{540}$. Let $p$ and $q$ be positive relatively prime integers such that $\frac{p}{q}$ is the maximum possible value of $x_1x_2x_3+x_2x_3x_4 + x_3x_4x_5 + x_4x_5x_6 + x_5x_6x_1 + x_6x_1x_2$. Find $p+q$.

Show that for any finite set $S$ of distinct positive integers, we can find a set $T \supseteq S$ such that every member of $T$ divides the sum of all the members of $T$. [b]Original Statement:[/b] A finite set of (distinct) positive integers is called a [b]DS-set[/b] if each of the integers divides the sum of them all. Prove that every finite set of positive integers is a subset of some [b]DS-set[/b].

Let $S$ be a set with six elements. Let $P$ be the set of all subsets of $S.$ Subsets $A$ and $B$ of $S$, not necessarily distinct, are chosen independently and at random from $P$. the probability that $B$ is contained in at least one of $A$ or $S-A$ is $\frac{m}{n^{r}},$ where $m$, $n$, and $r$ are positive integers, $n$ is prime, and $m$ and $n$ are relatively prime. Find $m+n+r.$ (The set $S-A$ is the set of all elements of $S$ which are not in $A.$)

For a real number $x$, let $f(x)=\int_0^{\frac{\pi}{2}} |\cos t-x\sin 2t|\ dt$. (1) Find the minimum value of $f(x)$. (2) Evaluate $\int_0^1 f(x)\ dx$. [i]2011 Tokyo Institute of Technology entrance exam, Problem 2[/i]

Find all quadruplets $(x_1, x_2, x_3, x_4)$ of real numbers such that the next six equalities apply: $$\begin{cases} x_1 + x_2 = x^2_3 + x^2_4 + 6x_3x_4\\ x_1 + x_3 = x^2_2 + x^2_4 + 6x_2x_4\\ x_1 + x_4 = x^2_2 + x^2_3 + 6x_2x_3\\ x_2 + x_3 = x^2_1 + x^2_4 + 6x_1x_4\\ x_2 + x_4 = x^2_1 + x^2_3 + 6x_1x_3 \\ x_3 + x_4 = x^2_1 + x^2_2 + 6x_1x_2 \end{cases}$$

On a large chessboard $2n$ of its $1 \times 1$ squares have been marked such thar the rook (which moves only horizontally or vertically) can visit all the marked squares without jumpin over any unmarked ones. Prove that the figure consisting of all the marked squares can be cut into rectangles. (A Shapovalov)

Cut a square with three straight lines into three triangles and four quadrilaterals.

A mouse is on the below grid: \begin{center} \begin{asy} unitsize(2cm); filldraw(circle((0,0),0.07), black); filldraw(circle((0,1),0.07), black); filldraw(circle((1,0),0.07), black); filldraw(circle((0.5,0.5),0.07), black); filldraw(circle((1,1),0.07), black); draw((0,0)--(1,0)); draw((0,0)--(0,1)); draw((1,0)--(1,1)); draw((0,1)--(1,1)); draw((0,1)--(0.5,0.5)); draw((1,0)--(0.5,0.5)); draw((1,1)--(0.5,0.5)); draw((0,0)--(0.5,0.5)); \end{asy} \end{center} The paths connecting each node are the possible paths the mouse can take to walk from a node to another node. Call a ``turn" the action of a walk from one node to another. Given the mouse starts off on an arbitrary node, what is the expected number of turns it takes for the mouse to return to its original node? [i]Lightning 4.2[/i]

Let $I$ be the incenter of a triangle $ABC$ with the property $\angle ABC - \angle BAC=30^{\circ}$. Line $CI$ intersects the circumcircle of $ABC$ at $C_1$. It turned out that $C_1$ lies on a common tangent line of circumcircles of triangles $ABC$ and $BCI$. Find the angles of triangle $ABC$.

Let $w$ be the circumcircle of non-isosceles acute triangle $ABC$. Tangent lines to $w$ in $A$ and $B$ intersect at point $S$. Let M be the midpoint of $AB$, and $H$ be the orthocenter of triangle $ABC$. The line $HA$ intersects lines $CM$ and $CS$ at points $M_a$ and $S_a$, respectively. The points $M_b$ and $S_b$ are defined analogously. Prove that $M_aS_b$ and $M_bS_a$ are the altitudes of triangle $M_aM_bH$.

For what positive integers $n, k$ (with $k < n$) are the binomial coefficients $${n \choose k- 1} \,\,\, , \,\,\, {n \choose k} \,\,\, , \,\,\, {n \choose k + 1}$$ three successive terms of an arithmetic progression?

Find the area of the region of the $xy$-plane defined by the inequality $|x|+|y|+|x+y| \le 1$.

$p,q$ are nonnegative integers.Given two conditions: A: $p^3-q^3$ is an even number. B: $p+q$ is an even number. Then, which one of the followings are true? $(\text{A})$A is sufficient but unnecessary condition of B. $(\text{B})$A is necessary but insufficient condition of B. $(\text{C})$A is sufficient and necessary condition of B. $(\text{D})$A is insufficient and unnecessary condition of B.

Find the number of ordered pairs of real numbers $ (a,b)$ such that $ (a \plus{} bi)^{2002} \equal{} a \minus{} bi$. $ \textbf{(A)}\ 1001\qquad \textbf{(B)}\ 1002\qquad \textbf{(C)}\ 2001\qquad \textbf{(D)}\ 2002\qquad \textbf{(E)}\ 2004$

Assume that the number of offspring for every man can be $0,1,\ldots, n$ with with probabilities $p_0,p_1,\ldots,p_n$ independently from each other, where $p_0+p_1+\cdots+p_n=1$ and $p_n\neq 0$. (This is the so-called Galton-Watson process.) Which positive integer $n$ and probabilities $p_0,p_1,\ldots,p_n$ will maximize the probability that the offspring of a given man go extinct in exactly the tenth generation?