For any positive integer $n$, let $f(n)$ be the number of possible choices of signs $+\ \text{or}\ - $ in the algebraic expression $\pm 1\pm 2\ldots \pm n$, such that the obtained sum is zero. Show that $f(n)$ satisfies the following conditions: a) $f(n)=0$ for $n=1\pmod{4}$ or $n=2\pmod{4}$. b) $2^{\frac{n}{2}-1}\le f(n)\le 2^n-2^{\lfloor\frac{n}{2}\rfloor+1}$, for $n=0\pmod{4}$ or $n=3\pmod{4}$. [i]Ioan Tomsecu[/i]

We say that the rank of a group $ G$ is at most $ r$ if every subgroup of $ G$ can be generated by at most $ r$ elements. Prove that here exists an integer $ s$ such that for every finite group $ G$ of rank $ 2$ the commutator series of $ G$ has length less than $ s$. [i]J. Erdos[/i]

Let $n$ be a positive integer and $p$ be a prime number of the form $8k+5$. A polynomial $Q$ of degree at most $2023$ and nonnegative integer coefficients less than or equal to $n$ will be called "cool" if \[p\mid Q(2)\cdot Q(3) \cdot \ldots \cdot Q(p-2)-1.\] Prove that the number of cool polynomials is even.

An integer $n$, unknown to you, has been randomly chosen in the interval $[1,2002]$ with uniform probability. Your objective is to select $n$ in an ODD number of guess. After each incorrect guess, you are informed whether $n$ is higher or lower, and you $\textbf{must}$ guess an integer on your next turn among the numbers that are still feasibly correct. Show that you have a strategy so that the chance of winning is greater than $\tfrac{2}{3}$.

Let $n$, $k$ be positive integers such that $n$ is not divisible by $3$ and $k\ge n$. Prove that there exists a positive integer m which is divisible by $n$ and the sum of its digits in the decimal representation is $k$.

Assume that $a,b$ are integers and $n$ is a natural number. $2^na+b$ is a perfect square for every $n$.Prove that $a=0$.

Suppose that $m$ and $n$ are integers, such that both the quadratic equations $x^2+mx-n=0$ and $x^2-mx+n=0$ have integer roots. Prove that $n$ is divisible by $6$.

Jerry's favorite number is $97$. He knows all kinds of interesting facts about $97$: [list][*]$97$ is the largest two-digit prime. [*]Reversing the order of its digits results in another prime. [*]There is only one way in which $97$ can be written as a difference of two perfect squares. [*]There is only one way in which $97$ can be written as a sum of two perfect squares. [*]$\tfrac1{97}$ has exactly $96$ digits in the [smallest] repeating block of its decimal expansion. [*]Jerry blames the sock gnomes for the theft of exactly $97$ of his socks.[/list] A repunit is a natural number whose digits are all $1$. For instance, \begin{align*}&1,\\&11,\\&111,\\&1111,\\&\vdots\end{align*} are the four smallest repunits. How many digits are there in the smallest repunit that is divisible by $97?$

A sequence of positive integers is defined by $a_0=1$ and $a_{n+1}=a_n^2+1$ for each $n\ge0$. Find $\text{gcd}(a_{999},a_{2004})$.

Suppose that $ p$ is a prime number. Prove that the equation $ x^2\minus{}py^2\equal{}\minus{}1$ has a solution if and only if $ p\equiv1\pmod 4$.

Prove that for $n\geq 2$, \[\underbrace{2^{2^{\cdots^{2}}}}_{n\text{ terms}}\equiv \underbrace{2^{2^{\cdots^{2}}}}_{n-1\text{ terms}}\; \pmod{n}.\]

Given a set $M$ of $1985$ distinct positive integers, none of which has a prime divisor greater than $23$, prove that $M$ contains a subset of $4$ elements whose product is the $4$th power of an integer.

A grasshopper rests on the point $(1,1)$ on the plane. Denote by $O,$ the origin of coordinates. From that point, it jumps to a certain lattice point under the condition that, if it jumps from a point $A$ to $B,$ then the area of $\triangle AOB$ is equal to $\frac 12.$ $(a)$ Find all the positive integral poijnts $(m,n)$ which can be covered by the grasshopper after a finite number of steps, starting from $(1,1).$ $(b)$ If a point $(m,n)$ satisfies the above condition, then show that there exists a certain path for the grasshopper to reach $(m,n)$ from $(1,1)$ such that the number of jumps does not exceed $|m-n|.$

The $7$-digit numbers $\underline{7}$ $ \underline{4}$ $ \underline{A}$ $ \underline{5}$ $ \underline{2}$ $ \underline{B}$ $ \underline{1}$ and $\underline{3}$ $ \underline{2}$ $ \underline{6}$ $ \underline{A}$ $ \underline{B}$ $ \underline{4}$ $ \underline{C}$ are each multiples of $3$. Which of the following could be the value of $C$? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }5\qquad \textbf{(E) }8$

Prove that there exists infinitely many positive integers $n$ such that $n^2+1$ has a prime divisor greater than $2n+\sqrt{5n+2011}$.

Prove that there exists an integer polynomial $P(X)$ such that $P(n)+4^n \equiv 0 \pmod {27}$. for all $n \geq 0$.

There are $n$ coins lying in a circle. Each coin has two sides, $+$ and $-$. A $flop$ means to flip every coin that has two different neighbors simultaneously, while leaving the others alone. For instance, $++-+$, after one $flop$, becomes $+---$. For $n$ coins, let us define $M$ to be a $perfect$ $number$ if for any initial arrangement of the coins, the arrangement of the coins after $m$ $flops$ is exactly the same as the initial one. (a) When $n=1024$, find a perfect number $M$. (b) Find all $n$ for which a perfect number $M$ exist.

Solve in positive integers the equation $10^{a}+2^{b}-3^{c}=1997$.

Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$ [i]Proposed by Romeo Meštrović, Montenegro[/i]

Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$? [i]Proposed by Mahan Malihi[/i]

If $n$ and $m$ are integers and $n^2+m^2$ is even, which of the following is impossible? $\textbf{(A) }n$ and $m$ are even $\qquad\textbf{(B) }n$ and $m$ are odd $\qquad\textbf{(C) }n+m$ is even $\qquad\textbf{(D) }n+m$ is odd $\qquad \textbf{(E) }$ none of these are impossible

Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.

On the board written numbers from 1 to 25 . Bob can pick any three of them say $a,b,c$ and replace by $a^3+b^3+c^3$ . Prove that last number on the board can not be $2013^3$.

How many rooks can be placed in an $n\times n$ chessboard such that each rook is threatened by at most $2k$ rooks? (15 points) [i]Proposed by Mostafa Einollah zadeh[/i]

For a prime $ p$ an a positive integer $ n$, denote by $ \nu_p(n)$ the exponent of $ p$ in the prime factorization of $ n!$. Given a positive integer $ d$ and a finite set $ \{p_1,p_2,\ldots, p_k\}$ of primes, show that there are infinitely many positive integers $ n$ such that $ \nu_{p_i}(n) \equiv 0 \pmod d$, for all $ 1\leq i \leq k$.