An $ (n, k) \minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that: $ (i)$ Each player plays in each round, and every two players meet at most once. $ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$. Determine all pairs $ (n, k)$ for which there exists an $ (n, k) \minus{}$ tournament. [i]Proposed by Carlos di Fiore, Argentina[/i]

The figure obtained by removing one small unit square from the $2\times 2$ grid table is called an $L$ ''shape". .Put $k$ L-shapes in an $8\times 8$ grid table. Each $L$-shape can be rotated, but each $L$ shape is required to cover exactly three small unit squares in the grid table, and the common area covered by any two $L$ shapes is $0$, and except for these $k$ $L$ shapes, no other $L$ shapes can be placed. Find the minimum value of $k$.

In a triangle scalene $ABC$, let $I$ be its incenter and $D$ the intersection of $AI$ and $BC$. Let $M$ and $N$ points where the incircle touches $AB$ and $AC$, respectively. Let $F$ be the second intersection of the circumcircle $(AMN)$ with the circumcircle $(ABC)$. Let $T$ the intersection of $AF$ and $BC$. Let $J$ be the intersection of $TI$ with the line parallel of $FI$ that passes through $D$. Prove that the line $AJ$ is perpendicular to $BC$.

For what values o f $n$ is it possible to place the integers from $1$ to $n$ inclusive on a circle (not necessarily in order) so that the sum of any two successive integers in the circle is divisible by the next one in the clockwise order? (A Shapovalov)

Let $a,b,c,d,x,y$ denote the lengths of the sides $AB, BC,CD,DA$ and the diagonals $AC,BD$ of a cyclic quadrilateral $ABCD$ respectively. Prove that $$(\frac{1}{a}+\frac{1}{c})^2+(\frac{1}{b}+\frac{1}{d})^2 \geq 8 ( \frac{1}{x^2}+\frac{1}{y^2})$$

Prove that for any triangle the bisector lies between the median and the height drawn from the same vertex.

Determine all pairs $(a,b)$ of non-negative integers, such that $a^b+b$ divides $a^{2b}+2b$. (Remark: $0^0=1$.)

$S={1,2,...,1000}$ and $T'=\left\{ 1001-t|t \in T\right\}$. A set $P$ satisfies the following three conditions: $1.$ All elements of $P$ are a subset of $S$. $2. A,B \in P \Rightarrow A \cap B \neq \O$ $3. A \in P \Rightarrow A' \in P$ Find the maximum of $|P|$.

In a meeting of $4042$ people, there are $2021$ couples, each consisting of two people. Suppose that $A$ and $B$, in the meeting, are friends when they know each other. For a positive integer $n$, each people chooses an integer from $-n$ to $n$ so that the following conditions hold. (Two or more people may choose the same number). [list] [*] Two or less people chose $0$, and if exactly two people chose $0$, they are coupled. [*] Two people are either coupled or don't know each other if they chose the same number. [*] Two people are either coupled or know each other if they chose two numbers that sum to $0$. [/list] Determine the least possible value of $n$ for which such number selecting is always possible.

Solve the system $\begin {cases} 16x^3 + 4x = 16y + 5 \\ 16y^3 + 4y = 16x + 5 \end{cases}$

Let $n$ be a positive integer. On a board consisting of $4n \times 4n$ squares, exactly $4n$ tokens are placed so that each row and each column contains one token. In a step, a token is moved horizontally of vertically to a neighbouring square. Several tokens may occupy the same square at the same time. The tokens are to be moved to occupy all the squares of one of the two diagonals. Determine the smallest number $k(n)$ such that for any initial situation, we can do it in at most $k(n)$ steps.

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

The sequence $x_1,x_2, ...$ is defined by the following equations: $$x_1=19, \ \ x_2=97, \ \ x_{n+2} =x_n - \frac{1}{x_{n+1}}$$ for $n \ge 1$. Prove that there exists a positive integer $k$ such that $x_k=0$ and find $k$. (A Berzinsh)

We consider an integer $n \ge 3,$ the set $S=\{1,2,3,\ldots,n\}$ and the set $\mathcal{F}$ of the functions from $S$ to $S.$ We say that $\mathcal{G} \subset \mathcal{F}$ is a generating set for $\mathcal{H} \subset \mathcal{F}$ if any function in $\mathcal{H}$ can be represented as a composition of functions from $\mathcal{G}.$ a) Let the functions $a:S \to S,$ $a(n-1)=n,$ $a(n)=n-1$ and $a(k)=k$ for $k \in S \setminus \{n-1,n\}$ and $b:S \to S,$ $b(n)=1$ and $b(k)=k+1$ for $k \in S \setminus \{n\}.$ Prove that $\{a,b\}$ is a generating set for the set $\mathcal{B}$ of bijective functions of $\mathcal{F}.$ b) Prove that the smallest number of elements that a generating set of $\mathcal{F}$ has is $3.$

Suppose that a triangle $ABC$ with incenter $I$ satisfies $CA+AI=BC$. Find the ratio between the measures of the angles $\angle BAC$ and $\angle CBA$.

Let $ABCD$ be a convex quadrilateral with $m(\widehat{ADC}) = 90^{\circ}$. The line through $D$ which is parallel to $BC$ meets $AB$ at $E$. If $m(\widehat{DAC}) = m(\widehat{DAE})$, $|AB|=3$ and $|AC|=4$, then $|AE| = ?$ $\textbf{(A)}\ \frac56 \qquad\textbf{(B)}\ \frac13 \qquad\textbf{(C)}\ \frac12 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \frac34$