Define Fibonacci sequence $\{F\}_{n=0}^{\infty}$ as $F_0 = 0, F_1 = 1$ and $F_{n+1} = F_n +F_{n-1}$ for every integer $n > 1$. Determine all quadruples $(a, b, c,n)$ of positive integers with a $< b < c$ such that each of $a, b,c,a + n, b + n,c + 2n$ is a term of the Fibonacci sequence.

Let $k$, $a$, and $b$, be fixed integers such that $0 \le a < k$, $0 \le b < k+1$, and $a$, $b$ are not both zero. The sequence $\{T_n\}_{n \ge k}$ satisfies $T_n = T_{n-1}+T_{n-2} \pmod{n}$, $0 \le T_n < n$, $T_k = a$, and $T_{k+1} = b$. Let the decimal expression of $T_n$ form a sequence $x=\overline{0.T_kT_{k+1} \dots}$. For instance, when $k = 66, a = 5, b = 20$, we get $T_{66}=5$, $T_{67}=20$, $T_{68}=25$, $T_{69}=45$, $T_{70}=0$, $T_{71}=45, \dots$, and thus $x=0.522545045 \dots$. Prove that $x$ is irrational.

An infinite sequence $(a_0,a_1,a_2,\dots)$ of positive integers is called a $\emph{ribbon}$ if the sum of any eight consecutive terms is at most $16$; that is, for all $i\ge0$, \[a_i+a_{i+1}+\dots+a_{i+7}\le16.\]A positive integer $m$ is called a $\emph{cut size}$ if every ribbon contains a set of consecutive elements that sum to $m$; that is, given any ribbon $(a_0,a_1,a_2,\dots)$, there exist nonnegative integers $k\le l$ such that \[a_k+a_{k+1}+\dots+a_l=m.\]Find, with proof, all cut sizes, or prove that none exist.

Arutyun and Amayak show another effective trick. A spectator writes down on a board a sequence of $N$ (decimal) digits. Amayak closes two adjacent digits by a black disc. Then Arutyun comes and says both closed digits (and their order). For which minimal $N$ they may show such a trick? [i]K. Knop, O. Leontieva[/i]

There is no sequence $x_n$ strictly increasing with terms natural numbers such that : $$ x_n+x_{k}=x_{nk}, \ \ for \, any \,\,\, n, k \in \mathbb{N}^*$$

Given a number $k\in \mathbb{N}$. $\{a_{n}\}_{n\geq 0}$ and $\{b_{n}\}_{n\geq 0}$ are two sequences of positive integers that $a_{i},b_{i}\in \{1,2,\cdots,9\}$. For all $n\geq 0$ $$\left.\overline{a_{n}\cdots a_{1}a_{0}}+k \ \middle| \ \overline{b_{n}\cdots b_{1}b_{0}}+k \right. .$$ Prove that there is a number $1\leq t \leq 9$ and $N\in \mathbb{N}$ such that $b_n=ta_n$ for all $n\geq N$.\\ (Note that $(\overline{x_nx_{n-1}\dots x_0}) = 10^n\times x_n + \dots + 10\times x_1 + x_0$)

A sequence of integers $a_1,a_2,\ldots $ is defined by $a_1=1,a_2=2$ and for $n\geq 1$, $$a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. $$ (a) Prove that the sequence contains infinitely many positive terms and infinitely many negative terms. (b) Prove that no term of the sequence is zero. (c) Show that if $n = 2^k - 1$ for $k\geq 2$, then $a_n$ is divisible by $7$.

A function $f: R \to R$ satisfies $f (x + 1) = f (x) + 1$ for all $x$. Given $a \in R$, define the sequence $(x_n)$ recursively by $x_0 = a$ and $x_{n+1} = f (x_n)$ for $n \ge 0$. Suppose that, for some positive integer m, the difference $x_m - x_0 = k$ is an integer. Prove that the limit $\lim_{n\to \infty}\frac{x_n}{n}$ exists and determine its value.

Find a positive integer $x$, with $x> 1$ such that all numbers in the sequence $$x + 1,x^x + 1,x^{x^x}+1,...$$ are divisible by $2009.$

[b]p1.[/b] Nine coins are placed in a row, alternating between heads and tails as follows: $H T H T H T H T H$. A legal move consists of turning over any two adjacent coins. (a) Give a sequence of legal moves that changes the configuration into $H H H H H H H H H$. (b) Prove that there is no sequence of legal moves that changes the original configuration into $T T T T T T T T T$. [b]p2.[/b] Find (with proof) all integers $k $that satisfy the equation $$\frac{k - 15}{2000}+\frac{k - 12}{2003}+\frac{k - 9}{2006}+\frac{k - 6}{2009}+\frac{k - 3}{2012} = \frac{k - 2000}{15}+\frac{k - 2003}{12}+\frac{k - 2006}{9}+\frac{k - 2009}{6}+\frac{k - 2012}{3}.$$ [b]p3.[/b] Some (not necessarily distinct) natural numbers from $1$ to $2015$ are written on $2015$ lottery tickets, with exactly one number written on each ticket. It is known that the sum of the numbers on any nonempty subset of tickets (including the set of all tickets) is not divisible by $2016$. Prove that the same number is written on all of the tickets. [b]p4.[/b] A set of points $A$ is called distance-distinct if every pair of points in $A$ has a different distance. (a) Show that for all infinite sets of points $B$ on the real line, there exists an infinite distance-distinct set A contained in $B$. (b) Show that for all infinite sets of points $B$ on the real plane, there exists an infinite distance-distinct set A contained in $B$. [b]p5.[/b] Let $ABCD$ be a (not necessarily regular) tetrahedron and consider six points $E, F, G, H, I, J$ on its edges $AB$, $BC$, $AC$, $AD$, $BD$, $CD$, respectively, such that $$|AE| \cdot |EB| = |BF| \cdot |FC| = |AG| \cdot |GC| = |AH| \cdot |HD| = |BI| \cdot |ID| = |CJ| \cdot |JD|.$$ Prove that the points $E, F, G, H, I$, and $J$ lie on the surface of a sphere. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a text editor program, initially there is a footprint symbol (L) that we want to multiply. Unfortunately, our computer has been the victim of a hacker attack, and only two functions are working: Copy and Paste, each costing 1 Dürer dollar to use. Using the Copy function, we can select one or more consecutive symbols from the existing ones, and the computer memorizes their number. When using the Paste function, the computer adds as many new footprint symbols to the sequence as were selected in the last Copy. If no Copy has been done yet, Paste cannot be used. Let $D(n)$ denote the minimum number of Dürer dollars required to obtain exactly $n$ footprint symbols. Prove that for any positive integer $k$, there exists a positive integer $N$ such that \[D(N)=D(N+1)+1=D(N+2)=D(N+3)+1=D(N+4)=\ldots=D(N+2k-1)+1=D(N+2k).\] [i]Based on a problem of the Dürer Competition[/i]

Define $\{p_n\}_{n=0}^\infty\subset\mathbb N$ and $\{q_n\}_{n=0}^\infty\subset\mathbb N$ to be sequences of natural numbers as follows: [list] [*]$p_0=q_0=1$; [*]For all $n\in\mathbb N$, $q_n$ is the smallest natural number such that there exists a natural number $p_n$ with $\gcd(p_n,q_n)=1$ satisfying \[\dfrac{p_{n-1}}{q_{n-1}} < \dfrac{p_n}{q_n} < \sqrt 2.\] [/list] Find $q_3$.

An illusionist and his assistant are about to perform the following magic trick. Let $k$ be a positive integer. A spectator is given $n=k!+k-1$ balls numbered $1,2,…,n$. Unseen by the illusionist, the spectator arranges the balls into a sequence as he sees fit. The assistant studies the sequence, chooses some block of $k$ consecutive balls, and covers them under her scarf. Then the illusionist looks at the newly obscured sequence and guesses the precise order of the $k$ balls he does not see. Devise a strategy for the illusionist and the assistant to follow so that the trick always works. (The strategy needs to be constructed explicitly. For instance, it should be possible to implement the strategy, as described by the solver, in the form of a computer program that takes $k$ and the obscured sequence as input and then runs in time polynomial in $n$. A mere proof that an appropriate strategy exists does not qualify as a complete solution.)

Prove that if three prime numbers form an arithmetic progression whose difference is not divisible by 6, then the smallest of these numbers is $3 $.

Let $P(x) \in \mathbb{Q}[x]$ be a polynomial with rational coefficients and degree $d\ge 2$. Prove there is no infinite sequence $a_0, a_1, \ldots$ of rational numbers such that $P(a_i)=a_{i-1}+i$ for all $i\ge 1$. [i]Proposed by Pranjal Srivastava and Rohan Goyal[/i]