On the real number line, paint red all points that correspond to integers of the form $81x+100y$, where $x$ and $y$ are positive integers. Paint the remaining integer point blue. Find a point $P$ on the line such that, for every integer point $T$, the reflection of $T$ with respect to $P$ is an integer point of a different colour than $T$.

Let $p$ be a prime number. Determine the largest possible $n$ such that the following holds: it is possible to fill an $n\times n$ table with integers $a_{ik}$ in the $i$th row and $k$th column, for $1\le i,k\le n$, such that for any quadruple $i,j,k,l$ with $1\le i<j\le n$ and $1\le k<l\le n$, the number $a_{ik}a_{jl}-a_{il}a_{jk}$ is not divisible by $p$. [i]Proposed by oneplusone[/i]

There are $n$ guests at a party. Any two guests are either friends or not friends. Every guest is friends with exactly four of the other guests. Whenever a guest is not friends with two other guests, those two other guests cannot be friends with each other either. What are the possible values of $n$?

A rook starts moving on an infinite chessboard, alternating horizontal and vertical moves. The length of the first move is one square, of the second – two squares, of the third – three squares and so on. a) Is it possible for the rook to arrive at its starting point after exactly $2013$ moves? b) Find all $n$ for which it possible for the rook to come back to its starting point after exactly $n$ moves.

For non-empty subsets $A,B \subset \mathbb{Z}$ define \[A+B=\{a+b:a\in A, b\in B\},\ A-B=\{a-b:a\in A, b\in B\}.\] In the sequel we work with non-empty finite subsets of $\mathbb{Z}$. Prove that we can cover $B$ by at most $\frac{|A+B|}{|A|}$ translates of $A-A$, i.e. there exists $X\subset Z$ with $|X|\leq \frac{|A+B|}{|A|}$ such that \[B\subseteq \cup_{x\in X} (x+(A-A))=X+A-A.\]

Let $F$ be the set of all $n-tuples$ $(A_1,A_2,…,A_n)$ such that each $A_i$ is a subset of ${1,2,…,2019}$. Let $\mid{A}\mid$ denote the number of elements o the set $A$ . Find $\sum_{(A_1,…,A_n)\in{F}}^{}\mid{A_1\cup{A_2}\cup...\cup{A_n}}\mid$

Nine points are given on a plane, no three of which lie on a line. Any two of these points are joined by a segment. Is it possible to color these segments by several colors in such a way that, for each color, there are exactly three segments of that color and these three segments form a triangle?

Four grasshoppers sit at the vertices of a square. Every second, one of them jumps over one of the others to the symmetrical point on the other side (if $X$ jumps over $Y$ to the point $X'$, then $X$, $Y$ and $X'$ lie on a straight line and $XY = YX'$). Prove that after several jumps no three grasshoppers can be: (a) on a line parallel to a side of the square, (b) on a straight line. (AK Kovaldzhy)

Let $Z$ shape be a shape such that it covers $(i,j)$, $(i,j+1)$, $(i+1,j+1)$, $(i+2,j+1)$ and $(i+2,j+2)$ where $(i,j)$ stands for cell in $i$-th row and $j$-th column on an arbitrary table. At least how many $Z$ shapes is necessary to cover one $8 \times 8$ table if every cell of a $Z$ shape is either cell of a table or it is outside the table (two $Z$ shapes can overlap and $Z$ shapes can rotate)?

Let be given a convex polyhedron whose all faces are triangular. The vertices of the polyhedron are colored using three colors. Prove that the number of faces with vertices in all the three colors is even.

Robert is a robot who can move freely on the unit circle and its interior, but is attached to the origin by a retractable cord such that at any moment the cord lies in a straight line on the ground connecting Robert to the origin. Whenever his movement is counterclockwise (relative to the origin), the cord leaves a coating of black paint on the ground, and whenever his movement is clockwise, the cord leaves a coating of orange paint on the ground. The paint is dispensed regardless of whether there is already paint on the ground. The paints covers $1$ gallon/unit $^2$, and Robert starts at $(1, 0)$. Each second, he moves in a straight line from the point $(\cos(\theta),\sin(\theta))$ to the point $(\cos(\theta+a),\sin(\theta+a))$, where a changes after each movement. a starts out as $253^o$ and decreases by $2^o$ each step. If he takes $89$ steps, then the difference, in gallons, between the amount of black paint used and orange paint used can be written as $\frac{\sqrt{a}- \sqrt{b}}{c} \cot 1^o$, where $a, b$ and $c$ are positive integers and no prime divisor of $c$ divides both $a$ and $b$ twice. Find $a + b + c$.

How many ways are there to line up $19$ girls (all of different heights) in a row so that no girl has a shorter girl both in front of and behind her?

Milly chooses a positive integer $n$ and then Uriel colors each integer between $1$ and $n$ inclusive red or blue. Then Milly chooses four numbers $a, b, c, d$ of the same color (there may be repeated numbers). If $a+b+c= d$ then Milly wins. Determine the smallest $n$ Milly can choose to ensure victory, no matter how Uriel colors.

Numbers $1, 2, 3, . . . , 100$ are arranged in a circle in some order. A [i]good pair[/i] is a pair of numbers of the same parity, between which there are exactly $3$ numbers. What is the smallest possible number good pairs?

Given a $20 \times 25$ board whose rows are numbered from $1$ to $20$ and whose columns are numbered from $1$ to $25$, Nikita wishes to place one precious stone in some cells of this board so that at least one stone is present and the following magical condition holds: for any $1 \leqslant i \leqslant 20$ and $1 \leqslant j \leqslant 25$, there is a stone in the cell at the intersection of the $i^\text{th}$ row and the $j^\text{th}$ column if and only if the cross formed by the union of the $i^\text{th}$ row and the $j^\text{th}$ column contains exactly $i + j$ stones. Determine whether Nikita's wish is achievable.

Let $n$ be a positive integer. In the $\mathit{philand}$ language, words are all finite sequences formed by the letters "$P$", "$H$" and "$I$". Philipe, who speaks only the $\mathit{philand}$ language, writes the word $PHIPHI\ldots PHI$ on a piece of paper, where $PHI$ is repeated $n$ times. He can do the following operations: • Erase two identical letters and write in their place two different letters from the original and from each other; (Ex: $PP\rightarrow HI$) • Erase two distinct letters and rewrite them changing the order in which they appear; (Ex: $PI\rightarrow IP$) • Erase two distinct letters and write the letter distinct from the two he erased. (Ex: $PH\rightarrow I$) Find the largest integer $C$ such that any Philandese word of up to $C$ letters can be written by Philip through the above operations. Note: Operations are taken on adjacent letters.

For a sequence with some ones and zeros, we count the number of continuous runs of equal digits in it. (For example the sequence $011001010$ has $7$ continuous runs: $0,11,00,1,0,1,0$.) Find the sum of the number of all continuous runs for all possible sequences with $2019$ ones and $2019$ zeros.

$6$ indistinguishable coins are given, $4$ are authentic, all of the same weight, and $2$ are false, one is more light than the real ones and the other one, heavier than the real ones. The two false ones together weigh same as two authentic coins. Find two authentic coins using a balance scale twice only by two plates, no weights. Clarification: A two-pan scale only reports if the left pan weighs more, equal or less that right.

Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$. (a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$. (b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good

Given a regular $2013$-sided polygon, how many isosceles triangles are there whose vertices are vertices vertex of given polygon and haave an angle greater than $120^o$? Nguyen Tien Lam, High School for Natural Science,Hanoi National University.

For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$. (i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$. (ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$. (The number $|P|$ is the size of set $P$) [i]Dan Schwarz, Romania[/i]

Let two glasses, numbered $1$ and $2$, contain an equal quantity of liquid, milk in glass $1$ and coffee in glass $2$. One does the following: Take one spoon of mixture from glass $1$ and pour it into glass $2$, and then take the same spoon of the new mixture from glass $2$ and pour it back into the first glass. What happens after this operation is repeated $n$ times, and what as $n$ tends to infinity?

Let $S = \{-17, -16, ..., 16, 17\}$. We call a subset $T$ of $S$ a good set if $-x \in T$ for all $x \in T$ and if $x, y, z \in T (x, y, z$ may be equal) then $x + y + z \ne 0$. Find the largest number of elements in a good set.

p1. Given the set $H = \{(x, y)|(x -y)^2 + x^2 - 15x + 50 = 0$ where x and y are natural numbers $\}$. Find the number of subsets of $H$. p2. A magician claims to be an expert at guessing minds with following show. One of the viewers was initially asked to hidden write a five-digit number, then subtract it with the sum of the digits that make up the number, then name four of the five digits that make up the resulting number (in order of any). Then the magician can guess the numbers hidden. For example, if the audience mentions four numbers result: $0, 1, 2, 3$, then the magician will know that the hidden number is $3$. a. Give an example of your own from the above process. b. Explain mathematically the general form of the process. p3. In a fruit basket there are $20$ apples, $18$ oranges, $16$ mangoes, $10$ pineapples and $6$ papayas. If someone wants to take $10$ pieces from the basket. After that, how many possible compositions of fruit are drawn? p4. Inside the Equator Park, a pyramid-shaped building will be made with base of an equilateral triangle made of translucent material with a side length of the base $8\sqrt3$ m long and $8$ m high. A globe will be placed in a pyramid the. Ignoring the thickness of the pyramidal material, determine the greatest possible length of the radius of the globe that can be made. p5. What is the remainder of $2012^{2012} + 2014^{2012}$ divided by $2013^2$?

Suppose there are $n$ points on the plane, no three of which are collinear. Draw $n-1$ non-intersecting segments (except possibly at endpoints) between pairs of points, such that it is possible to travel between any two points by travelling along the segments. Such a configuration of points and segments is called a [i]network[/i]. Given a network, we may assign labels from $1$ to $n-1$ to each segment such that each segment gets a different label. Define a [i]spin[/i] as the following operation: $\bullet$ Choose a point $v$ and rotate the labels of its adjacent segments clockwise. Formally, let $e_1,e_2,\cdots,e_k$ be the segments which contain $v$ as an endpoint, sorted in clockwise order (it does not matter which segment we choose as $e_1$). Then, the label of $e_{i+1}$ is replaced with the label of $e_{i}$ simultaneously for all $1 \le i \le k$. (where $e_{k+1}=e_{1}$) A network is [i]nontrivial[/i] if there exists at least $2$ points with at least $2$ adjacent segments each. A network is [i]versatile[/i] if any labeling of its segments can be obtained from any initial labeling using a finite amount of spins. Find all integers $n \ge 5$ such that any nontrivial network with $n$ points is versatile. [i]Proposed by Yeoh Zi Song[/i]