Let $k$ be a positive number and $P$ a Polynomio with integer coeficients. Prove that exists a $n$ positive integer such that: $P(1)+P(2)+\dots+P(N)$ is divisible by $k$.

When the integer $ {\left(\sqrt{3} \plus{} 5\right)}^{103} \minus{} {\left(\sqrt{3} \minus{} 5\right)}^{103}$ is divided by 9, what is the remainder?

Let $p=4k+3$ be a prime. Prove that if \[\dfrac {1} {0^2+1}+\dfrac{1}{1^2+1}+\cdots+\dfrac{1}{(p-1)^2+1}=\dfrac{m} {n}\] (where the fraction $\dfrac {m} {n}$ is in reduced terms), then $p \mid 2m-n$. [i]Proposed by A. Golovanov[/i]

Find all prime numbers $p,q$, for which $p^{q+1}+q^{p+1}$ is a perfect square. [i]Proposed by P. Boyvalenkov[/i]

Suppose $a$ is a complex number such that \[a^2+a+\frac{1}{a}+\frac{1}{a^2}+1=0\] If $m$ is a positive integer, find the value of \[a^{2m}+a^m+\frac{1}{a^m}+\frac{1}{a^{2m}}\]

Determine how many primes are there in the sequence \[101, 10101, 1010101 ....\]

Find all the values that can take the last digit of a "perfect" even number. (The natural number $n$ is called "perfect" if the sum of all its natural divisors is equal twice the number itself.For example: the number $6$ is perfect ,because $1+2+3+6=2\cdot6$).

Show that for any positive integer $m$, there exists a positive integer $n$ so that in the decimal representations of the numbers $5^{m}$ and $5^{n}$, the representation of $5^{n}$ ends in the representation of $5^{m}$.

Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$. [i]Proposed by Juhan Aru, Estonia[/i]

Let $n$ be a positive integer.Consider the polynomial $p(x)=x^2+x+1$. What is the remainder of $ x^3$ when divided by $x^2+x+1$.For what positive integers values of $n$ is $ x^{2n}+x^n+1$ divisible by $p(x)$? Post no:[size=300]$100$[/size]

Prove that for all positive integers $n$ there exists a single positive integer divisible with $5^n$ which in decimal base is written using $n$ digits from the set $\{1,2,3,4,5\}$.

An integer sequence is defined by \[{ a_n = 2 a_{n-1} + a_{n-2}}, \quad (n > 1), \quad a_0 = 0, a_1 = 1.\] Prove that $2^k$ divides $a_n$ if and only if $2^k$ divides $n$.

Let $n$ be a positive integer. Let $a$ be an integer such that $\gcd (a,n)=1$. Prove that \[\frac{a^{\phi (n)}-1}{n}=\sum_{i\in R}\frac{1}{ai}\left[\frac{ai}{n}\right]\pmod{n}\] where $R$ is the reduced residue system of $n$ with each element a positive integer at most $n$.

Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$. [i]Proposed by Mohsen Jamali, Iran[/i]

Show that $\sigma (n) -d(m)$ is even for all positive integers $m$ and $n$ where $m$ is the largest odd divisor of $n$.

Let $n$ be a positive integer greater than $1$, and let $p$ be a prime such that $n$ divides $p-1$ and $p$ divides $n^3-1$. Prove that $4p-3$ is a square.

The number $\overline{13\ldots 3}$, with $k>1$ digits $3$, is a prime. Prove that $6\mid k^{2}-2k+3$.

Prove that there exist integers $a$, $b$, $c$ with $1 \le a < b < c \le 25$ and \[ S(a^6+2014) = S(b^6+2014) = S(c^6+2014) \] where $S(n)$ denotes the sum of the decimal digits of $n$. [i]Proposed by Evan Chen[/i]

Find all integer solutions $(x,y)$ of the equation $y^2=x^3-p^2x,$ where $p$ is a prime such that $p\equiv 3 \mod 4.$

Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.

Find all triples of primes $(p,q,r)$ satisfying $3p^{4}-5q^{4}-4r^{2}=26$.

Does there exist an integer such that its cube is equal to $3n^2 + 3n + 7,$ where $n$ is an integer.

Given a finite number of boys and girls, a [i]sociable set of boys[/i] is a set of boys such that every girl knows at least one boy in that set; and a [i]sociable set of girls[/i] is a set of girls such that every boy knows at least one girl in that set. Prove that the number of sociable sets of boys and the number of sociable sets of girls have the same parity. (Acquaintance is assumed to be mutual.) [i](Poland) Marek Cygan[/i]

In the diagram, $OB_i$ is parallel and equal in length to $A_i A_{i + 1}$ for $i = 1$, 2, 3, and 4 ($A_5 = A_1$). Show that the area of $B_1 B_2 B_3 B_4$ is twice that of $A_1 A_2 A_3 A_4$. [asy] unitsize(1 cm); pair O; pair[] A, B; O = (0,0); A[1] = (0.5,-3); A[2] = (2,0); A[3] = (-0.2,0.5); A[4] = (-1,0); B[1] = A[2] - A[1]; B[2] = A[3] - A[2]; B[3] = A[4] - A[3]; B[4] = A[1] - A[4]; draw(A[1]--A[2]--A[3]--A[4]--cycle); draw(B[1]--B[2]--B[3]--B[4]--cycle); draw(O--B[1]); draw(O--B[2]); draw(O--B[3]); draw(O--B[4]); label("$A_1$", A[1], S); label("$A_2$", A[2], E); label("$A_3$", A[3], N); label("$A_4$", A[4], W); label("$B_1$", B[1], NE); label("$B_2$", B[2], W); label("$B_3$", B[3], SW); label("$B_4$", B[4], S); label("$O$", O, E); [/asy]

Suppose that n numbers $x_1, x_2, . . . , x_n$ are chosen randomly from the set $\{1, 2, 3, 4, 5\}$. Prove that the probability that $x_1^2+ x_2^2 +\cdots+ x_n^2 \equiv 0 \pmod 5$ is at least $\frac 15.$