Find all pairs $(x,y)$ of integers such that $y^3-1=x^4+x^2$.

For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$. (i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$. (ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$. (The number $|P|$ is the size of set $P$) [i]Dan Schwarz, Romania[/i]

For any $ n\ge 2 $ natural, show that the following inequality holds: $$ \sum_{i=2}^n\frac{1}{\sqrt[i]{(2i)!}}\ge\frac{n-1}{2n+2} . $$

Let $A_1,A_2,...$ be a sequence of sets such that for any positive integer $i$, there are only finitely many values of $j$ such that $A_j\subseteq A_i$. Prove that there is a sequence of positive integers $a_1,a_2,...$ such that for any pair $(i,j)$ to have $a_i\mid a_j\iff A_i\subseteq A_j$.

For every positive integer $n$, define the number of non-empty subsets $\mathcal N\subseteq \{1,\ldots ,n\}$ such that $\gcd(n\in\mathcal N)=1$. Show that $f(n)$ is a perfect square if and only if $n=1$.

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.

Let there be an infinite sequence $ a_{k} $ with $ k\geq 1 $ defined by: $ a_{k+2} = a_{k} + 14 $ and $ a_{1} = 12 $ , $ a_{2} = 24 $. [b]a)[/b] Does $2012$ belong to the sequence? [b]b)[/b] Prove that the sequence doesn't contain perfect squares.

$\mathbb{N}$ is the set of positive integers. Determine all functions $f:\mathbb{N}\to\mathbb{N}$ such that for every pair $(m,n)\in\mathbb{N}^2$ we have that: \[f(m)+f(n) \ | \ m+n .\]

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

[b](a)[/b] Prove that $\frac{1}{n+1} \cdot \binom{2n}{n}$ is an integer for $n \geq 0.$ [b](b)[/b] Given a positive integer $k$, determine the smallest integer $C_k$ with the property that $\frac{C_k}{n+k+1} \cdot \binom{2n}{n}$ is an integer for all $n \geq k.$

Prove that for each positive integer n,the equation $x^{2}+15y^{2}=4^{n}$ has at least $n$ integer solution $(x,y)$

Find all natural numbers a, b such that $ a^{n}\plus{} b^{n} \equal{} c^{n\plus{}1}$ where c and n are naturals.

Given positive numbers $a_1$ and $b_1$, consider the sequences defined by \[a_{n+1}=a_n+\frac{1}{b_n},\quad b_{n+1}=b_n+\frac{1}{a_n}\quad (n \ge 1)\] Prove that $a_{25}+b_{25} \geq 10\sqrt{2}$.

Let $M=\{1,2,\ldots,3 \cdot n\}$. Partition $M$ into three sets $A,B,C$ which $card$ $A$ $=$ $card$ $B$ $=$ $card$ $C$ $=$ $n .$ Prove that there exists $a$ in $A,b$ in $B, c$ in $C$ such that or $a=b+c,$ or $b=c+a,$ or $c=a+b$ [i]Edited by orl.[/i]