Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

a) Let $a\in \mathbb{R}$ and $f \colon \mathbb{R} \to \mathbb{R}$ be a continuous function for which there exists an antiderivative $F \colon \mathbb{R} \to \mathbb{R} $, such that $F(x)+a\cdot f(x) \geq 0$, for any $x \in \mathbb{R}$, and$ \lim_{|x| \to \infty} \frac{F(x)}{e^{|\alpha \cdot x|}}=0$ holds for any $\alpha \in \mathbb{R}^*$. Prove that $F(x) \geq 0$ for all $x \in \mathbb{R}$. b) Let $n\geq 2$ be a positive integer, $g \in \mathbb{R}[X]$, $g = X^n + a_1X^{n-1}+ \dots + a_{n-1}X+a_n$ be a polynomial with all of its roots being real, and $f \colon \mathbb{R} \to \mathbb{R}$ a polynomial function such that $f(x)+a_1\cdot f'(x)+a_2\cdot f^{(2)}(x)+\dots+a_n\cdot f^{(n)}(x) \geq 0$ for any $x \in \mathbb{R}$. Prove that $f(x) \geq 0$ for all $x \in \mathbb{R}$.

Let $a\geq 2$ a fixed natural number, and let $a_{n}$ be the sequence $a_{n}=a^{a^{.^{.^{a}}}}$ (e.g $a_{1}=a$, $a_{2}=a^a$, etc.). Prove that $(a_{n+1}-a_{n})|(a_{n+2}-a_{n+1})$ for every natural number $n$.

Given is a simple connected graph with $2n$ vertices. Prove that its vertices can be colored with two colors so that if there are $k$ edges connecting vertices with different colors and $m$ edges connecting vertices with the same color, then $k-m \geq n$.

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.

The harmonic table is a triangular array: $1$ $\frac 12 \qquad \frac 12$ $\frac 13 \qquad \frac 16 \qquad \frac 13$ $\frac 14 \qquad \frac 1{12} \qquad \frac 1{12} \qquad \frac 14$ Where $a_{n,1} = \frac 1n$ and $a_{n,k+1} = a_{n-1,k} - a_{n,k}$ for $1 \leq k \leq n-1.$ Find the harmonic mean of the $1985^{th}$ row.

Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \dots$, Turbo successively crawls distances $c_1, c_2, c_3, \dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise. Determine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.

In the real axis, there is bug standing at coordinate $x=1$. Each step, from the position $x=a$, the bug can jump to either $x=a+2$ or $x=\frac{a}{2}$. Show that there are precisely $F_{n+4}-(n+4)$ positions (including the initial position) that the bug can jump to by at most $n$ steps. Recall that $F_n$ is the $n^{th}$ element of the Fibonacci sequence, defined by $F_0=F_1=1$, $F_{n+1}=F_n+F_{n-1}$ for all $n\geq 1$.

Let $ p$ be a prime number and let $ a_1,a_2,\ldots,a_{p \minus{} 2}$ be positive integers such that $ p$ doesn't $ a_k$ or $ {a_k}^k \minus{} 1$ for any $ k$. Prove that the product of some of the $ a_i$'s is congruent to $ 2$ modulo $ p$.

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

Find all $n$ such that \[n = d (n) ^ 4\] Where $d (n)$ is the number of divisors of $n$, for example $n = 2 \cdot 3\cdot 5\implies d (n) = 2 \cdot 2\cdot 2$.

Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)

Let $m,n\ge 2$ be given integers. Prove that there exist positive integers $a_1<a_2<\ldots<a_m$ so that for any $1\le i<j\le m$ the number $\frac{a_j}{a_j-a_i}$ is an integer divisible by $n$.

Define the sequences $(a_n),(b_n)$ by \begin{align*} & a_n, b_n > 0, \forall n\in\mathbb{N_+} \\ & a_{n+1} = a_n - \frac{1}{1+\sum_{i=1}^n\frac{1}{a_i}} \\ & b_{n+1} = b_n + \frac{1}{1+\sum_{i=1}^n\frac{1}{b_i}} \end{align*} 1) If $a_{100}b_{100} = a_{101}b_{101}$, find the value of $a_1-b_1$; 2) If $a_{100} = b_{99}$, determine which is larger between $a_{100}+b_{100}$ and $a_{101}+b_{101}$.

Written on a blackboard are $n$ nonnegative integers whose greatest common divisor is $1$. A [i]move[/i] consists of erasing two numbers $x$ and $y$, where $x\ge y$, on the blackboard and replacing them with the numbers $x-y$ and $2y$. Determine for which original $n$-tuples of numbers on the blackboard is it possible to reach a point, after some number of moves, where $n-1$ of the numbers of the blackboard are zeroes.