The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

Find a positive integer $n$ such that there is a polygon with $n$ sides where each of its interior angles measures $177^o$

Three chords $AB, CD$ and $EF$ of a circle intersect at the midpoint $M$ of $AB$. Show that if $CE$ produced and $DF$ produced meet the line $AB$ at the points $P$ and $Q$ respectively, then $M$ is also the midpoint of $PQ$.

[b]Every side and diagonal of a regular octagon is color with red or black. Show that there is at least seven triangles whose vertices are vertices of the octagon and its three sides are of the same color.[/b]

Let $ABCDEF$ be a hexagon. Sides and diagonals of hexagon are colored in two colors: blue and yellow. Prove that there exist a triangle with vertices from set $\{A,B,C,D,E,F\}$ which sides are all same colour

Let $a\in\left[ \tfrac{1}{2},\ \tfrac{3}{2}\right]$ be a real number. Sequences $(u_n),\ (v_n)$ are defined as follows: $$u_n=\frac{3}{2^{n+1}}\cdot (-1)^{\lfloor2^{n+1}a\rfloor},\ v_n=\frac{3}{2^{n+1}}\cdot (-1)^{n+\lfloor 2^{n+1}a\rfloor}.$$ a. Prove that $${{({{u}_{0}}+{{u}_{1}}+\cdots +{{u}_{2018}})}^{2}}+{{({{v}_{0}}+{{v}_{1}}+\cdots +{{v}_{2018}})}^{2}}\le 72{{a}^{2}}-48a+10+\frac{2}{{{4}^{2019}}}.$$ b. Find all values of $a$ in the equality case.

The sequence $a_1,a_2, ..., a_{2n}$ of integers is such that each number occurs in no more than $n$ times. Prove that there are two strictly increasing sequences of indices $b_1,b_2, ..., b_{n}$ and $c_1,c_2, ..., c_{n}$ are such that every positive integer from the set $\{1,2,...,2n\}$ occurs exactly in one of these two sequences, and for each $1\le i \le n$ is true the condition $a_{b_i} \ne a_{c_i}$ . (Anton Trygub)

A positive proper divisor is a positive divisor of a number, excluding itself. For positive integers $n \ge 2$, let $f(n)$ denote the number that is one more than the largest proper divisor of $n$. Determine all positive integers $n$ such that $f(f(n)) = 2$.

A positive integer $k$ is given. Initially, $N$ cells are marked on an infinite checkered plane. We say that the cross of a cell $A$ is the set of all cells lying in the same row or in the same column as $A$. By a turn, it is allowed to mark an unmarked cell $A$ if the cross of $A$ contains at least $k$ marked cells. It appears that every cell can be marked in a sequence of such turns. Determine the smallest possible value of $N$.

Consider $\triangle \natural\flat\sharp$. Let $\flat\sharp$, $\sharp\natural$ and $\natural\flat$ be the answers to problems $4$, $5$, and $6$, respectively. If the incircle of $\triangle \natural\flat\sharp$ touches $\natural\flat$ at $\odot$, find $\flat\odot$. [i]Proposed by Evan Chen[/i]

Find all the pairs of real numbers $(x,y)$ that are solutions of the system: $(x^{2}+y^{2})^{2}-xy(x+y)^{2}=19 $ $| x - y | = 1$

Three mutually perpendicular rays $O_x,O_y,O_z$ and three points $A,B,C$ on $O_x,O_y,O_z$, respectively. A variable sphere є through $A, B,C$ meets $O_x,O_y,O_z$ again at $A', B',C'$, respectively. Let $M$ and $M'$ be the centroids of triangles $ABC$ and $A'B'C'$. Find the locus of the midpoint of $MM'$.

Let $T_1$ be a triangle having $a, b, c$ as lengths of its sides and let $T_2$ be another triangle having $u, v,w$ as lengths of its sides. If $P,Q$ are the areas of the two triangles, prove that \[16PQ \leq a^2(-u^2 + v^2 + w^2) + b^2(u^2 - v^2 + w^2) + c^2(u^2 + v^2 - w^2).\] When does equality hold?

Prove that $ a < b$ implies that $ a^3 \minus{} 3a \leq b^3 \minus{} 3b \plus{} 4.$ When does equality occur?

Let $f$ and $g$ be two nonzero polynomials with integer coefficients and $\deg f>\deg g$. Suppose that for infinitely many primes $p$ the polynomial $pf+g$ has a rational root. Prove that $f$ has a rational root.

For a positive integer $n$, let $\phi(n)$ denote the number of positive integers between $1$ and $n$, inclusive, which are relatively prime to $n$. We say that a positive integer $k$ is total if $k=\frac n{\phi(n)}$, for some positive integer $n$. Find all total numbers.

What is the smallest possible value of the least common multiple of $a, b, c, d$ if we know that these four numbers are distinct and $a + b + c + d = 1000$?

Kayla rolls four fair $6$-sided dice. What is the probability that at least one of the numbers Kayla rolls is greater than $4$ and at least two of the numbers she rolls are greater than $2$? $\textbf{(A)}\frac{2}{3}~\textbf{(B)}\frac{19}{27}~\textbf{(C)}\frac{59}{81}~\textbf{(D)}\frac{61}{81}~\textbf{(E)}\frac{7}{9}$

Find maximal numbers of planes, such there are $6$ points and 1) $4$ or more points lies on every plane. 2) No one line passes through $4$ points.

$f(x)$ is a quartic polynomial with a leading coefficient $1$ where $f(2)=4$, $f(3)=9$, $f(4)=16$, and $f(5)=25$. Compute $f(8)$.

In tetrahedron $ ABCD$, radius four circumcircles of four faces are equal. Prove that $ AB\equal{}CD$, $ AC\equal{}BD$ and $ AD\equal{}BC$.

Given positive integers $k, m, n$ such that $1 \leq k \leq m \leq n$. Evaluate \[\sum^{n}_{i=0} \frac{(-1)^i}{n+k+i} \cdot \frac{(m+n+i)!}{i!(n-i)!(m+i)!}.\]

On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.

In how many different ways can you write $2016$ as the sum of a sequence of consecutive natural numbers?

Find largest possible constant $M$ such that, for any sequence $a_n$, $n=0,1,2,...$ of real numbers, that satisfies the conditions : i) $a_0=1$, $a_1=3$ ii) $a_0+a_1+...+a_{n-1} \ge 3 a_n - a_{n+1}$ for any integer $n\ge 1$ to be true that $$\frac{a_{n+1}}{a_n} >M$$ for any integer $n\ge 0$.