$n\geq3$ boxes are placed around a circle. At the first step we choose some boxes. At the second step for each chosen box we put a ball into the chosen box and into each of its two neighbouring boxes. Find the total number of possible distinct ball distributions which can be obtained in this way. (All balls are identical.)

Consider the set of $5$-tuples of positive integers at most $5$. We say the tuple ($a_1$, $a_2$, $a_3$, $a_4$, $a_5$) is [i]perfect[/i] if for any distinct indices $i$, $j$, $k$, the three numbers $a_i$, $a_j$ , $a_k$ do not form an arithmetic progression (in any order). Find the number of perfect $5$-tuples.

An integer $n\geq 2$ having exactly $s$ positive divisors $1=d_1<d_2<\cdots<d_s=n$ is said to be [i]good[/i] if there exists an integer $k$, with $2\leq k\leq s$, such that $d_k>1+d_1+\cdots+d_{k-1}$. An integer $n\geq 2$ is said to be [i]bad[/i] if it is not good. (a) Show that there are infinitely many bad integers. (b) Prove that, among any seven consecutive integers all greater than $2$, there are always at least four good integers. (c) Show that there are infinitely many sequences of seven consecutive good integers.

On a circular board there are $19$ squares numbered in order from $1$ to $19$ (to the right of $1$ is $2$, to the right of it is $3$, and so on, until $1$ is to the right of $19$). In each box there is a token. Every minute each checker moves to its right the number of the box it is in at that moment plus one; for example, the piece that is in the $7$th place leaves the first minute $7 + 1$ places to its right until the $15$th square; the second minute that same checker moves to your right $15 + 1$ places, to square $12$, etc. Determine if at some point all the tokens reach the place where they started and, if so, say how many minutes must elapse. [hide=original wording]En un tablero circular hay 19 casillas numeradas en orden del 1 al 19 (a la derecha del 1 está el 2, a la derecha de éste está el 3 y así sucesivamente, hasta el 1 que está a la derecha del 19). En cada casilla hay una ficha. Cada minuto cada ficha se mueve a su derecha el número de la casilla en que se encuentra en ese momento más una; por ejemplo, la ficha que está en el lugar 7 se va el primer minuto 7 + 1 lugares a su derecha hasta la casilla 15; el segundo minuto esa misma ficha se mueve a su derecha 15 + 1 lugares, hasta la casilla 12, etc. Determinar si en algún momento todas las fichas llegan al lugar donde empezaron y, si es así, decir cuántos minutos deben transcurrir.[/hide]

Let $p$ be a prime number greater than $3$. Prove that the sum $1^{p+2} + 2^{p+2} + ...+ (p-1)^{p+2}$ is divisible by $p^2$.

A flea jumps in a straight numbered line. It jumps first from point $0$ to point $1$. Afterwards, if its last jump was from $A$ to $B$, then the next jump is from $B$ to one of the points $B + (B - A) - 1$, $B + (B - A)$, $B + (B-A) + 1$. Prove that if the flea arrived twice at the point $n$, $n$ positive integer, then it performed at least $\lceil 2\sqrt n\rceil$ jumps.

Find all functions $f: \mathbb{Z}^+\to \mathbb{R}$, which satisfies $f(n+1)\geq f(n)$ for all $n\geq 1$ and $f(mn)=f(m)f(n)$ for all $(m,n)=1$.

Two regular square pyramids have all edges $12$ cm in length. The pyramids have parallel bases and those bases have parallel edges, and each pyramid has its apex at the center of the other pyramid's base. What is the total number of cubic centimeters in the volume of the solid of intersection of the two pyramids?

Ten test papers are to be prepared for the National Olympiad. Each paper has 4 problems, and no two papers have more than 1 problem in common. At least how many problems are needed?

At a maths contest $n$ books are given as prizes to $n$ students (each students gets one book). In how many ways can the organisers give these prizes if they have $n$ copies of one book and $2n+1$ other books each in one copy?

Let $E$ and $F$ be points on side $BC$ of a triangle $\vartriangle ABC$. Points $K$ and $L$ are chosen on segments $AB$ and $AC$, respectively, so that $EK \parallel AC$ and $FL \parallel AB$. The incircles of $\vartriangle BEK$ and $\vartriangle CFL$ touches segments $AB$ and $AC$ at $X$ and $Y$ , respectively. Lines $AC$ and $EX$ intersect at $M$, and lines $AB$ and $FY$ intersect at $N$. Given that $AX = AY$, prove that $MN \parallel BC$.

This problem is generalization of [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=5918]this one[/url]. Suppose $G$ is a graph and $S\subset V(G)$. Suppose we have arbitrarily assign real numbers to each element of $S$. Prove that we can assign numbers to each vertex in $G\backslash S$ that for each $v\in G\backslash S$ number assigned to $v$ is average of its neighbors.

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$.

Let \( m \) and \( n \) be positive integers. Kellem and Carmen play the following game: initially, the number $0$ is on the board. Starting with Kellem and alternating turns, they add powers of \( m \) to the previous number on the board, such that the new value on the board does not exceed \( n \). The player who writes \( n \) wins. Determine, for each pair \( (m, n) \), who has the winning strategy. [b]Note:[/b] A power of \( m \) is a number of the form \( m^k \), where \( k \) is a non-negative integer.

Kelvin the Frog has a pair of standard fair $8$-sided dice (each labelled from $1$ to $8$). Alex the sketchy Kat also has a pair of fair $8$-sided dice, but whose faces are labelled differently (the integers on each Alex's dice need not be distinct). To Alex's dismay, when both Kelvin and Alex roll their dice, the probability that they get any given sum is equal! Suppose that Alex's two dice have $a$ and $b$ total dots on them, respectively. Assuming that $a \neq b$, find all possible values of $\min \{a,b\}$.

A point $M$ is chosen inside the square $ABCD$ in such a way that $\angle MAC = \angle MCD = x$ . Find $\angle ABM$.

There are some people in a meeting; each doesn't know at least 56 others, and for any pair, there exist a third one who knows both of them. Can the number of people be 65?

$n$ symbols line up in a row, numbered as $1,2,...,n$ from left to right. Delete every symbol with squared numbers. Renumber the rest from left to right. Repeat the process until all $n$ symbols are deleted. Let $f(n)$ be the initial number of the last symbol deleted. Find $f(n)$ in terms of $n$ and find $f(2019)$.

In every cell of a board $101 \times 101$ is written a positive integer. For any choice of $101$ cells from different rows and columns, their sum is divisible by $101$. Show that the number of ways to choose a cell from each row of the board, so that the total sum of the numbers in the chosen cells is divisible by $101$, is divisible by $101$.

A natural number $n$ is called "good" if there exists natural numbers $a$ and $b$ such that $a+b=n$ and $ab \mid n^2+n+1$. Show that there are infinitely many "good" numbers

There are $2024$ people, which are knights and liars and some of them are friends. Every person is asked for the number of their friends and the answers were $0,1, \ldots, 2023$. Every knight answered truthfully, while every liar changed the real answer by exactly $1$. What is the minimal number of liars?

Let $n$ be a natural number. Prove that \[ \left\lfloor \frac{n+2^0}{2^1} \right\rfloor + \left\lfloor \frac{n+2^1}{2^2} \right\rfloor +\cdots +\left\lfloor \frac{n+2^{n-1}}{2^n}\right\rfloor =n. \] [hide="Remark"]For any real number $x$, the number $\lfloor x \rfloor$ represents the largest integer smaller or equal with $x$.[/hide]

Solve the equation: $| z |- 2 = 1 + 2 i$, where $| r |$ is the modulus of a complex number $z$.

Bart, Lisa and Maggie play the following game: Bart colors finitely many points red or blue on a circle such that no four colored points can be chosen on the circle such that their colors are blue-red-blue-red (the four points do not have to be consecutive). Lisa chooses finitely many of the colored points. Now Bart gives the circle (possibly rotated) to Maggie with Lisa's chosen points, however, without their colors. Finally, Maggie colors all the points of the circle to red or blue. Lisa and Maggie wins the game, if Maggie correctly guessed the colors of Bart's points. A strategy of Lisa and Maggie is called a winning strategy, if they can win the game for all possible colorings by Bart. Prove that Lisa and Maggie have a winning strategy, where Lisa chooses at most $c$ points in all possible cases, and find the smallest possible value of $c$. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

The only pieces on an $8\times8$ chessboard are three rooks. Each moves along a row or a column without running to or jumping over another rook. The white rook starts at the bottom left corner, the black rook starts in the square directly above the white rook, and the red rook starts in the square directly to the right of the white rook. The white rook is to finish at the top right corner, the black rook in the square directly to the left of the white rook, and the red rook in the square directly below the white rook. At all times, each rook must be either in the same row or the same column as another rook. Is it possible to get the rooks to their destinations?