Olympiad problems

2021 Iberoamerican, 5

For a finite set $C$ of integer numbers, we define $S(C)$ as the sum of the elements of $C$. Find two non-empty sets $A$ and $B$ whose intersection is empty, whose union is the set $\{1,2,\ldots, 2021\}$ and such that the product $S(A)S(B)$ is a perfect square.

1995 Bundeswettbewerb Mathematik, 2

Let $S$ be a union of finitely many disjoint subintervals of $[0,1]$ such that no two points in $S$ have distance $1/10$. Show that the total length of the intervals comprising $S$ is at most $1/2$.

union interval combinatorics

2010 Contests, 3

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.

union interval intersection set set theory

2010 ISI B.Stat Entrance Exam, 3

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.

union interval intersection set set theory

2022 Iran MO (3rd Round), 3

We have many $\text{three-element}$ subsets of a $1000\text{-element}$ set. We know that the union of every $5$ of them has at least $12$ elements. Find the most possible value for the number of these subsets.

union set combinatorics construction graph modeling mathematical induction