Let $A$ be a set of positive integers. $A$ is called "balanced" if [and only if] the number of 3-element subsets of $A$ whose elements add up to a multiple of $3$ is equal to the number of 3-element subsets of $A$ whose elements add up to not a multiple of $3$. a. Find a 9-element balanced set. b. Prove that no set of $2013$ elements can be balanced.

Let $I_1, I_2, I_3$ be three open intervals of $\mathbb{R}$ such that none is contained in another. If $I_1\cap I_2 \cap I_3$ is non-empty, then show that at least one of these intervals is contained in the union of the other two.

Let $n > k$ be positive integers and let $F$ be a family of finite sets with the following properties: i. $F$ contains at least $\binom{n}{k}+ 1$ distinct sets containing exactly $k$ elements; ii. For any two sets $A, B \in F$ their union, i.e., $A \cup B$ also belongs to $F$. Prove that $F$ contains at least three sets with at least $n$ elements.

Let $S$ be a set of rational numbers such that whenever $a$ and $b$ are members of $S$, so are $ab$ and $a+b$, and having the property that for every rational number $r$ exactly one of the following three statements is true: $$r\in S,\;\; -r\in S,\;\;r =0.$$ Prove that $S$ is the set of all positive rational numbers.

Let $p$ be a nonnegative integer and let $n=2^p$. Consider all subsets $A$ of the set $\{1,2,\ldots,n\}$ with the property that, whenever $x\in A$, $2x\notin A$. Find the maximum number of elements that such a set $A$ can have.

Let $A$ be a finite set made up of prime numbers. Determine if there exists an infinite set $B$ that satisfies the following conditions: $(i)$ the prime factors of any element of $B$ are in $A$; $(ii)$ no term of $B$ divides another element of this set.

Let $A$ be a given set with $n$ elements. Let $k<n$ be a given positive integer. Find the maximum value of $m$ for which it is possible to choose sets $B_i$ and $C_i$ for $i=1,2,\ldots,m$ satisfying the following conditions: [list=1] [*]$B_i\subset A,$ $|B_i|=k,$ [*]$C_i\subset B_i$ (there is no additional condition for the number of elements in $C_i$), and [*]$B_i\cap C_j\neq B_j\cap C_i$ for all $i\neq j.$ [/list]

Determine the sets $S{}$ of positive integers satisfying the following two conditions: [list=a] [*]For any positive integers $a, b, c{}$, if $ab + bc + ca{}$ is in $S$, then so are $a + b + c{}$ and $abc$; and [*]The set $S{}$ contains an integer $N \geqslant 160$ such that $N-2$ is not divisible by $4$. [/list] [i]Bogdan Blaga, United Kingdom[/i]

Given $2n$ natural numbers, so that the average arithmetic of those $2n$ number is $2$. If all the number is not more than $2n$. Prove we can divide those $2n$ numbers into $2$ sets, so that the sum of each set to be the same.

Consider positive integers $a<b$ and the set $C\subset\{a,a+1,a+2,\dots ,b-2,b-1,b\}$. Suppose $C$ has more than $\frac{b-a+1}{2}$ elements. Prove that there are two elements $x,y\in C$ that satisfy $x+y=a+b$. [i] (From "Radu Păun" contest, Radu Miculescu)[/i]

Let $M$ be a set of $13$ positive integers with the property that $\forall \ m\in M, \ 100\leq m\leq 999$. Prove that there exists a subset $S\subset M$ and a combination of arithmetic operations (addition, subtraction, multiplication, division – without using parentheses) between the elements of $S$, such that the value of the resulting expression is a rational number in the interval $(3,4)$.

Let $A$ be a subset of $\{1, 2, \dots , 1000000\}$ such that for any $x, y \in A$ with $x\neq y$, we have $xy\notin A$. Determine the maximum possible size of $A$.

Suppose $M$ is an infinite set of natural numbers such that, whenever the sum of two natural numbers is in $M$, one of these two numbers is in $M$ as well. Prove that the elements of any finite set of natural numbers not belonging to $M$ have a common divisor greater than $1$.

Alice and Mary were searching attic and found scale and box with weights. When they sorted weights by mass, they found out there exist $5$ different groups of weights. Playing with the scale and weights, they discovered that if they put any two weights on the left side of scale, they can find other two weights and put on to the right side of scale so scale is in balance. Find the minimal number of weights in the box

Let $\mathcal M$ be the set of all polynomial functions $f$ of degree at most 3 such that \[\forall x\in[-1,1]:\ |f(x)|\le 1.\] Denote $a$ the (possibly zero) coefficient of $f$ at $x^3.$ Show that there is a positive number $k$ such that \[\forall f\in\mathcal M:\ |a|\le k\] and find the least $k$ with this property.

What is the number of ordered pairs $(A,B)$ where $A$ and $B$ are subsets of $\{1,2,..., 5\}$ such that neither $A \subseteq B$ nor $B \subseteq A$?

A set $S$ of natural numbers is called [i]good[/i], if for each element $x \in S, x$ does not divide the sum of the remaining numbers in $S$. Find the maximal possible number of elements of a [i]good [/i]set which is a subset of the set $A = \{1,2, 3, ...,63\}$.

Given a positive integer $n$, a collection $\mathcal{S}$ of $n-2$ unordered triples of integers in $\{1,2,\ldots,n\}$ is [i]$n$-admissible[/i] if for each $1 \leq k \leq n - 2$ and each choice of $k$ distinct $A_1, A_2, \ldots, A_k \in \mathcal{S}$ we have $$ \left|A_1 \cup A_2 \cup \cdots A_k \right| \geq k+2.$$ Is it true that for all $n > 3$ and for each $n$-admissible collection $\mathcal{S}$, there exist pairwise distinct points $P_1, \ldots , P_n$ in the plane such that the angles of the triangle $P_iP_jP_k$ are all less than $61^{\circ}$ for any triple $\{i, j, k\}$ in $\mathcal{S}$? [i]Ivan Frolov, Russia[/i]

Find all finite sets $M \subset R$ containing at least two elements such that $(2a/3 -b^2) \in M$ for any two different elements $a,b \in M$.

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

Given two positive integers $r > s$, and let $F$ be an infinite family of sets, each of size $r$, no two of which share fewer than $s$ elements. Prove that there exists a set of size $r -1$ that shares at least $s$ elements with each set in $F$.

Let $n > 3$ be an integer. Let $\Omega$ be the set of all triples of distinct elements of $\{1, 2, \ldots , n\}$. Let $m$ denote the minimal number of colours which suffice to colour $\Omega$ so that whenever $1\leq a<b<c<d \leq n$, the triples $\{a,b,c\}$ and $\{b,c,d\}$ have different colours. Prove that $\frac{1}{100}\log\log n \leq m \leq100\log \log n$.

A nonempty set $S$ is called [i]Bally[/i] if for every $m\in S$, there are fewer than $\frac{1}{2}m$ elements of $S$ which are less than $m$. Determine the number of Bally subsets of $\{1, 2, . . . , 2020\}$.

Consider all possible sets of natural numbers $(x_1, x_2, ..., x_{100})$ such that $1\leq x_i \leq 2017$ for every $i = 1,2, ..., 100$. We say that the set $(y_1, y_2, ..., y_{100})$ is greater than the set $(z_1, z_2, ..., z_{100})$ if $y_i> z_i$ for every $i = 1,2, ..., 100$. What is the largest number of sets that can be written on the board, so that any set is not more than the other set?

Let $A=\{n\in\mathbb{Z}\mid 0<n<2013\}$. A subset $B\subseteq A$ is called [b]reduced[/b] if for any two numbers $x,y\in B$, we must have $x\cdot y \notin B$. For example, any subset containing the numbers $3,5,15$ cannot be reduced, and same for a subset containing $4,16$. [list=a] [*] Find the maximal size of a reduced subset of $A$. [*] How many reduced subsets are there with that maximal size? [/list]