The increasing sequence of positive integers $a_{1},a_{2},a_{3},\ldots$ has the property that $a_{n+2} = a_{n} + a_{n+1}$ for all $n \ge 1$. If $a_{7} = 120$, then $a_{8}$ is $ \textbf{(A)}\ 128\qquad\textbf{(B)}\ 168\qquad\textbf{(C)}\ 193\qquad\textbf{(D)}\ 194\qquad\textbf{(E)}\ 210 $

Show that there exist infinitely many integers that cannot be written as the difference between two perfect squares.

On the bisector $AL$ of triangle $ABC$ a point $K$ is chosen such that $\angle BKL=\angle KBL=30^{\circ}$. Lines $AB$ and $CK$ intersect at point $M$, lines $AC$ and $BK$ intersect at point $N$. FInd the measure of angle $\angle AMN$ [I]Proposed by D. Shiryaev, S. Berlov[/i]

Consider increasing integer sequences with elements from $1,\ldots,10^6$. Such a sequence is [i]Adriatic[/i] if its first element equals 1 and if every element is at least twice the preceding element. A sequence is [i]Tyrrhenian[/i] if its final element equals $10^6$ and if every element is strictly greater than the sum of all preceding elements. Decide whether the number of Adriatic sequences is smaller than, equal to, or greater than the number of Tyrrhenian sequences. (Proposed by Gerhard Woeginger, Austria)

Can $29$ boys and $31$ girls be lined up holding hands so no one is holding hands with two girls?

Compute: \[\lim_{x\to 0}\text{ }\dfrac{x^2}{1-\cos(x)}\]

For a positive integer $n$ and nonzero digits $a$, $b$, and $c$, let $A_n$ be the $n$-digit integer each of whose digits is equal to $a$; let $B_n$ be the $n$-digit integer each of whose digits is equal to $b$, and let $C_n$ be the $2n$-digit (not $n$-digit) integer each of whose digits is equal to $c$. What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$? $\textbf{(A)} \text{ 12} \qquad \textbf{(B)} \text{ 14} \qquad \textbf{(C)} \text{ 16} \qquad \textbf{(D)} \text{ 18} \qquad \textbf{(E)} \text{ 20}$

Compute the infinite sum $\frac{1^3}{2^1}+\frac{2^3}{2^2}+\frac{3^3}{2^3}+\dots+\frac{n^3}{2^n}+\dots.$

There are $12$ candies on the table, four of which are rare candies. Chad has a friend who can tell rare candies apart from regular candies, but Chad can’t. Chad’s friend is allowed to take four candies from the table, but may not take any rare candies. Can his friend always take four candies in such a way that Chad will then be able to identify the four rare candies? If so, describe a strategy. If not, prove that it cannot be done. Note that Chad does not know anything about how the candies were selected (e.g. the order in which they were selected). However, Chad and his friend may communicate beforehand.

Consider several tokens of various colors and sizes, so that there are no two tokens having the same color and the same size. Two numbers are written on each token $J$: one of them is the number of chips having the same color as $J$, but different size, and the other is the number of chips having the same size as $J$, but a different color. It is known that each of the numbers $0, 1, ..., 100$ is written at least once. For what numbers of tokens is this possible?

Several knights are arranged on an infinite chessboard. No square is attacked by more than one knight (in particular, a square occupied by a knight can be attacked by one knight but not by two). Sasha outlined a $ 14\times 16$ rectangle. What maximum number of knights can this rectangle contain?

In a trick tournament $2k$ people sign up. All possible matches are played with the condition that in each match, each of the four players knows his partner and does not know any of his two opponents. Determine the maximum number of matches that can be in such a tournament.

Let the [i]square decomposition[/i] of a number be defined as the sequence of numbers given by the following algorithm. Given a positive integer $n$, add the largest possible perfect square that is less than or equal to $n$ to a sequence, and then subtract that number from $n$. Repeat as many times as necessary until your current $n$ is $0$. So for example, the square decomposition of $60$ would be $49, 9, 1, 1$. Define the size of a square decomposition to be the number of numbers in the sequence. Say that the maximal size of a square decomposition of a number in the range $[1, 2020]$ is $m$. Find the largest number in the range $[1, 2020]$ that has a square decomposition of size $m$. [i]Proposed by Timothy Qian[/i]

Determine the integers $n\geqslant 2$ for which the equation $x^2-\hat{3}\cdot x+\hat{5}=\hat{0}$ has a unique solution in $(\mathbb{Z}_n,+,\cdot).$

The triangle $ ABC$ has vertices in such manner that $ AB \equal{} 3, BC \equal{} 4,$ and $ AC \equal{} 5$. The inscribed circle is tangent to $ AB$ in $ C'$, $ BC$ in $ A'$ and $ AC$ in $ B'.$ What is the ratio between the area of the triangles $ A'B'C'$ and $ ABC$? A. 1/4 B. 1/5 C. 2/9 D. 4/21 E. 5/24

Let $ABC$ be an equilateral triangle. Let $Q$ be a random point on $BC$, and let $P$ be the meeting point of $AQ$ and the circumscribed circle of $\triangle ABC$. Prove that $\frac{1}{PQ}=\frac{1}{PB}+\frac{1}{PC}$.

Let $A\in M_2(\mathbb Q)$ such that there is $n\in\mathbb N,n\ne0$, with $A^n=-I_2$. Prove that either $A^2=-I_2$ or $A^3=-I_2$.

The point $X$ is marked inside the triangle $ABC$. The circumcircles of the triangles $AXB$ and $AXC$ intersect the side $BC$ again at $D$ and $E$ respectively. The line $DX$ intersects the side $AC$ at $K$, and the line $EX$ intersects the side $AB$ at $L$. Prove that $LK\parallel BC$.

Given a triangle $ABC$ with $\angle C = 90^o$. a) Construct the circle with center $C$, so that one of the tangents from $A$ to that circle is parallel to one of the tangents from $B$ to that circle. b) A circle with center $C$ has two parallel tangents passing through A and go respectively. If $AC = b$ and $BC = a$, express the radius of the circle in terms of $a$ and $b$.

How many integer values of $x$ satisfy \[\dfrac32 < \dfrac9x < \dfrac 73?\] $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

There are 2016 points near a line such that the distance from each point to the line is less than 1 cm, and the distance between any two points is always greater than 2 cm. Prove that there exist two points whose distance is at least 17 meters.

Solve the equation \[ x^3+2y^3-4x-5y+z^2=2012, \] in the set of integers.

Find all odd positive integers $ n > 1$ such that if $ a$ and $ b$ are relatively prime divisors of $ n$, then $ a\plus{}b\minus{}1$ divides $ n$.

Given two positives integers $m$ and $n$, prove that there exists a positive integer $k$ and a set $S$ of at least $m$ multiples of $n$ such that the numbers $\frac {2^k{\sigma({s})}} {s}$ are odd for every $s \in S$. $\sigma({s})$ is the sum of all positive integers of $s$ (1 and $s$ included).

Find all primes $p,q$ and even $n>2$ such that $p^n+p^{n-1}+...+1=q^2+q+1$.