Let $A_1, A_2, ..., A_k$ be $5$-element subsets of set $\{1, 2, ..., 23\}$ such that, for all $1 \le i < j \le k$ set $A_i \cap A_j$ has at most three elements. Show that $k \le 2018$.

If $(A, <)$ is a partially ordered set, its dimension, $\dim (A, <)$, is the least cardinal $\kappa$ such that there exist $\kappa$ total orderings $\{ <_{\alpha} \colon \alpha < \kappa \}$ on $A$ with $<=\cap_{\alpha < \kappa} <_\alpha$. Show that if $\dim (A, <)>\aleph_0$, then there exist disjoint $A_0, A_1\subseteq A$ with $\dim (A_0, <)$, $\dim (A_1, <)>\aleph_0$. [D. Kelly, A. Hajnal, B. Weiss]

Suppose $A_1,A_2,\cdots ,A_n \subseteq \left \{ 1,2,\cdots ,2018 \right \}$ and $\left | A_i \right |=2, i=1,2,\cdots ,n$, satisfying that $$A_i + A_j, \; 1 \le i \le j \le n ,$$ are distinct from each other. $A + B = \left \{ a+b|a\in A,\,b\in B \right \}$. Determine the maximal value of $n$.

Determine the greatest natural number $n$, such that for each set $S$ of 2015 different integers there exist 2 subsets of $S$ (possible to be with 1 element and not necessarily non-intersecting) each of which has a sum of its elements divisible by $n$.

For two different prime numbers $p, q$, define $S_{p,q} = \{p,q,pq\}$. If two elements in $S_{p,q}$ are numbers in the form of $x^2 + 2005y^2, (x, y \in Z)$, prove that all three elements in $S_{p,q}$ are in such form.

Can the plane be coloured in 2000 colours so that any nondegenerate circle contains points of all 2000 colors?

Let $n{}$ be a positive integer, and let $\mathcal{C}$ be a collection of subsets of $\{1,2,\ldots,2^n\}$ satisfying both of the following conditions:[list=1] [*]Every $(2^n-1)$-element subset of $\{1,2,\ldots,2^n\}$ is a member of $\mathcal{C}$, and [*]Every non-empty member $C$ of $\mathcal{C}$ contains an element $c$ such that $C\setminus\{c\}$ is again a member of $\mathcal{C}$. [/list]Determine the smallest size $\mathcal{C}$ may have. [i]Serbia, Pavle Martinovic ́[/i]

Show that any two intervals $A, B\subseteq \mathbb R$ of positive lengths can be countably disected into each other, that is, they can be written as countable unions $A=A_1\cup A_2\cup\ldots\,$ and $B=B_1\cup B_2\cup\ldots\,$ of pairwise disjoint sets, where $A_i$ and $B_i$ are congruent for every $i\in \mathbb N$ [Gy. Szabo]

In a city's bus route system, any two routes share exactly one stop, and every route includes at least four stops. Prove that the stops can be classified into two groups such that each route includes stops from each group.

On the VI-th International Festival of Young Mathematicians in Sozopol $n$ teams were participating, each of which was with $k$ participants ($n>k>1$). The organizers of the competition separated the $nk$ participants into $n$ groups, each with $k$ people, in such way that no two teammates are in the same group. Prove that there can be found $n$ participants no two of which are in the same team or group.

Can there be a continuum set of continuum sets such that (i) the intersection of any two is finite, and (ii) every set that intersects all sets intersects any in an infinite set? note: a continuum set is a set that can be put into a 1-to-1 bijection with the reals.

Let $n\geqslant 3$ be a positive integer and $N=\{1,2,\ldots,n\}$ and let $k>0$ be a real number. Let's associate each non-empty of $N{}$ with a point in the plane, such that any two distinct subsets correspond to different points. If the absolute value of the difference between the arithmetic means of the elements of two distinct non-empty subsets of $N{}$ is at most $k{}$ we connect the points associated with these subsets with a segment. Determine the minimum value of $k{}$ such that the points associated with any two distinct non-empty subsets of $N{}$ are connected by a segment or a broken line. [i]Cristi Săvescu[/i]

Is it possible to define an operation $\star$ on $\mathbb Z$ such that[list=a][*] for any $a, b, c$ in $\mathbb Z, (a \star b) \star c = a \star (b \star c)$ holds; [*] for any $x, y$ in $\mathbb Z, x \star x \star y = y \star x \star x=y$?[/list]

The points $A_1,A_...,A_n$ lie on a circle with radius 1. The points $B_1,B_2,…,B_n$ are such that $B_i B_j<A_i A_j$ for $i\neq j$. Is it always true that the points $B_1,B_2,...,B_n$ lie on a circle with radius lesser than 1?

$A$ is a set satisfying the following the condition. Show that $2001+\sqrt{2001}$ is an element of $A$. [b]Condition[/b] (1) $1 \in A$ (2) If $x \in A$, then $x^2 \in A$. (3) If $(x-3)^2 \in A$, then $x \in A$.

Having three sets $ A,B\subset C, $ solve the set equation $ (X\cup (C\setminus A))\cap ((C\setminus X)\cup A)=B. $

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

Given a collection of sets $X = \{A_1, A_2, ..., A_n\}$. A set $\{a_1, a_2, ..., a_n\}$ is called a single representation of $X$ if $a_i \in A_i$ for all i. Let $|S| = mn$, $S = A_1\cup A_2 \cup ... \cup A_n = B_1 \cup B_2 \cup ... \cup B_n$ with $|A_i| = |B_i| = m$ for all $i$. Prove that $S = C_1 \cup C_2 \cup ... \cup C_n$ where for every $i, C_i $ is a single represenation for $\{A_j\}_{j=1}^n $and $\{B_j\}_{j=1}^n$.

Let $S$ be a nonempty finite set, and $\mathcal {F}$ be a collection of subsets of $S$ such that the following conditions are met: (i) $\mathcal {F}$ $\setminus$ {$S$} $\neq$ $\emptyset$ ; (ii) if $F_1, F_2 \in \mathcal {F}$, then $F_1 \cap F_2 \in \mathcal {F}$ and $F_1 \cup F_2 \in \mathcal {F}$. Prove that there exists $a \in S$ which belongs to at most half of the elements of $\mathcal {F}$.

Let $S$ be a finite set with n elements and $\mathcal F$ a family of subsets of $S$ with the following property: $$A\in\mathcal F,A\subseteq B\subseteq S\implies B\in\mathcal F.$$Prove that the function $f:[0,1]\to\mathbb R$ given by $$f(t):=\sum_{A\in\mathcal F}t^{|A|}(1-t)^|S\setminus A|$$is nondecreasing ($|A|$ denotes the number of elements of $A$).

Show that there exists a proper non-empty subset $S$ of the set of real numbers such that, for every real number $x$, the set $\{nx + S : n \in N\}$ is finite, where $nx + S =\{nx + s : s \in S\}$

Let $n$ be positive integer. Let $S_1,S_2,\cdots,S_k$ be a collection of $2n$-element subsets of $\{1,2,3,4,...,4n-1,4n\}$ so that $S_{i}\cap S_{j}$ contains at most $n$ elements for all $1\leq i<j\leq k$. Show that $$k\leq 6^{(n+1)/2}$$

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

The sets $A_1,A_2,...,A_n$ are finite. With $d$ we denote the number of elements in $\bigcup_{i=1}^n A_i$ which are in odd number of the sets $A_i$. Prove that the number: $D(k)=d-\sum_{i=1}^n|A_i|+2\sum_{i<j}|A_i\cap A_j |+...+(-1)^k2^{k-1}\sum_{i_1<i_2<...<i_k}|A_{i_1}\cap A_{i_2}\cap ...\cap A_{i_k}|$ is divisible by $2^k$.

Let $S$ be a set of integers which has the following properties: 1) There exists $x,y\in S$ such that $(x,y)=(x-2,y-2)=1$; 2) For $\forall$ $x,y\in S, x^2-y\in S$. Prove that $S\equiv \mathbb{Z}$ .