If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.

find all primes $p$, for which exist natural numbers, such that $p=m^2+n^2$ and $p|(m^3+n^3-4)$.

Find (to the first order in $\epsilon$) the influence of the imperfection of an almost spherical capacitor $R = 1 + \epsilon f(\varphi, \theta)$ on its capacity.

How many different isosceles triangles have integer side lengths and perimeter 23? $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 11$

(a) Prove that for every $x \in R$ holds that $$-1 \le \frac{x}{x^2 + x + 1} \le \frac 13$$ (b) Determine all functions $f : R \to R$ for which for every $x \in R$ holds that $$f \left( \frac{x}{x^2 + x + 1} \right) = \frac{x^2}{x^4 + x^2 + 1}$$

On a $2004 \times 2004$ chess table there are 2004 queens such that no two are attacking each other\footnote[1]{two queens attack each other if they lie on the same row, column or direction parallel with on of the main diagonals of the table}. Prove that there exist two queens such that in the rectangle in which the center of the squares on which the queens lie are two opposite corners, has a semiperimeter of 2004.

Suppose $f(z)=z^n+a_1z^{n-1}+...+a_n$ for which $a_1,a_2,...,a_n\in \mathbb C$. Prove that the following polynomial has only one positive real root like $\alpha$ \[x^n+\Re(a_1)x^{n-1}-|a_2|x^{n-2}-...-|a_n|\] and the following polynomial has only one positive real root like $\beta$ \[x^n-\Re(a_1)x^{n-1}-|a_2|x^{n-2}-...-|a_n|.\] And roots of the polynomial $f(z)$ satisfy $-\beta \le \Re(z) \le \alpha$.

Let $n$ be a positive integer. Show that $${2n+1 \choose 1} -{2n+1 \choose 3}2008 + {2n+1 \choose 5}2008^2- ...+(-1)^{n}{2n+1 \choose 2n+1}2008^n $$ is not divisible by $19$.

Let $S$ be the set of words made from the letters $a,b$ and $c$. The equivalence relation $\sim$ on $S$ satisfies \[uu \sim u \] \[u \sim v \Rightarrow uw \sim vw \; \text{and} \; wu \sim wv\] for all words $u, v$ and $w$. Prove that every word in $S$ is equivalent to a word of length $\leq 8$.

On a connected graph $G$, one may perform the following operations: [list] [*]choose a vertice $v$, and add a vertice $v'$ such that $v'$ is connected to $v$ and all of its neighbours [*] choose a vertice $v$ with odd degree and delete it [/list] Show that for any connected graph $G$, we may perform a finite number of operations such that the resulting graph is a clique. Proposed by [i]idonthaveanaopsaccount[/i]

The bottom, side, and front areas of a rectangular box are known. The product of these areas is equal to: $ \textbf{(A)}\ \text{the volume of the box} \qquad\textbf{(B)}\ \text{the square root of the volume} \qquad\textbf{(C)}\ \text{twice the volume}$ $ \textbf{(D)}\ \text{the square of the volume} \qquad\textbf{(E)}\ \text{the cube of the volume}$

Consider a triangle $ABC$. Let $S$ be a circumference in the interior of the triangle that is tangent to the sides $BC$, $CA$, $AB$ at the points $D$, $E$, $F$ respectively. In the exterior of the triangle we draw three circumferences $S_A$, $S_B$, $S_C$. The circumference $S_A$ is tangent to $BC$ at $L$ and to the prolongation of the lines $AB$, $AC$ at the points $M$, $N$ respectively. The circumference $S_B$ is tangent to $AC$ at $E$ and to the prolongation of the line $BC$ at $P$. The circumference $S_C$ is tangent to $AB$ at $F$ and to the prolongation of the line $BC$ at $Q$. Show that the lines $EP$, $FQ$ and $AL$ meet at a point of the circumference $S$.

Find all functions $f: \mathbb{Z}\to \mathbb{Z}$ such that for all $m\in \mathbb{Z}$: \[f(f(m))=m+1.\]

An underground burrow consists of an infinite sequence of rooms labeled by the integers $(\dots, -3, -2, -1, 0, 1, 2, 3,\dots)$. Initially, some of the rooms are occupied by one or more rabbits. Each rabbit wants to be alone. Thus, if there are two or more rabbits in the same room (say, room $m$), half of the rabbits (rounding down) will flee to room $m-1$, and half (also rounding down) to room $m+1$. Once per minute, this happens simultaneously in all rooms that have two or more rabbits. For example, if initially all rooms are empty except for $5$ rabbits in room $\#12$ and $2$ rabbits in room $\#13$, then after one minute, rooms $\text{\#11--\#14}$ will contain $2$, $2$, $2$, and $1$ rabbits, respectively, and all other rooms will be empty. Now suppose that initially there are $k+1$ rabbits in room $k$ for each $k=0, 1, 2, \ldots, 9, 10$, and all other rooms are empty. [list=a] [*]Show that eventually the rabbits will stop moving. [*] Determine which rooms will be occupied when this occurs. [/list]

$A$ is an acute angle. Show that $$\left(1 +\frac{1}{sen A}\right)\left(1 +\frac{1}{cos A}\right)> 5$$

In $ xy$ plane, find the minimum volume of the solid by rotating the region boubded by the parabola $ y \equal{} x^2 \plus{} ax \plus{} b$ passing through the point $ (1,\ \minus{} 1)$ and the $ x$ axis about the $ x$ axis

Call a right triangle $ABC$ [i]special [/i] if the lengths of its sides $AB, BC$ and$ CA$ are integers, and on each of these sides has some point $X$ (different from the vertices of $ \vartriangle ABC$), for which the lengths of the segments $AX, BX$ and $CX$ are integers numbers. Find at least one special triangle. (Maria Rozhkova)

In a classroom, $28$ students are divided into $4$ groups of $7$, and in each group the students are labeled $1, 2,..., 7$ in some order. Show that no matter how the labels are assigned, there must be four students of the same gender who come from two groups and share the same two labels.

There are several scientists collaborating in Niichavo. During an $ 8$-hour working day, the scientists went to cafeteria, possibly several times.It is known that for every two scientist, the total time in which exactly one of them was in cafeteria is at least $ x$ hours ($ x>4$). What is the largest possible number of scientist that could work in Niichavo that day,in terms of $ x$?

Find the number of sets $A$ containing $9$ positive integers with the following property: for any positive integer $n\le 500$, there exists a subset $B\subset A$ such that $\sum_{b\in B}{b}=n$. [i]Bogdan Enescu & Dan Ismailescu[/i]

Alice and Bob play the following game: They start with non-empty piles of coins. Taking turns, with Alice playing first, each player choose a pile with an even number of coins and moves half of the coins of this pile to the other pile. The game ends if a player cannot move, in which case the other player wins. Determine all pairs $(a,b)$ of positive integers such that if initially the two piles have $a$ and $b$ coins respectively, then Bob has a winning strategy. Proposed by Dimitris Christophides, Cyprus

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

Show that, for every positive integer $x$, there is a positive integer $y\in \{2, 5, 13\}$ such that $xy - 1$ is not a perfect square.

Joey is playing with a $2$-by-$2$-by-$2$ Rubik’s cube made up of $ 8$ $1$-by-$1$-by-$1$ cubes (with two of these smaller cubes along each of the sides of the bigger cubes). Each face of the Rubik’s cube is distinct color. However, one day, Joey accidentally breaks the cube! He decides to put the cube back together into its solved state, placing each of the pieces one by one. However, due to the nature of the cube, he is only able to put in a cube if it is adjacent to a cube he already placed. If different orderings of the ways he chooses the cubes are considered distinct, determine the number of ways he can reassemble the cube.

Albert, Bernard, and Cheryl are playing marbles. At the beginning, each of them brings 5 red marbles, 7 green marbles and 13 blue marbles and in the middle of the table, there is a box of infinitely many red, blue and green marbles. In each turn, each player may choose 2 marbles of different color and replace them with 2 marbles of the third color. After a finite number of steps, this conversation happens. Albert : " I have only red marbles" Bernard : "I have only blue marbles" Cheryl: "I have only green marbles" Which of the three are lying?