Found problems: 295
1987 All Soviet Union Mathematical Olympiad, 459
The $T_0$ set consists of all the numbers, representable as $(2k)!, k = 0, 1, 2, ... , n, ...$. The $T_m$ set is obtained from $T_{m-1}$ by adding all the finite sums of different numbers, that belong to $T_{m-1}$. Prove that there is a natural number, that doesn't belong to $T_{1987}$.
2021 Romania Team Selection Test, 2
Consider the set $M=\{1,2,3,...,2020\}.$ Find the smallest positive integer $k$ such that for any subset $A$ of $M$ with $k$ elements, there exist $3$ distinct numbers $a,b,c$ from $M$ such that $a+b, b+c$ and $c+a$ are all in $A.$
KoMaL A Problems 2021/2022, A. 811
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]
2001 Abels Math Contest (Norwegian MO), 2
Let $A$ be a set, and let $P (A)$ be the powerset of all non-empty subsets of $A$. (For example, $A = \{1,2,3\}$, then $P (A) = \{\{1\},\{2\} ,\{3\},\{1,2\}, \{1,3\},\{2,3\}, \{1,2,3\}\}$.)
A subset $F$ of P $(A)$ is called [i]strong [/i] if the following is true:
If $B_1$ and $B_2$ are elements of $F$, then $B_1 \cup B_2$ is also an element of $F$.
Suppose that $F$ and $G$ are strong subsets of $P (A)$.
a) Is the union $F \cup G$ necessarily strong?
b) Is the intersection $F \cap G$ necessarily strong?
2016 Dutch IMO TST, 4
Determine the number of sets $A = \{a_1,a_2,...,a_{1000}\}$ of positive integers satisfying $a_1 < a_2 <...< a_{1000} \le 2014$, for which we have that the set
$S = \{a_i + a_j | 1 \le i, j \le 1000$ with $i + j \in A\}$ is a subset of $A$.
2023 Bulgaria JBMO TST, 4
Given is a set of $n\ge5$ people and $m$ commissions with $3$ persons in each. Let all the commissions be [i]nice[/i] if there are no two commissions $A$ and $B$, such that $\mid A\cap B\mid=1$. Find the biggest possible $m$ (as a function of $n$).
1998 North Macedonia National Olympiad, 2
Prove that the numbers $1,2,...,1998$ cannot be separated into three classes whose sums of elements are divisible by $2000,3999$, and $5998$, respectively.
2019 IFYM, Sozopol, 2
There are some boys and girls that study in a school. A group of boys is called [i]sociable[/i], if each girl knows at least one of the boys in the group. A group of girls is called [i]sociable[/i], if each boy knows at least one of the girls in the group. If the number of [i]sociable[/i] groups of boys is odd, prove that the number of [i]sociable[/i] groups of girls is also odd.
2019 Belarusian National Olympiad, 9.4
The sum of several (not necessarily different) positive integers not exceeding $10$ is equal to $S$.
Find all possible values of $S$ such that these numbers can always be partitioned into two groups with the sum of the numbers in each group not exceeding $70$.
[i](I. Voronovich)[/i]
2015 Junior Regional Olympiad - FBH, 5
Prove that for every parititon of set $X=\{1,2,...,9\}$ on two disjoint sets at least one of them contains three elements such that sum of some two of them is equal to third
2016 Indonesia TST, 1
Let $k$ and $n$ be positive integers. Determine the smallest integer $N \ge k$ such that the following holds: If a set of $N$ integers contains a complete residue modulo $k$, then it has a non-empty subset whose sum of elements is divisible by $n$.
2017 China Team Selection Test, 3
Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying the following condition: Given a sequence of $n$ subsets of $X$, $A_1,A_2,\ldots,A_n$, there exists $1 \leq i < j < k \leq n$ such that
$$A_i \subseteq A_j \subseteq A_k \text{ or } A_i \supseteq A_j \supseteq A_k.$$
2014 Rioplatense Mathematical Olympiad, Level 3, 6
Let $n \in N$ such that $1 + 2 + ... + n$ is divisible by $3$. Integers $a_1\ge a_2\ge a_3\ge 2$ have sum $n$ and they satisfy $1 + 2 + ... + a_1\le \frac{1}{3}( 1 + 2 + ... + n ) $ and $1 + 2 + ... + (a_1+ a_2) \le \frac{2}{3}( 1 + 2 + ... + n )$.
Prove that there is a partition of $\{ 1 , 2 , ... , n\}$ in three subsets $A_1, A_2, A_3$ with cardinals $| A_i| = a_i, i = 1 , 2 , 3$, and with equal sums of their elements .
2018 Bosnia And Herzegovina - Regional Olympiad, 1
$a)$ Prove that for all positive integers $n \geq 3$ holds:
$$\binom{n}{1}+\binom{n}{2}+...+\binom{n}{n-1}=2^n-2$$ where $\binom{n}{k}$ , with integer $k$ such that $n \geq k \geq 0$, is binomial coefficent
$b)$ Let $n \geq 3$ be an odd positive integer. Prove that set $A=\left\{ \binom{n}{1},\binom{n}{2},...,\binom{n}{\frac{n-1}{2}} \right\}$ has odd number of odd numbers
2016 Poland - Second Round, 4
Let $k$ be a positive integer. Show that exists positive integer $n$, such that sets $A = \{ 1^2, 2^2, 3^2, ...\}$ and $B = \{1^2 + n, 2^2 + n, 3^2 + n, ... \}$ have exactly $k$ common elements.
2016 Saudi Arabia IMO TST, 3
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$.
2006 Korea Junior Math Olympiad, 8
De ne the set $F$ as the following: $F = \{(a_1,a_2,... , a_{2006}) : \forall i = 1, 2,..., 2006, a_i \in \{-1,1\}\}$
Prove that there exists a subset of $F$, called $S$ which satis es the following:
$|S| = 2006$
and for all $(a_1,a_2,... , a_{2006})\in F$ there exists $(b_1,b_2,... , b_{2006}) \in S$, such that $\Sigma_{i=1} ^{2006}a_ib_i = 0$.
2008 Bulgarian Autumn Math Competition, Problem 12.4
Veni writes down finitely many real numbers (possibly one), squares them, and then subtracts 1 from each of them and gets the same set of numbers as in the beginning. What were the starting numbers?
2014 India PRMO, 8
Let $S$ be a set of real numbers with mean $M$. If the means of the sets $S\cup \{15\}$ and $S\cup \{15,1\}$ are $M + 2$ and $M + 1$, respectively, then how many elements does $S$ have?
2016 India IMO Training Camp, 3
Let $\mathbb N$ denote the set of all natural numbers. Show that there exists two nonempty subsets $A$ and $B$ of $\mathbb N$ such that
[list=1]
[*] $A\cap B=\{1\};$
[*] every number in $\mathbb N$ can be expressed as the product of a number in $A$ and a number in $B$;
[*] each prime number is a divisor of some number in $A$ and also some number in $B$;
[*] one of the sets $A$ and $B$ has the following property: if the numbers in this set are written as $x_1<x_2<x_3<\cdots$, then for any given positive integer $M$ there exists $k\in \mathbb N$ such that $x_{k+1}-x_k\ge M$.
[*] Each set has infinitely many composite numbers.
[/list]
2009 Kyiv Mathematical Festival, 6
Let $\{a_1,...,a_n\}\subset \{-1,1\}$ and $a>0$ . Denote by $X$ and $Y$ the number of collections $\{\varepsilon_1,...,\varepsilon_n\}\subset \{-1,1\}$, such that $$max_{1\le k\le n}(\varepsilon_1a_1+...+\varepsilon_ka_k) >\alpha$$ and $$\varepsilon_1a_1+...+\varepsilon_na_n>a$$ respectively. Prove that $X\le 2Y$.
2017 Costa Rica - Final Round, LR2
There is a set of $17$ consecutive positive integers. Let $m$ be the smallest of these numbers. Determine for which values of $m$ the set can be divided into three subsets disjoint, such that the sum of the elements of each subset is the same.
1980 All Soviet Union Mathematical Olympiad, 300
The $A$ set consists of integers only. Its minimal element is $1$ and its maximal element is $100$. Every element of $A$ except $1$ equals to the sum of two (may be equal) numbers being contained in $A$. What is the least possible number of elements in $A$?
2015 Cono Sur Olympiad, 6
Let $S = \{1, 2, 3, \ldots , 2046, 2047, 2048\}$. Two subsets $A$ and $B$ of $S$ are said to be [i]friends[/i] if the following conditions are true:
[list]
[*] They do not share any elements.
[*] They both have the same number of elements.
[*] The product of all elements from $A$ equals the product of all elements from $B$.
[/list]
Prove that there are two subsets of $S$ that are [i]friends[/i] such that each one of them contains at least $738$ elements.
2016 Switzerland Team Selection Test, Problem 1
Let $n$ be a natural number. Two numbers are called "unsociable" if their greatest common divisor is $1$. The numbers $\{1,2,...,2n\}$ are partitioned into $n$ pairs. What is the minimum number of "unsociable" pairs that are formed?