The real sequence $\{a_n|n=0,1,2,3,...\}$ defined $a_0=1$ and \[ a_{n+1}=\frac{1}{2}\left (a_{n}+\frac{1}{3 \cdot a_{n}} \right ). \] Denote \[ A_n=\frac{3}{3 \cdot a_n^2-1}. \] Prove that $A_n$ is a perfect square and it has at least $n$ distinct prime divisors.

Let $n_1,\ldots,n_k$ be positive integers, and define $d_1=1$ and $d_i=\frac{(n_1,\ldots,n_{i-1})}{(n_1,\ldots,n_{i})}$, for $i\in \{2,\ldots,k\}$, where $(m_1,\ldots,m_{\ell})$ denotes the greatest common divisor of the integers $m_1,\ldots,m_{\ell}$. Prove that the sums \[\sum_{i=1}^k a_in_i\] with $a_i\in\{1,\ldots,d_i\}$ for $i\in\{1,\ldots,k\}$ are mutually distinct $\mod n_1$.

Prove that for all natural numbers $n$, \[ \sum_{k=1}^{n^2} \left\{ \sqrt{k} \right\} \le \frac{n^2-1}{2}. \] Here, $\{x\}$ denotes the fractional part of $x$.

Let $ A_1A_2...A_n$ be a convex polygon. Show that there exists an index $ j$ such that the circum-circle of the triangle $ A_j A_{j \plus{} 1} A_{j \plus{} 2}$ covers the polygon (here indices are read modulo n).

Is there a triangle with angles in ratio of $ 1: 2: 4$ and the length of its sides are integers with at least one of them is a prime number? [i]Nanang Susyanto, Jogjakarta[/i]

Evaluate $ \int_0^1 (1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{n \minus{} 1})\{1 \plus{} 3x \plus{} 5x^2 \plus{} \cdots \plus{} (2n \minus{} 3)x^{n \minus{} 2} \plus{} (2n \minus{} 1)x^{n \minus{} 1}\}\ dx.$

For any integer $n\geq 2$, we compute the integer $h(n)$ by applying the following procedure to its decimal representation. Let $r$ be the rightmost digit of $n$. [list][*]If $r=0$, then the decimal representation of $h(n)$ results from the decimal representation of $n$ by removing this rightmost digit $0$. [*]If $1\leq r \leq 9$ we split the decimal representation of $n$ into a maximal right part $R$ that solely consists of digits not less than $r$ and into a left part $L$ that either is empty or ends with a digit strictly smaller than $r$. Then the decimal representation of $h(n)$ consists of the decimal representation of $L$, followed by two copies of the decimal representation of $R-1$. For instance, for the number $17,151,345,543$, we will have $L=17,151$, $R=345,543$ and $h(n)=17,151,345,542,345,542$.[/list] Prove that, starting with an arbitrary integer $n\geq 2$, iterated application of $h$ produces the integer $1$ after finitely many steps. [i]Proposed by Gerhard Woeginger, Austria[/i]

Determine all strictly increasing functions $f: \mathbb{N}\to\mathbb{N}$ satisfying $nf(f(n))=f(n)^2$ for all positive integers $n$. [i]Carl Lian and Brian Hamrick.[/i]

Find a function $f(x)$ defined for all real values of $x$ such that for all $x$, \[f(x+ 2) - f(x) = x^2 + 2x + 4,\] and if $x \in [0, 2)$, then $f(x) = x^2.$

Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$

Let $\mathcal{F}$ be the set of all functions $f : (0,\infty)\to (0,\infty)$ such that $f(3x) \geq f( f(2x) )+x$ for all $x$. Find the largest $A$ such that $f(x) \geq A x$ for all $f\in\mathcal{F}$ and all $x$.

The sequence $a_1, a_2,..., a_{2000}$ of real numbers satisfies the condition \[a_1^3+a_2^3+...+a_n^3=(a_1+a_2+...+a_n)^2\] for all $n$, $1\leq n \leq 2000$. Prove that every element of the sequence is an integer.

Find all strictly increasing functions $f:\mathbb{N}\rightarrow\mathbb{N}$ that satisfy \[f(n+f(n))=2f(n)\quad\text{for all}\ n\in\mathbb{N} \]

On a blackboard a positive integer $n_0$ is written. Two players, $A$ and $B$ are playing a game, which respects the following rules: $-$ acting alternatively per turn, each player deletes the number written on the blackboard $n_k$ and writes instead one number denoted with $n_{k+1}$ from the set $\left\{n_k-1, \dsp \left\lfloor\frac {n_k}3\right\rfloor\right\}$; $-$ player $A$ starts first deleting $n_0$ and replacing it with $n_1\in\left\{n_0-1, \dsp \left\lfloor\frac {n_0}3\right\rfloor\right\}$; $-$ the game ends when the number on the table is 0 - and the player who wrote it is the winner. Find which player has a winning strategy in each of the following cases: a) $n_0=120$; b) $n_0=\dsp \frac {3^{2002}-1}2$; c) $n_0=\dsp \frac{3^{2002}+1}2$.

Two positive valued sequences $\{ a_{n}\}$ and $\{ b_{n}\}$ satisfy: (a): $a_{0}=1 \geq a_{1}$, $a_{n}(b_{n+1}+b_{n-1})=a_{n-1}b_{n-1}+a_{n+1}b_{n+1}$, $n \geq 1$. (b): $\sum_{i=1}^{n}b_{i}\leq n^{\frac{3}{2}}$, $n \geq 1$. Find the general term of $\{ a_{n}\}$.

Let $a_0=5/2$ and $a_k=a_{k-1}^2-2$ for $k\ge 1.$ Compute \[\prod_{k=0}^{\infty}\left(1-\frac1{a_k}\right)\] in closed form.

In a simple graph $G$, we call $t$ pairwise adjacent vertices a $t$[i]-clique[/i]. If a vertex is connected with all other vertices in the graph, we call it a [i]central[/i] vertex. Given are two integers $n,k$ such that $\dfrac {3}{2} \leq \dfrac{1}{2} n < k < n$. Let $G$ be a graph on $n$ vertices such that [b](1)[/b] $G$ does not contain a $(k+1)$-[i]clique[/i]; [b](2)[/b] if we add an arbitrary edge to $G$, that creates a $(k+1)$-[i]clique[/i]. Find the least possible number of [i]central[/i] vertices in $G$.

Prove that there exist monic polynomial $f(x) $ with degree of 6 and having integer coefficients such that (1) For all integer $m$, $f(m) \ne 0$. (2) For all positive odd integer $n$, there exist positive integer $k$ such that $f(k)$ is divided by $n$.

Find all functions $ f: \mathbb{Z}\setminus\{0\}\to \mathbb{Q}$ such that for all $ x,y \in \mathbb{Z}\setminus\{0\}$: \[ f \left( \frac{x+y}{3}\right) =\frac{f(x)+f(y)}{2}, \; \; x, y \in \mathbb{Z}\setminus\{0\}\]

A sequence of real numbers $ x_0, x_1, x_2, \ldots$ is defined as follows: $ x_0 \equal{} 1989$ and for each $ n \geq 1$ \[ x_n \equal{} \minus{} \frac{1989}{n} \sum^{n\minus{}1}_{k\equal{}0} x_k.\] Calculate the value of $ \sum^{1989}_{n\equal{}0} 2^n x_n.$

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

1. Prove the following inequality for positive reals $a_1,a_2...,a_n$ and $b_1,b_2...,b_n$: $(\sum a_i)(\sum b_i)\geq (\sum a_i+b_i)(\sum\frac{a_ib_i}{a_i+b_i})$

A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \] If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.

Let $n=p_1^{a_1}p_2^{a_2}\cdots p_t^{a_t}$ be the prime factorisation of $n$. Define $\omega(n)=t$ and $\Omega(n)=a_1+a_2+\ldots+a_t$. Prove or disprove: For any fixed positive integer $k$ and positive reals $\alpha,\beta$, there exists a positive integer $n>1$ such that i) $\frac{\omega(n+k)}{\omega(n)}>\alpha$ ii) $\frac{\Omega(n+k)}{\Omega(n)}<\beta$.

Is there an infinite sequence of prime numbers $p_1$, $p_2$, $\ldots$, $p_n$, $p_{n+1}$, $\ldots$ such that $|p_{n+1}-2p_n|=1$ for each $n \in \mathbb{N}$?