For every positive integer $n$, let $p(n)$ denote the number of sets $\{x_1, x_2, \dots, x_k\}$ of integers with $x_1 > x_2 > \dots > x_k > 0$ and $n = x_1 + x_3 + x_5 + \dots$ (the right hand side here means the sum of all odd-indexed elements). As an example, $p(6) = 11$ because all satisfying sets are as follows: $$\{6\}, \{6, 5\}, \{6, 4\}, \{6, 3\}, \{6, 2\}, \{6, 1\}, \{5, 4, 1\}, \{5, 3, 1\}, \{5, 2, 1\}, \{4, 3, 2\}, \{4, 3, 2, 1\}.$$ Show that $p(n)$ equals to the number of partitions of $n$ for every positive integer $n$.

Find all non-negative integers $n$ so that $\sqrt{n + 3}+ \sqrt{n +\sqrt{n + 3}} $ is an integer.

In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.

Let $a, b \ge 2$ be positive integers with $gcd (a, b) = 1$. Let $r$ be the smallest positive value that $\frac{a}{b}- \frac{c}{d}$ can take, where $c$ and $d$ are positive integers satisfying $c \le a$ and $d \le b$. Prove that $\frac{1}{r}$ is an integer.

Hannusya, Petrus and Mykolka drew independently one isosceles triangle $ABC$, all angles of which are measured as a integer number of degrees. It turned out that the bases $AC$ of these triangles are equals and for each of them on the ray $BC$ there is a point $E$ such that $BE=AC$, and the angle $AEC$ is also measured by an integer number of degrees. Is it in necessary that: a) all three drawn triangles are equal to each other? b) among them there are at least two equal triangles?

Let $P(x)$ be a polynomial with integer coefficients of degree $n \ge 3$. If $x_1,...,x_m$ ($n\ge m\ge3$) are different integers such that $P(x_1) = P(x_2) = ... = P(x_m) = 1$, prove that $P$ cannot have integer roots$.

For each integer $n$, determine the smallest real number $M_n$ such that \[\frac{1}{a_1}+\frac{a_1}{a_2}+\frac{a_2}{a_3}+\dots+\frac{a_{n-1}}{a_n} \le M_n\] for any $n$-tuple $(a_1,a_2,\dots,a_n)$ of integers such that $1<a_1<a_2<\dots<a_n$.

Suppose that $a, b$ are natural numbers so that all the roots of $x^2 + ax - b$ and $x^2 - ax + b$ are integers. Show that exists a right triangle with integer sides, with $a$ the length of the hypotenuse and $b$ the area .

Consider a triangle $XYZ$ and a point $O$ in its interior. Three lines through $O$ are drawn, parallel to the respective sides of the triangle. The intersections with the sides of the triangle determine six line segments from $O$ to the sides of the triangle. The lengths of these segments are integer numbers $a, b, c, d, e$ and $f$ (see figure). Prove that the product $a \cdot b \cdot c\cdot d \cdot e \cdot f$ is a perfect square. [asy] unitsize(1 cm); pair A, B, C, D, E, F, O, X, Y, Z; X = (1,4); Y = (0,0); Z = (5,1.5); O = (1.8,2.2); A = extension(O, O + Z - X, X, Y); B = extension(O, O + Y - Z, X, Y); C = extension(O, O + X - Y, Y, Z); D = extension(O, O + Z - X, Y, Z); E = extension(O, O + Y - Z, Z, X); F = extension(O, O + X - Y, Z, X); draw(X--Y--Z--cycle); draw(A--D); draw(B--E); draw(C--F); dot("$A$", A, NW); dot("$B$", B, NW); dot("$C$", C, SE); dot("$D$", D, SE); dot("$E$", E, NE); dot("$F$", F, NE); dot("$O$", O, S); dot("$X$", X, N); dot("$Y$", Y, SW); dot("$Z$", Z, dir(0)); label("$a$", (A + O)/2, SW); label("$b$", (B + O)/2, SE); label("$c$", (C + O)/2, SE); label("$d$", (D + O)/2, SW); label("$e$", (E + O)/2, SE); label("$f$", (F + O)/2, NW); [/asy]

The sum of two integers is $8$. The sum of the squares of those two integers is $34$. What is the product of the two integers?

The natural numbers $a$ and $b$ are such that $ \frac{a+1}{b}+ \frac{b+1}{a}$ is an integer. Show that the greatest common divisor of a and b is not greater than $\sqrt{a+b}$.

For how many natural numbers $n$ between $1$ and $2014$ (both inclusive) is $\frac{8n}{9999-n}$ an integer?

It is given that the equation $x^2 + ax + 20 = 0$ has integer roots. What is the sum of all possible values of $a$?