Let $\Gamma_1$ be a circle of radius $6$, and let $\Gamma_2$ be a circle of radius $1$. Next, let the circles be internally tangent at point $P$, and let $AP$ be a diameter of circle $\Gamma_1$. Finally, let $Y$ be a point on $\Gamma_2$ such that $AY$ is tangent to it. Compute the length of $PY$.

A positive integer $n$ is given. Consider all polynomials $P(x)=x^n+a_{n-1}x^{n-1}+\ldots+a_0$, whose coefficients are nonnegative integers, not exceeding $100$. Call $P$ [i]reducible[/i] if it can be factored into two non-constant polynomials with nonnegative integer coeffiecients, and [i]irreducible[/i] otherwise. Prove that the number of [i]irreducible[/i] polynomials is at least twice as big as the number of [i]reducible[/i] polynomials. [i]D. Zmiaikou[/i]

There are $n$ coins aligned in a row. In each step, it is allowed to choose a coin with the tail up (but not one of the outermost markers), remove it and reverse the closest coin to the left and the closest coin to the right of it. Initially, all the coins have tails up. Prove that one can achieve the state with only two coins remaining if and only if $n-1$ is not divisible by $3$.

The seven dwarves are at work on day when they find a large pile of diamonds. They want to split the diamonds evenly among them, but find that they would need to take away one diamond to split into seven equal piles. They are still arguing about this when they get home, so Snow White sends them to bed without supper. In the middle of the night, Sneezy wakes up and decides that he should get the extra diamond. So he puts one diamond aside, splits the remaining ones in to seven equal piles, and takes his pile along with the extra diamond. Then, he runs off with the diamonds. His sneeze wakes up Grumpy, who, thinking along the same lines, removes one diamond, divides the remainder into seven equal piles, and runs off. Finally, Sleepy, for the first time in his life, wakes up before sunrise and performs the same operation. When the remaining four dwarves arise, they find that the remaining diamonds can be split into $5$ equal piles. Doc suggests that Snow White should get a share, so they have no problem splitting the remaining diamonds. Happy, Dopey, Bashful, Doc, and Snow White live happily ever after. What’s the smallest possible number of diamonds that the dwarves could have started out with?

Let $A$ be a set of real numbers satisfying the following: (a) $\sqrt(n^2+1) \in A$ for all positive integers $n$, (b) if $x \in A$ and $y \in A$, then $x-y \in A$. Prove that every integer can be written as a product of two different elements in $A$.

Let $D$ be a point on the side $AC$ of triangle $ABC$. Let $E$ and $F$ be points on the segments $BD$ and $BC$ respectively, such that $\angle BAE = \angle CAF$. Let $P$ and $Q$ be points on the segments $BC$ and $BD$ respectively, such that $EP \parallel CD$ and $FQ \parallel CD$. Prove that $\angle BAP = \angle CAQ$.

Three points $A\left(0,\frac{4}{3}\right),B(-1,0),C(1,0)$ are given. The distance from $P$ to line $BC$ is the geometric mean of that from $P$ to lines $AB$ and $AC$. [b](a)[/b] Find the path equation of point $P$. [b](b)[/b] If line $L$ passes $D$ ($D$ is the incenter of $\triangle ABC$ ), and it has three common points with the path of $P$, find the range value of slope $k$ of line $L$.

Extension of angle bisector $BL$ of the triangle $ABC$ (where $AB < BC$) meets its circumcircle at $N$. Let $M$ be the midpoint of $BL$. Isosceles triangle $BDC$ with base $BC$ and angle equal to $ABC$ at $D$ is constructed outside the triangle $ABC$. Prove that $CM \perp DN$. [i]Proposed by А. Mardanov[/i]

Prove that: (1) There are infinitely many positive integers $n$ such that the largest prime factor of $n^2+1$ is less than $n.$ (2) There are infinitely many positive integers $n$ such that $n^2+1$ divides $n!$.

A rectangle of paper of $3$ cm by $9$ cm is folded along a straight line, making two opposite vertices coincide. In this way a pentagon is formed. Calculate it's area.

Find the number of positive integer $x$ that has $ {a}_{1},{a}_{2},\cdot \cdot \cdot {a}_{20} $ which follows the following ($x \ge 1000$) 1) $ {a}_{1}=2, {a}_{2}=1, {a}_{3}=x $ 2) for positive integer $n$, ($ 4 \le n \le 20 $), $ {a}_{n}={a}_{n-3}+\frac{(-2)^n}{{a}_{n-1}{a}_{n-2}} $

Let $ABCD$ be a trapezium, $AD\parallel BC$, and let $E,F$ be points on the sides$AB$ and $CD$, respectively. The circumcircle of $AEF$ meets $AD$ again at $A_1$, and the circumcircle of $CEF$ meets $BC$ again at $C_1$. Prove that $A_1C_1,BD,EF$ are concurrent.

If $m\geq 2$ show that there does not exist positive integers $x_1, x_2, ..., x_m,$ such that \[x_1< x_2<...< x_m \ \ \text{and} \ \ \frac{1}{x_1^3}+\frac{1}{x_2^3}+...+\frac{1}{x_m^3}=1.\]

Find two disjoint sets $N_1$ and $N_2$ with $N_1\cup N_2=\mathbb N$, so that neither set contains an infinite arithmetic progression.

The front row of a movie theatre contains $45$ seats. [list] [*] (a) If $42$ people are sitting in the front row, prove that there are $10$ consecutive seats that are all occupied. [*] (b) Show that this conclusion doesn’t necessarily hold if only $41$ people are sitting in the front row.[/list]

Let $ABC$ be a triangle and let $D$ be a point on the segment $BC, D\neq B$ and $D\neq C$. The circle $ABD$ meets the segment $AC$ again at an interior point $E$. The circle $ACD$ meets the segment $AB$ again at an interior point $F$. Let $A'$ be the reflection of $A$ in the line $BC$. The lines $A'C$ and $DE$ meet at $P$, and the lines $A'B$ and $DF$ meet at $Q$. Prove that the lines $AD, BP$ and $CQ$ are concurrent (or all parallel).

Prove that the sequence of the first digits of the numbers in the form $2^n+3^n$ is nonperiodic.

Let be a natural number $ n. $ Solve in the set of $ 2\times 2 $ complex matrices the equation $$ \begin{pmatrix} -2& 2007\\ 0&-2 \end{pmatrix} =X^{3n}-3X^n. $$ [i]Petru Vlad[/i]

Given a positive integer $n$, a collection $\mathcal{S}$ of $n-2$ unordered triples of integers in $\{1,2,\ldots,n\}$ is [i]$n$-admissible[/i] if for each $1 \leq k \leq n - 2$ and each choice of $k$ distinct $A_1, A_2, \ldots, A_k \in \mathcal{S}$ we have $$ \left|A_1 \cup A_2 \cup \cdots A_k \right| \geq k+2.$$ Is it true that for all $n > 3$ and for each $n$-admissible collection $\mathcal{S}$, there exist pairwise distinct points $P_1, \ldots , P_n$ in the plane such that the angles of the triangle $P_iP_jP_k$ are all less than $61^{\circ}$ for any triple $\{i, j, k\}$ in $\mathcal{S}$? [i]Ivan Frolov, Russia[/i]

How many dominoes can be placed on a at least $3 \times 12$ board, such so that it is impossible to place a $1\times 3$, $3 \times 1$, or $ 2 \times 2$ tile on what remains of the board? Clarification: Each domino covers exactly two squares on the board. The chips cannot overlap.

When $1^0 + 2^1 + 3^2 + ...+ 100^{99}$ is divided by $5$, a remainder of $N$ is obtained such that $N$ is between $0$ and $4$ inclusive. Find $N$. [i](.1 point)[/i]

Problem 6. Let H be orthocenter of an acute-angled triangle ABC. Points E,F are on the segments AB,AC respectively, such that BE=BH,CF=CH. The lines EH,FH meet BC in X,Y respectively. Draw the perpendicular HZ from H to EF. Prove that the circumcircle of triangle XYZ is tangent to the circle with diameter BC.

$20$ players are playing in a Super Mario Smash Bros. Melee tournament. They are ranked $1-20$, and player $n$ will always beat player $m$ if $n<m$. Out of all possible tournaments where each player plays $18$ distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.

Prove that $n + \big[ (\sqrt{2} + 1)^n\big] $ is odd for all positive integers $n$. $\big[ x \big]$ denotes the greatest integer function.

Let $P$ and $Q$ be points inside triangle $ABC$ satisfying $\angle PAC=\angle QAB$ and $\angle PBC=\angle QBA$. a) Prove that feet of perpendiculars from $P$ and $Q$ on the sides of triangle $ABC$ are concyclic. b) Let $D$ and $E$ be feet of perpendiculars from $P$ on the lines $BC$ and $AC$ and $F$ foot of perpendicular from $Q$ on $AB$. Let $M$ be intersection point of $DE$ and $AB$. Prove that $MP\bot CF$.