In a school with some students, for any three student, there exists at least one student who are friends with all these three students.(Friendships are mutual) For any friends $A$ and $B$, any two of their common friends are also friends with each other. It's not possible to partition these students into two groups, such that every student in each group are friends with all the students in the other gruop. Prove that any two people who aren't friends with each other, has the same number of common friends.(Each person is a friend of him/herself.)

A group of the pupils in a class are called [i]dominant[/i] if any other pupil from the class has a friend in the group. If it is known that there exist at least 100 dominant groups, prove that there exists at least one more dominant group. (proposed by B. Batbayasgalan, inspired by Komal problem)

Given $ n$ points arbitrarily in the plane $ P_{1},P_{2},\ldots,P_{n},$ among them no three points are collinear. Each of $ P_{i}$ ($1\le i\le n$) is colored red or blue arbitrarily. Let $ S$ be the set of triangles having $ \{P_{1},P_{2},\ldots,P_{n}\}$ as vertices, and having the following property: for any two segments $ P_{i}P_{j}$ and $ P_{u}P_{v},$ the number of triangles having $ P_{i}P_{j}$ as side and the number of triangles having $ P_{u}P_{v}$ as side are the same in $ S.$ Find the least $ n$ such that in $ S$ there exist two triangles, the vertices of each triangle having the same color.

Find all sets $ A$ of nonnegative integers with the property: if for the nonnegative intergers $m$ and $ n $ we have $m+n\in A$ then $m\cdot n\in A.$

We color all points of a plane using $3$ colors. Prove that there are at least two points of the plane having same colours and with distance among them $1$.

$100$ children stand in a line each having $100$ candies. In one move, one of them may take some of their candies and distribute them to a non-empty set of the remaining children. After what least number of moves can it happen that no two children have the same number of candies? [i](N. Chernyatevya)[/i] (Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])

For which integers $n \geq 4$ is the following procedure possible? Remove one number of the integers $1,2,3,\dots,n+1$ and arrange them in a sequence $a_1,a_2,\dots,a_n$ such that of the $n$ numbers \[ |a_1-a_2|,|a_2-a_3|,\dots,|a_{n-1}-a_n|,|a_n-a_1| \] no two are equal.

Find the number of representations of the number $180$ in the form $180 =x+y+z$, where $x, y, z$ are positive integers that are proportional with some three consecutive positive integers

Let $d$ be a real number such that $d^2=r^2+s^2$, where $r$ and $s$ are rational numbers. Prove that we can color all points of the plane with rational coordinates with two different colors such that the points with distance $d$ have different colors.

Let $ n$ and $ k$ be given natural numbers, and let $ A$ be a set such that \[ |A| \leq \frac{n(n+1)}{k+1}.\] For $ i=1,2,...,n+1$, let $ A_i$ be sets of size $ n$ such that \[ |A_i \cap A_j| \leq k \;(i \not=j)\ ,\] \[ A= \bigcup_{i=1}^{n+1} A_i.\] Determine the cardinality of $ A$. [i]K. Corradi[/i]

Let $n\ge 2$ be positive integer. Find the least possible number of elements of tile set $A =\{1,2,...,2n-1,2n\}$ that should be deleted in order to the sum of any two different elements remained be a composite number.

Suppose that $1000$ students are standing in a circle. Prove that there exists an integer $k$ with $100 \leq k \leq 300$ such that in this circle there exists a contiguous group of $2k$ students, for which the first half contains the same number of girls as the second half. [i]Proposed by Gerhard Wöginger, Austria[/i]

Find all pairs of positive integers $(m,n)$ such that one can partition a $m\times n$ board with $1\times 2$ or $2\times 1$ dominoes and draw one of the diagonals on each of the dominos so that none of the diagonals share endpoints.

On a board there are written the integers from $1$ to $119$. Two players, $A$ and $B$, make a move by turn. A $move$ consists in erasing $9$ numbers from the board. The player after whose move two numbers remain on the board wins and his score is equal with the positive difference of the two remaining numbers. The player $A$ makes the first move. Find the highest integer $k$, such that the player $A$ can be sure that his score is not smaller than $k$.

[b]p4.[/b] What is gcd $(2^6 - 1, 2^9 - 1)$? [b]p5.[/b] Sarah is walking along a sidewalk at a leisurely speed of $\frac12$ m/s. Annie is some distance behind her, walking in the same direction at a faster speed of $s$ m/s. What is the minimum value of $s$ such that Sarah and Annie spend no more than one second within one meter of each other? [b]p6.[/b] You have a choice to play one of two games. In both games, a coin is flipped four times. In game $1$, if (at least) two flips land heads, you win. In game $2$, if (at least) two consecutive flips land heads, you win. Let $N$ be the number of the game that gives you a better chance of winning, and let $p$ be the absolute difference in the probabilities of winning each game. Find $N + p$. PS. You should use hide for answers.

Let $n$ be a positive integer. There is a board of $(n + 1) \times (n + 1)$ whose squares are numbered in a diagonal pattern, as as the picture shows. Chepito starts from the lower left square, and moving only up or to the right until he reaches the upper right box. During his tour, Chepito writes down the number of each box on the which made a change of direction, and in the end calculates the sum of all the numbers entered. Determine the maximum value of this sum. [img]https://cdn.artofproblemsolving.com/attachments/e/d/f9dc43092a1407d6fe6f1b2c741af015079946.png[/img]

There are $2016$ different points in the plane. Show that between these points at least $45$ different distances occur.

Martu wants to build a set of cards with the following properties: • Each card has a positive integer on it. • The number on each card is equal to one of $5$ possible numbers. • If any two cards are taken and added together, it is always possible to find two other cards in the set such that the sum is the same. Determine the fewest number of cards Martu's set can have and give an example for that number.

We consider permutations $f$ of the set $\mathbb{N}$ of non-negative integers, i.e. bijective maps $f$ from $\mathbb{N}$ to $\mathbb{N}$, with the following additional properties: \[f(f(x)) = x \quad \mbox{and}\quad \left| f(x)-x\right| \leqslant 3\quad\mbox{for all } x \in\mathbb{N}\mbox{.}\] Further, for all integers $n > 42$, \[\left.M(n)=\frac{1}{n+1}\sum_{j=0}^n \left|f(j)-j\right|<2,011\mbox{.}\right.\] Show that there are infinitely many natural numbers $K$ such that $f$ maps the set \[\left\{ n\mid 0\leqslant n\leqslant K\right\}\] onto itself.

How many ways are there to remove an $11\times11$ square from a $2011\times2011$ square so that the remaining part can be tiled with dominoes ($1\times 2$ rectangles)?

Set $S$ to be a subset of size $68$ of $\{1,2,...,2015\}$. Prove that there exist $3$ pairwise disjoint, non-empty subsets $A,B,C$ such that $|A|=|B|=|C|$ and $\sum_{a\in A}a=\sum_{b\in B}b=\sum_{c\in C}c$

For each positive real number $\alpha$, define $$\lfloor \alpha \mathbb{N}\rfloor :=\{\lfloor \alpha m \rfloor\; |\; m\in \mathbb{N}\}.$$ Let $n$ be a positive integer. A set $S\subseteq \{1,2,\ldots,n\}$ has the property that: for each real $\beta >0$, $$ \text{if}\; S\subseteq \lfloor \beta \mathbb{N} \rfloor, \text{then}\; \{1,2,\ldots,n\} \subseteq \lfloor \beta\mathbb{N}\rfloor.$$ Determine, with proof, the smallest positive size of $S$.

Let $k$ and $N$ be positive real numbers which satisfy $k\leq N$. For $1\leq i \leq k$, there are subsets $A_i$ of $\{1,2,3,\ldots,N\}$ that satisfy the following property. For arbitrary subset of $\{ i_1, i_2, \ldots , i_s \} \subset \{ 1, 2, 3, \ldots, k \} $, $A_{i_1} \triangle A_{i_2} \triangle ... \triangle A_{i_s}$ is not an empty set. Show that a subset $\{ j_1, j_2, .. ,j_t \} \subset \{ 1, 2, ... ,k \} $ exist that satisfies $n(A_{j_1} \triangle A_{j_2} \triangle \cdots \triangle A_{j_t}) \geq k$. ($A \triangle B=A \cup B-A \cap B$)

Let $n$ be a natural number. There are $6n + 4$ mathematicians at the conference. $2n+1$ meetings are held. On every meeting mathematicians are sitting at one table with $4$ chairs and $n$ tables with $6$ chairs. Distances between each two adjacent chairs are equal. Two mathematicians sit in $special$ position if they sit at the same table and they are adjacent or diametrically opposite. For which natural numbers $n$ is possible that after end of all meetings every 2 mathematicians are sitting at the $special$ position less than 2 times.

Two players $A$ and $B$ play alternatively in a convex polygon with $n \geq 5$ sides. In each turn, the corresponding player has to draw a diagonal that does not cut inside the polygon previously drawn diagonals. A player loses if after his turn, one quadrilateral is formed such that its two diagonals are not drawn. $A$ starts the game. For each positive integer $n$, find a winning strategy for one of the players.