Suppose $a_i, b_i, c_i, i=1,2,\cdots ,n$, are $3n$ real numbers in the interval $\left [ 0,1 \right ].$ Define $$S=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k<1 \right \}, \; \; T=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k>2 \right \}.$$ Now we know that $\left | S \right |\ge 2018,\, \left | T \right |\ge 2018.$ Try to find the minimal possible value of $n$.

Fix $2n$ distinct reals $x_1,y_1,...,x_n,y_n$ and dene the $n\times n$ matrix where its $(i, j)$-th element is $x_i + y_j$ for all $i, j = 1,..., n$. Show that if the products of the numbers in each column is always the same, then also the products of the numbers in each row is always the same. ( Alberto Alfarano)

Let $P$ be a regular polygon with $ 4k + 1 $ sides (where $ k $ is a natural) whose vertices are $ A_1, A_2, ..., A_ {4k + 1} $ (in that order ). Each vertex $ A_j $ of $P$ is assigned a natural of the set $ \{1,2, ..., 4k + 1 \} $ such that no two vertices are assigned the same number. On $P$ the following operation is performed: Let $ B_j $ be the midpoint of the side $ A_jA_ {j + 1} $ for $ j = 1,2, ..., 4k + 1 $ (where is consider $ A_ {4k + 2} = A_1 $). If $ a $, $ b $ are the numbers assigned to $ A_ {j} $ and $ A_ {j + 1} $, respectively, the midpoint $ B_j $ is written the number $ 7a-3b $. By doing this with each of the $ 4k + 1 $ sides, the $ 4k + 1 $ vertices initially arranged are erased. We will say that a natural $ m $ is [i]fatal [/i] if for all natural $ k $ , no matter how the vertices of $P$ are initially arranged, it is impossible to obtain $ 4k + 1 $ equal numbers through a finite amount of operations from $ m $. a) Determine if the $ 2010 $ is fatal or not. Justify. b) Prove that there are infinite fatal numbers. [color=#f00]PS. A help in translation of the 2nd paragraph is welcome[/color]. [hide=Original wording]Diremos que un natural $m$ es fatal si no importa cómo se disponen inicialmente los vértices de ${P}$, es imposible obtener mediante una cantidad finita de operaciones $4k+1$ números iguales a $m$.[/hide]

Let $S$ be a set of $n$ distinct real numbers, and $A_S$ set of arithemtic means of two distinct numbers from $S$. For given $n \geq 2$ find minimal number of elements in $A_S$

An array $ (a_1,a_2,...,a_{13})$ of $ 13$ integers is called $ tame$ if for each $ 1 \le i \le 13$ the following condition holds: If $ a_i$ is left out, the remaining twelve integers can be divided into two groups with the same sum of elements. A tame array is called $ turbo$ $ tame$ if the remaining twelve numbers can always be divided in two groups of six numbers having the same sum. $ (a)$ Give an example of a tame array of $ 13$ integers (not all equal). $ (b)$ Prove that in a tame array all numbers are of the same parity. $ (c)$ Prove that in a turbo tame array all numbers are equal.

At an international conference there are four official languages. Any two participants can speak in one of these languages. Show that at least $60\%$ of the participants can speak the same language. [i]Mihai Baluna[/i]

Mattis is hosting a badminton tournament for $40$ players on $20$ courts numbered from $1$ to $20$. The players are distributed with $2$ players on each court. In each round a winner is determined on each court. Afterwards, the player who lost on court $1$, and the player who won on court $20$ stay in place. For the remaining $38$ players, the winner on court $i$ moves to court $i + 1$ and the loser moves to court $i - 1$. The tournament continues until every player has played every other player at least once. What is the minimal number of rounds the tournament can last?

Given $2015$ subsets $A_1, A_2,...,A_{2015}$ of the set $\{1, 2,..., 1000\}$ such that $|A_i| \ge 2$ for every $i \ge 1$ and $|A_i \cap A_j| \ge 1$ for every $1 \le i < j \le 2015$. Prove that $k = 3$ is the smallest number of colors such that we can always color the elements of the set $\{1, 2,..., 1000\}$ by $k$ colors with the property that the subset $A_i$ has at least two elements of different colors for every $i \ge 1$. Lê Anh Vinh

In a deck of $n > 1$ cards, some digits from $1$ to$8$are written on each card. A digit may occur more than once, but at most once on a certain card. On each card at least one digit is written, and no two cards are denoted by the same set of digits. Suppose that for every $k=1,2,\dots,7$ digits, the number of cards that contain at least one of them is even. Find $n$.

Prove that there exists some positive real number $\lambda$ such that for any $D_{>1}\in\mathbb{R}$, one can always find an acute triangle $\triangle ABC$ in the Cartesian plane such that [list] [*] $A, B, C$ lie on lattice points; [*] $AB, BC, CA>D$; [*] $S_{\triangle ABC}<\frac{\sqrt 3}{4}D^2+\lambda\cdot D^{4/5}$.

Diagonals of a $1$ by $1$ square are arranged in an $8$ by $8$ table (one in each $1$ by $1 $ square). Consider the union $W$ of all $64$ diagonals drawn. The set $W$ consists of several connected pieces (two points belong to the same piece if and only if W contains a path between them). Can the number of the pieces be greater than (a) $15$, (b) $20$? (NB Vassiliev)

Given $n$ points in a circle, Arnaldo write 0 or 1 in all the points. Bernado can do a operation, he can chosse some point and change its number and the numbers of the points on the right and left side of it. Arnaldo wins if Bernado can´t change all the numbers in the circle to 0, and Bernado wins if he can a) Show that Bernado can win if $n=101$ b) Show that Arnaldo wins if $n=102$

Prove that if a quadrilateral $ABCD$ can be cut into a finite number of parallelograms, then $ABCD$ is a parallelogram.

In how many ways can one select eight integers $a_1,a_2, ... ,a_8$, not necesarily distinct, such that $1 \le a_1 \le ... \le a_8 \le 8$?

Given a polyhedron $P$. Mikita claims that he can write one integer on each face of $P$ such that not all the written numbers are zeros, and for each vertex $V$ of $P$ the sum of numbers on faces containing $V$ is equals to 0. Matvei claims that he can write one integer in each vertex of $P$ such that not all the written numbers are zeros, and for each face $F$ of $P$ the sum of numbers in vertices belonging to $F$ is equals to 0. Show that if the number of edges of polyhedron $P$ is odd, then at least one of the boys is right.

There are $10001$ students at an university. Some students join together to form several clubs (a student may belong to different clubs). Some clubs join together to form several societies (a club may belong to different societies). There are a total of $k$ societies. Suppose that the following conditions hold: [i]i.)[/i] Each pair of students are in exactly one club. [i]ii.)[/i] For each student and each society, the student is in exactly one club of the society. [i]iii.)[/i] Each club has an odd number of students. In addition, a club with ${2m+1}$ students ($m$ is a positive integer) is in exactly $m$ societies. Find all possible values of $k$. [i]Proposed by Guihua Gong, Puerto Rico[/i]

Let $n$ be a positive integer. On a blackboard, Bobo writes a list of $n$ non-negative integers. He then performs a sequence of moves, each of which is as follows: -for each $i = 1, . . . , n$, he computes the number $a_i$ of integers currently on the board that are at most $i$, -he erases all integers on the board, -he writes on the board the numbers $a_1, a_2,\ldots , a_n$. For instance, if $n = 5$ and the numbers initially on the board are $0, 7, 2, 6, 2$, after the first move the numbers on the board will be $1, 3, 3, 3, 3$, after the second they will be $1, 1, 5, 5, 5$, and so on. (a) Show that, whatever $n$ and whatever the initial configuration, the numbers on the board will eventually not change any more. (b) As a function of $n$, determine the minimum integer $k$ such that, whatever the initial configuration, moves from the $k$-th onwards will not change the numbers written on the board.

Hugo places a chess piece on the top left square of a $20 \times 20$ chessboard and makes $10$ moves with it. On each of these $10$ moves, he moves the piece either one square horizontally (left or right) or one square vertically (up or down). After the last move, he draws an $X$ on the square that the piece occupies. When Hugo plays the game over and over again, what is the largest possible number of squares that could eventually be marked with an $X$? Prove that your answer is correct.

a.) For all positive integer $k$ find the smallest positive integer $f(k)$ such that $5$ sets $s_1,s_2, \ldots , s_5$ exist satisfying: [b]i.[/b] each has $k$ elements; [b]ii.[/b] $s_i$ and $s_{i+1}$ are disjoint for $i=1,2,...,5$ ($s_6=s_1$) [b]iii.[/b] the union of the $5$ sets has exactly $f(k)$ elements. b.) Generalisation: Consider $n \geq 3$ sets instead of $5$.

Paul and his pet octahedron like to play games together. For this game, the octahedron randomly draws an arrow on each of its faces pointing to one of its three edges. Paul then randomly chooses a face and progresses from face to adjacent face, as determined by the arrows on each face, and he wins if he reaches every face of the octahedron. What is the probability that Paul wins?

A finite number of chords is drawn in a circle $1$ cm in diameter so that any diameter of the circle intersects at most $N$ of these chords. Prove that the sum of the lengths of all chords is less than $3.15 \cdot N$ cm.

There is a board with $n$ rows and $4$ columns, and white, yellow and light blue chips. Player $A$ places four tokens on the first row of the board and covers them so Player $B$ doesn't know them. How should player $B$ do to fill the minimum number of rows with chips that will ensure that in any of the rows he will have at least three hits? Clarification: A hit by player $B$ occurs when he places a token of the same color and in the same column as $A$.

At least how many regular triangles are needed to cover the lines of the following diagram? [img]https://cdn.artofproblemsolving.com/attachments/e/3/4de2ed2c7cc9421d7d060f0bc537ccaa3838fc.png[/img] (Only the perimeter of the triangles is involved in the covering, and the entire perimeter need not be incident on the diagram.)

Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]

Given the $6$ digits: $0, 1, 2, 3, 4, 5$. Find the sum of all even four-digit numbers which can be expressed with the help of these figures (the same figure can be repeated).