Let $(a_n)^{\infty}_{n =1}$ be a sequence of positive integers with $a_1 < a_2 < a_3 < ...$ , and for n = 1, 2, 3,..., $$a_{2n} = a_n + n.$$ Furthermore, whenever $n$ is prime, so is $a_n$. Prove that $a_n = n$.

Consider the set $ M = \{1,2, \ldots ,2008\}$. Paint every number in the set $ M$ with one of the three colors blue, yellow, red such that each color is utilized to paint at least one number. Define two sets: $ S_1=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have the same color and }2008 | (x + y + z)\}$; $ S_2=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have three pairwisely different colors and }2008 | (x + y + z)\}$. Prove that $ 2|S_1| > |S_2|$ (where $ |X|$ denotes the number of elements in a set $ X$).

Provided the equation $xyz = p^n(x + y + z)$ where $p \geq 3$ is a prime and $n \in \mathbb{N}$. Prove that the equation has at least $3n + 3$ different solutions $(x,y,z)$ with natural numbers $x,y,z$ and $x < y < z$. Prove the same for $p > 3$ being an odd integer.

Let $(a_n)_{n \geq 0}$ be the sequence of integers defined recursively by $a_0 = 0, a_1 = 1, a_{n+2} = 4a_{n+1} + a_n$ for $n \geq 0.$ Find the common divisors of $a_{1986}$ and $a_{6891}.$

Let $ f_1,f_2,\dots,f_n$ be regular functions on a domain of the complex plane, linearly independent over the complex field. Prove that the functions $ f_i\overline{f}_k, \;1 \leq i,k \leq n$, are also linearly independent. [i]L. Lempert[/i]

Find all positive real solutions $(a, b, c)$ to the following system: $$ \begin{aligned} a^2 + \frac{b}{a} &= 8, \\ ab + c^2 &= 18, \\ 3a + b + c &= 9\sqrt{3}. \end{aligned} $$

Suppose $x$ and $y$ are real numbers which satisfy the system of equations \[x^2-3y^2=\frac{17}x\qquad\text{and}\qquad 3x^2-y^2=\frac{23}y.\] Then $x^2+y^2$ can be written in the form $\sqrt[m]{n}$, where $m$ and $n$ are positive integers and $m$ is as small as possible. Find $m+n$.

Let $f:[-1,1]\to\mathbb{R}$ be a continuous function such that (i) $f(x)=\frac{2-x^2}{2}f\left(\frac{x^2}{2-x^2}\right)$ for every $x$ in $[-1,1],$ (ii) $ f(0)=1,$ and (iii) $\lim_{x\to 1^-}\frac{f(x)}{\sqrt{1-x}}$ exists and is finite. Prove that $f$ is unique, and express $f(x)$ in closed form.

[b]p1.[/b] On the island of Nevermind some people are liars; they always lie. The remaining habitants of the island are truthlovers; they tell only the truth. Three habitants of the island, $A, B$, and $C$ met this morning. $A$ said: “All of us are liars”. $B$ said: “Only one of us is a truthlover”. Who of them is a liar and who of them is a truthlover? [b]p2.[/b] Pinocchio has $9$ pieces of paper. He is allowed to take a piece of paper and cut it in $5$ pieces or $7$ pieces which increases the number of his pieces. Then he can take again one of his pieces of paper and cut it in $5$ pieces or $7$ pieces. He can do this again and again as many times as he wishes. Can he get $2004$ pieces of paper? [b]p3.[/b] In Dragonland there are coins of $1$ cent, $2$ cents, $10$ cents, $20$ cents, and $50$ cents. What is the largest amount of money one can have in coins, yet still not be able to make exactly $1$ dollar? [b]p4.[/b] Find all solutions $a, b, c, d, e$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccc} & a & b & c & d \\ + & a & c & a & c \\ \hline c & d & e & b & c \\ \end{tabular}$ [b]p5.[/b] Two players play the following game. On the lowest left square of an $8\times 8$ chessboard there is a rook. The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second player is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For which quadratic polynomials $f(x)$ does there exist a quadratic polynomial $g(x)$ such that the equations $g(f(x)) = 0$ and $f(x)g(x) = 0$ have the same roots, which are mutually distinct and form an arithmetic progression?

Suppose $x_1, x_2, x_3$ are the roots of polynomial $P(x) = x^3 - 6x^2 + 5x + 12$ The sum $|x_1| + |x_2| + |x_3|$ is (A): $4$ (B): $6$ (C): $8$ (D): $14$ (E): None of the above.

Let $a,b,c,d$ real numbers such that $a+b+c+d=19$ and $a^2+b^2+c^2+d^2=91$. Find the maximum value of \[ \frac{1}{a} +\frac{1}{b} +\frac{1}{c} +\frac{1}{d} \]

Is it possible to color points in the Cartesian Plane $(x,y)$ with integer coordinates with three colors, such that each color appears infinitely many times on infinitely many lines parallel to the $x$-axis and that any three points, each of a different color, are not in a line? Justify your answer.

Let $x_1, x_2, ..., x_{24}$ be real numbers. prove that $$x_1 + 2x_2 + 3x_3 +...+ 24x_{24} - 439 \le \frac{x^2_1+x^2_2+... + x^2_{24}}{2}+ 2011.$$

Let $n\ge 2$ be an even integer and $a,b$ real numbers such that $b^n=3a+1$. Show that the polynomial $P(X)=(X^2+X+1)^n-X^n-a$ is divisible by $Q(X)=X^3+X^2+X+b$ if and only if $b=1$.

Let $a_1,\ldots,a_8$ be reals, not all equal to zero. Let \[ c_n = \sum^8_{k=1} a^n_k\] for $n=1,2,3,\ldots$. Given that among the numbers of the sequence $(c_n)$, there are infinitely many equal to zero, determine all the values of $n$ for which $c_n = 0.$

Let $N \geq 3$ be an integer, and let $a_0, \dots, a_{N-1}$ be pairwise distinct reals so that $a_i \geq a_{2i}$ for all $i$ (indices are taken $\bmod~ N$). Find all possible $N$ for which this is possible. [i]Proposed by Sutanay Bhattacharya[/i]

Find all injective functions $ f:\mathbb{N} \to \mathbb{N} $ such that $$ f^{f\left(a\right)}\left(b\right)f^{f\left(b\right)}\left(a\right)=\left(f\left(a+b\right)\right)^2 $$ holds for all $ a,b \in \mathbb{N} $. Note that $ f^{k}\left(n\right) $ means $ \underbrace{f(f(\ldots f}_{k}(n) \ldots )) $

Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).

The roots of the polynomial $f(x) = x^8 +x^7 -x^5 -x^4 -x^3 +x+ 1 $ are all roots of unity. We say that a real number $r \in [0, 1)$ is nice if $e^{2i \pi r} = \cos 2\pi r + i \sin 2\pi r$ is a root of the polynomial $f$ and if $e^{2i \pi r}$ has positive imaginary part. Let $S$ be the sum of the values of nice real numbers $r$. If $S =\frac{p}{q}$ for relatively prime positive integers $p, q$, find $p + q$.

3 cyclists rides on track in form circle with length $300$ meters in one direction. Every has constant speed,and speeds are different. Photographer want to make photoshoot with 3 cyclists. It is possible if they will be on the part of track with length $d$ meters. Find minimum $d$ such that it is possible.

Find all functions $f : R \to R$ that satisfies the condition $$f(f(x - y)) = f(x)f(y) - f(x) + f(y) - xy$$ for all real numbers $x, y$.

Define a sequence $<x_n>$ of real numbers by specifying an initial $x_0$ and by the recurrence $x_{n+1}=\frac{1+x_n}{1-x_n}$. Find $x_n$ as a function of $x_0$ and $n$, in closed form. There may be multiple cases.

An angle $x$ is chosen at random from the interval $0^\circ < x < 90^\circ$. Let $p$ be the probability that the numbers $\sin^2 x$, $\cos^2 x$, and $\sin x \cos x$ are not the lengths of the sides of a triangle. Given that $p = d/n$, where $d$ is the number of degrees in $\arctan m$ and $m$ and $n$ are positive integers with $m + n < 1000$, find $m + n$.

Find all positive integers $n\geqslant 2$ such that there exists a permutation $a_1$, $a_2$, $a_3$, \ldots, $a_{2n}$ of the numbers $1, 2, 3, \ldots, 2n$ satisfying $$a_1\cdot a_2 + a_3\cdot a_4 + \ldots + a_{2n-3} \cdot a_{2n-2} = a_{2n-1} \cdot a_{2n}.$$