The sequence $(a_n)_{n\geq1}$ is defined as: $$a_1=2, a_2=20, a_3=56, a_{n+3}=7a_{n+2}-11a_{n+1}+5a_n-3\cdot2^n.$$ Prove that $a_n$ is positive for every positive integer $n{}$. Find the remainder of the divison of $a_{673}$ to $673$.

Let $1<a_{1}<a_{2}<\cdots$ be a sequence of positive integers. Show that \[\frac{2^{a_{1}}}{{a_{1}}!}+\frac{2^{a_{2}}}{{a_{2}}!}+\frac{2^{a_{3}}}{{a_{3}}!}+\cdots\] is irrational.

Consider the sequence $1, \dfrac12 , \dfrac13 , \ldots$. Show that every positive rational number can be written as a finite sum of different terms in this sequence.

[b]1.[/b] Let $a_{1}, a_{2}, \dots , a_{n}$ and $b_{1}, b_{2}, \dots , b_{m}$ be $n+m$ unit vectors in the $r$-dimensional Euclidean space $E_{r} (n,m \leq r)$; let $a_{1}, a_{2}, \dots , a_{n}$ as well as $b_{1}, b_{2}, \dots , b_{m}$ be mutually orthogonal. For any vector $x \in E_{r}$, consider $Tx= \sum_{i=1}^{n}\sum_{k=1}^{m}(x,a_{i})(a_{i},b_{k})b_{k}$ ($(a,b)$ denotes the scalar product of $a$ and $b$). Show that the sequence $(T^{k}x)^{\infty}_{ k =0}$, where $T^{0} x= x$ and $T^{k} x = T(T^{k-1}x)$, is convergent and give a geometrical characterization of how the limit depends on $x$. [b](S. 14)[/b]

The angles in a particular triangle are in arithmetic progression, and the side lengths are $4,5,x$. The sum of the possible values of $x$ equals $a+\sqrt{b}+\sqrt{c}$ where $a, b$, and $c$ are positive integers. What is $a+b+c$? $ \textbf{(A)}\ 36\qquad\textbf{(B)}\ 38\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 42\qquad\textbf{(E)}\ 44$

In a sequence of natural numbers, the first number is $a$, and each subsequent number is the smallest number coprime to all the previous ones and greater than all of them. Prove that in this sequence from some place all numbers will be primes.

Let $f: \mathbb{R}\rightarrow ]0,+\infty[$ be an increasing differentiable function with $\lim_{x\rightarrow+\infty}f(x)=+\infty$ and $f'$ is bounded, and let $F(x)=\int^x_0 f(t) dt$. Define the sequence $(a_n)$ recursively by $a_0=1,a_{n+1}=a_n+\frac1{f(a_n)}$ Define the sequence $(b_n)$ by $b_n=F^{-1}(n)$. Prove that $\lim_{x\rightarrow+\infty}(a_n-b_n)=0$.

The positive integers $a_0, a_1, a_2, \ldots, a_{3030}$ satisfy $$2a_{n + 2} = a_{n + 1} + 4a_n \text{ for } n = 0, 1, 2, \ldots, 3028.$$ Prove that at least one of the numbers $a_0, a_1, a_2, \ldots, a_{3030}$ is divisible by $2^{2020}$.

Define a sequence $\{a_i\}$ by $a_1=3$ and $a_{i+1}=3^{a_i}$ for $i\geq 1$. Which integers between $00$ and $99$ inclusive occur as the last two digits in the decimal expansion of infinitely many $a_i$?

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

The sequence $\{a_{n}\}_{n\geq 0}$ is defined by $a_{0}=20,a_{1}=100,a_{n+2}=4a_{n+1}+5a_{n}+20(n=0,1,2,...)$. Find the smallest positive integer $h$ satisfying $1998|a_{n+h}-a_{n}\forall n=0,1,2,...$

An increasing arithmetic progression consists of one hundred positive integers. Is it possible that every two of them are relatively prime?

[u]Round 5[/u] [b]p13.[/b] Given that $x^3 + y^3 = 208$ and $x + y = 4$, what is the value of $\frac{1}{x} +\frac{1}{y}$? [b]p14.[/b] Find the sum of all three-digit integers $n$ such that the value of $n$ is equal to the sum of the factorials of $n$’s digits. [b]p15.[/b] Three christmas lights are initially off. The Grinch decides to fiddle around with the lights, switching one of the lights each second. He wishes to get every possible combination of lights. After how many seconds can the Grinch complete his task? [u]Round 6[/u] [b]p16.[/b] A regular tetrahedron of side length $1$ has four similar tetrahedrons of side length $1/2$ chopped off, one from each of the four vertices. What is the sum of the numbers of vertices, edges, and faces of the remaining solid? [b]p17.[/b] Mario serves a pie in the shape of a regular $2013$-gon. To make each slice, he must cut in a straight line starting from one vertex and ending at another vertex of the pie. Every vertex of a slice must be a vertex of the original $2013$-gon. If every person eats at least one slice of pie regardless of the size, what is the maximum number of people the $2013$-gon pie can feed? [b]p18.[/b] Find the largest integer $x$ such that $x^2 + 1$ divides $x^3 + x - 1000$. [u]Round 7[/u] [b]p19.[/b] In $\vartriangle ABC$, $\angle B = 87^o$, $\angle C = 29^o$, and $AC = 37$. The perpendicular bisector of $\overline{BC}$ meets $\overline{AC}$ at point $T$. What is the value of $AB + BT$? [b]p20.[/b] Consider the sequence $f(1) = 1$, $f(2) = \frac12$ ,$ f(3) =\frac{1+3}{2}$, $f(4) =\frac{ 1+3}{2+4}$ ,$ f(5) = \frac{ 1+3+5}{2+4} . . . $ What is the minimum value of $n$, with $n > 1$, such that $|f(n) - 1| \le \frac{1}{10 }$. [b]p21.[/b] Three unit circles are centered at $(0, 0)$,$(0, 2)$, and $(2, 0)$. A line is drawn passing through $(0, 1)$ such that the region inside the circles and above the line has the same area as the region inside the circles and below the line. What is the equation of this line in $y = mx + b$ form? [u]Round 8[/u] [b]p22.[/b] The two walls of a pinball machine are positioned at a $45$ degree angle to each other. A pinball, represented by a point, is fired at a wall (but not at the intersection of the two walls). What is the maximum number of times the ball can bounce off the walls? [b]p23.[/b] Albert is fooling people with his weighted coin at a carnival. He asks his guests to guess how many times heads will show up if he flips the coin $4$ times. Richard decides to play the game and guesses that heads will show up $2$ times. In the previous game, Zach guessed that the heads would show up 3 times. In Zach’s game, there were least 3 heads, and given this information, Zach had a $\frac49$ chance of winning. What is the probability that Richard guessescorrectly? [b]p24.[/b] Let $S$ be the set of all positive integers relatively prime to $2013$ that have no prime factor greater than $15$. Find the sum of the reciprocals of all of the elements of $S$. PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134546p28406927]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3137069p28442224]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given the function $f(x) = x^2$, the sector of $f$ from $a$ to $b$ is defined as the limited region between the graph of $y = f(x)$ and the straight line segment that joins the points $(a, f(a))$ and $(b, f(b))$. Define the increasing sequence $x_0$, $x_1, \cdots$ with $x_0 = 0$ and $x_1 = 1$, such that the area of the sector of $f$ from $x_n$ to $x_{n+1}$ is constant for $n \geq 0$. Determine the value of $x_n$ in function of $n$.