Let $k$ be the incircle of the triangle $ABC$ with the center of the incircle $I$. The circle $k$ touches the sides $BC, CA$ and $AB$ in points $D, E$ and $F$. Let $G$ be the intersection of the straight line $AI$ and the circle $k$, which lies between $A$ and $I$. Assume $BE$ and $FG$ are parallel. Show that $BD = EF$.

Triangle $ABC$ has $AC = 3$, $BC = 5$, $AB = 7$. A circle is drawn internally tangent to the circumcircle of $ABC$ at $C$, and tangent to $AB$. Let $D$ be its point of tangency with $AB$. Find $BD - DA$. [asy] /* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(6cm); real labelscalefactor = 2.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -4.5, xmax = 7.01, ymin = -3, ymax = 8.02; /* image dimensions */ /* draw figures */ draw(circle((1.37,2.54), 5.17)); draw((-2.62,-0.76)--(-3.53,4.2)); draw((-3.53,4.2)--(5.6,-0.44)); draw((5.6,-0.44)--(-2.62,-0.76)); draw(circle((-0.9,0.48), 2.12)); /* dots and labels */ dot((-2.62,-0.76),dotstyle); label("$C$", (-2.46,-0.51), SW * labelscalefactor); dot((-3.53,4.2),dotstyle); label("$A$", (-3.36,4.46), NW * labelscalefactor); dot((5.6,-0.44),dotstyle); label("$B$", (5.77,-0.17), SE * labelscalefactor); dot((0.08,2.37),dotstyle); label("$D$", (0.24,2.61), SW * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); label("$7$",(-3.36,4.46)--(5.77,-0.17), NE * labelscalefactor); label("$3$",(-3.36,4.46)--(-2.46,-0.51),SW * labelscalefactor); label("$5$",(-2.46,-0.51)--(5.77,-0.17), SE * labelscalefactor); /* end of picture */ [/asy]

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, and $AC = 15$. Let$ D$ and $E$ be the feet of the altitudes from $A$ and $B$, respectively. Find the circumference of the circumcircle of $\vartriangle CDE$

Find all pairs $(a, b)$ of positive integers such that \[(\sqrt[3]{a}+\sqrt[3]{b}-1 )^{2}= 49+20 \sqrt[3]{6}.\]

In a right triangle $ABC$, the lengths of the legs satisfy the condition: $BC =\sqrt2 AC$. Prove that the medians $AN$ and $CM$ are perpendicular. (Hilko Danilo)

For each $n \in N$ let $S(n)$ be the sum of all numbers in the set {1,2,3,…,n} which are relatively prime to $n$. a. Show that $2S(n) $ is not aperfect square for any $n$. b. Given positive integers $m,n$ with odd n, show that the equation $2S(x)=y^n$ has at least one solution $(x,y)$ among positive integers such that $m|x$.

In a chess tournament each player played one match with every other player. It is known that all players have different scores. The player who is on the last place got $k$ points. What is the smallest number of wins that the first placed player got? (For the win $1$ point is given, for loss $0$ and for a draw both players get $0,5$ points.)

Let $ABC$ be a triangle, let its $A$-symmedian cross the circle $ABC$ again at $D$, and let $Q$ and $R$ be the feet of the perpendiculars from $D$ on the lines $AC$ and $AB$, respectively. Consider a variable point $X$ on the line $QR$, different from both $Q$ and $R$. The line through $X$ and perpendicular to $DX$ crosses the lines $AC$ and $AB$ at $V$ and $W$, respectively. Determine the geometric locus of the midpoint of the segment $VW$. [i]Adapted from American Mathematical Monthly[/i]

There is a piece on each square of the solitaire board shown except for the central square. A move can be made when there are three adjacent squares in a horizontal or vertical line with two adjacent squares occupied and the third square vacant. The move is to remove the two pieces from the occupied squares and to place a piece on the third square. (One can regard one of the pieces as hopping over the other and taking it.) Is it possible to end up with a single piece on the board, on the square marked $X$?

Prove that there do not exist $4$ points in the plane such that the distances between any pair of them is an odd integer.

Let $(a,b)=(a_n,a_{n+1}),\forall n\in\mathbb{N}$ all be positive interger solutions that satisfies $$1\leq a\leq b$$ and $$\dfrac{a^2+b^2+a+b+1}{ab}\in\mathbb{N}$$ And the value of $a_n$ is [b]only[/b] determined by the following recurrence relation:$ a_{n+2} = pa_{n+1} + qa_n + r$ Find $(p,q,r)$.

Let's call a function $f : R \to R$ [i]cool[/i] if there are real numbers $a$ and $b$ such that $f(x + a)$ is an even function and $f(x + b)$ is an odd function. (a) Prove that every cool function is periodic. (b) Give an example of a periodic function that is not cool.

Let $n$ be a positive integer. Prove that there exist integers $a_1, a_2,..., a_n$ such that for any integer $x$, the number $(... (((x^2 + a_1)^2 + a_2)^2 + ...)^2 + a_{n-1})^2 + a_n$ is divisible by $2n - 1$.

A license plate in a certain state consists of 4 digits, not necessarily distinct, and 2 letters, also not necessarily distinct. These six characters may appear in any order, except that the two letters must appear next to each other. How many distinct license plates are possible? $ \textbf{(A) } 10^4\cdot 26^2 \qquad \textbf{(B) } 10^3\cdot 26^3 \qquad \textbf{(C) } 5\cdot 10^4\cdot 26^2 \qquad \textbf{(D) } 10^2\cdot 26^4\\ \textbf{(E) } 5\cdot 10^3\cdot 26^3$

A square is drawn on a sheet of grid paper on the sides of the cells $ABCD$ with side $8$. Point $E$ is the midpoint of side $BC$, $Q$ is such a point on the diagonal $AC$ such that $AQ: QC = 3: 1$. Find the angle between straight lines $AE$ and $DQ$.

For $m$ and $n$ positive integers that are prime to each other, determine the possible values ​​of $$\gcd (5^m + 7^m, 5^n + 7^n)$$

To each pair $ (x, y)$ of distinct elements of a finite set $ X$ a number $ f(x, y)$ equal to 0 or 1 is assigned in such a way that $ f(x, y) \neq f(y, x)$ $ \forall x,y$ and $ x \neq y.$ Prove that exactly one of the following situations occurs: [b](i)[/b] $ X$ is the union of two disjoint nonempty subsets $ U, V$ such that $ f(u, v) \equal{} 1$ $ \forall u \in U, v \in V.$ [b](ii)[/b] The elements of $ X$ can be labeled $ x_1, \ldots , x_n$ so that \[ f(x_1, x_2) \equal{} f(x_2, x_3) \equal{} \cdots \equal{} f(x_{n\minus{}1}, x_n) \equal{} f(x_n, x_1) \equal{} 1.\] [i]Alternative formulation:[/i] In a tournament of n participants, each pair plays one game (no ties). Prove that exactly one of the following situations occurs: [b](i)[/b] The league can be partitioned into two nonempty groups such that each player in one of these groups has won against each player of the other. [b](ii)[/b] All participants can be ranked 1 through $ n$ so that $ i\minus{}$th player wins the game against the $ (i \plus{} 1)$st and the $ n\minus{}$th player wins against the first.

Show that a circle inscribed in a square has a larger perimeter than any other ellipse inscribed in the square.

There are three colleges in a town. Each college has $n$ students. Any student of any college knows $n+1$ students of the other two colleges. Prove that it is possible to choose a student from each of the three colleges so that all three students would know each other.

In base ten, the number $100! = 100 \cdot 99 \cdot 98 \cdot 97... 2 \cdot 1$ has $158$ digits, and the last $24$ digits are all zeros. Find the number of zeros there are at the end of this same number when it is written in base $24$.

In the acute-angled triangle $ABC$, let $M$ be the midpoint of the atlitude $h_b$ through $B$ and $N$ be the midpoint of the height $h_c$ through $C$. Further let $P$ be the intersection of $AM$ and $h_c$ and $Q$ be the intersection of $AN$ and $h_b$. Show that $M, N, P$ and $Q$ lie on a circle.

$f(k) = k + \left[ \frac{n}{k}\right ] $,$k \in \{1,2,..., n\}$, $k_0 =\left[ \sqrt{n} \right] + 1$. Prove that $f(k_0) < f(k)$ if $k \in \{1,2,..., n\}$

For a point $O$ inside a triangle $ABC$, denote by $A_1,B_1, C_1,$ the respective intersection points of $AO, BO, CO$ with the corresponding sides. Let \[n_1 =\frac{AO}{A_1O}, n_2 = \frac{BO}{B_1O}, n_3 = \frac{CO}{C_1O}.\] What possible values of $n_1, n_2, n_3$ can all be positive integers?

Call a fraction $\frac{a}{b}$, not necessarily in the simplest form [i]special[/i] if $a$ and $b$ are positive integers whose sum is $15$. How many distinct integers can be written as the sum of two, not necessarily different, special fractions? $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 13$

Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]