Found problems: 175
1988 Tournament Of Towns, (177) 3
The set of all $10$-digit numbers may be represented as a union of two subsets: the subset $M$ consisting of all $10$-digit numbers, each of which may be represented as a product of two $5$-digit numbers, and the subset $N$ , containing the remaining $10$-digit numbers . Which of the sets $M$ and $N$ contains more elements?
(S. Fomin , Leningrad)
1978 Polish MO Finals, 4
Let $X$ be a set of $n$ elements. Prove that the sum of the numbers of elements of sets $A\cap B$, where $A$ and $B$ run over all subsets of $X$, is equal to $n4^{n-1}$.
2010 Contests, 1
A finite set of integers is called [i]bad[/i] if its elements add up to $2010$. A finite set of integers is a [i]Benelux-set[/i] if none of its subsets is bad. Determine the smallest positive integer $n$ such that the set $\{502, 503, 504, . . . , 2009\}$ can be partitioned into $n$ Benelux-sets.
(A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.)
[i](2nd Benelux Mathematical Olympiad 2010, Problem 1)[/i]
1997 Pre-Preparation Course Examination, 1
Let $ k,m,n$ be integers such that $ 1 < n \leq m \minus{} 1 \leq k.$ Determine the maximum size of a subset $ S$ of the set $ \{1,2,3, \ldots, k\minus{}1,k\}$ such that no $ n$ distinct elements of $ S$ add up to $ m.$
2019 Canadian Mathematical Olympiad Qualification, 4
Let $n$ be a positive integer. For a positive integer $m$, we partition the set $\{1, 2, 3,...,m\}$ into $n$ subsets, so that the product of two different elements in the same subset is never a perfect square. In terms of $n$, fi nd the largest positive integer $m$ for which such a partition exists.
1986 Bundeswettbewerb Mathematik, 4
Given the finite set $M$ with $m$ elements and $1986$ further sets $M_1,M_2,M_3,...,M_{1986}$, each of which contains more than $\frac{m}{2}$ elements from $M$ . Show that no more than ten elements need to be marked in order for any set $M_i$ ($i =1, 2, 3,..., 1986$) contains at least one marked element.
1991 Czech And Slovak Olympiad IIIA, 6
The set $N$ is partitioned into three subsets $A_1,A_2,A_3$.
Prove that at least one of them has the following property: There exists a positive number $m$ such that for any $k$ one can find numbers $a_1 < a_2 < ... < a_k$ in that subset satisfying $a_{j+1} -a_j \le m$ for $j = 1,...,k -1$.
2009 Thailand Mathematical Olympiad, 2
Let $k$ and $n$ be positive integers with $k < n$. Find the number of subsets of $\{1, 2, . . . , n\}$ such that the difference between the largest and smallest elements in the subset is $k$.
2002 USAMO, 1
Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.
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?
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$).
2025 Kyiv City MO Round 2, Problem 3
In a school, \( n \) different languages are taught. It is known that for any subset of these languages (including the empty set), there is exactly one student who knows these and only these languages (there are \( 2^n \) students in total). Each day, the students are divided into pairs and teach each other the languages that only one of them knows. If students are not allowed to be in the same pair twice, what is the minimum number of days the school administration needs to guarantee that all their students know all \( n \) languages?
[i]Proposed by Oleksii Masalitin[/i]
1961 Putnam, A7
Let $S$ be a nonempty closed set in the euclidean plane for which there is a closed disk $D$ containing $S$ such that $D$ is a subset of every closed disk that contains $S$. Prove that every point inside $D$ is the midpoint of a segment joining two points of $S.$
2003 Olympic Revenge, 7
Let $X$ be a subset of $R_{+}^{*}$ with $m$ elements.
Find $X$ such that the number of subsets with the same sum is maximum.
1961 Putnam, A5
Let $\Omega$ be a set of $n$ points, where $n>2$. Let $\Sigma$ be a nonempty subcollection of the $2^n$ subsets of $\Omega$ that is closed with respect to the unions, intersections and complements. If $k$ is the number of elements of $\Sigma,$ what are the possible values of $k?$
1975 Czech and Slovak Olympiad III A, 6
Let $\mathbf M\subseteq\mathbb R^2$ be a set with the following properties:
1) there is a pair $(a,b)\in\mathbf M$ such that $ab(a-b)\neq0,$
2) if $\left(x_1,y_1\right),\left(x_2,y_2\right)\in\mathbf M$ and $c\in\mathbb R$ then also \[\left(cx_1,cy_1\right),\left(x_1+x_2,y_1+y_2\right),\left(x_1x_2,y_1y_2\right)\in\mathbf M.\]
Show that in fact \[\mathbf M=\mathbb R^2.\]
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$.
2004 Switzerland Team Selection Test, 1
Let $S$ be the set of all n-tuples $(X_1,...,X_n)$ of subsets of the set $\{1,2,..,1000\}$, not necessarily different and not necessarily nonempty. For $a = (X_1,...,X_n)$ denote by $E(a)$ the number of elements of $X_1\cup ... \cup X_n$. Find an explicit formula for the sum $\sum_{a\in S} E(a)$
2010 Miklós Schweitzer, 3
Let $ A_i,i=1,2,\dots,t$ be distinct subsets of the base set $\{1,2,\dots,n\}$ complying to the following condition
$$ \displaystyle A_ {i} \cap A_ {k} \subseteq A_ {j}$$for any $1 \leq i <j <k \leq t.$ Find the maximum value of $t.$
Thanks @dgrozev
2015 NIMO Problems, 5
Compute the number of subsets $S$ of $\{0,1,\dots,14\}$ with the property that for each $n=0,1,\dots,
6$, either $n$ is in $S$ or both of $2n+1$ and $2n+2$ are in $S$.
[i]Proposed by Evan Chen[/i]
2020 Malaysia IMONST 1, 19
A set $S$ has $7$ elements. Several $3$-elements subsets of $S$ are listed, such
that any $2$ listed subsets have exactly $1$ common element. What is the maximum number of subsets that can be listed?
2010 Belarus Team Selection Test, 4.1
Find all finite sets $M \subset R, |M| \ge 2$, satisfying the following condition:
[i]for all $a, b \in M, a \ne b$, the number $a^3 - \frac{4}{9}b$ also belongs to $M$.
[/i]
(I. Voronovich)
1970 Poland - Second Round, 6
If $ A $ is a subset of $ X $, then we take $ A^1 = A $, $ A^{-1} = X - A $. The subsets $ A_1, A_2, \ldots, A_k $ are called mutually independent if the product $ A_1^{\varepsilon_1} \cap A_2^{\varepsilon_2} \ldots A_k^{\varepsilon_k} $ is nonempty for every system of numbers $ \varepsilon_1 , \varepsilon_2, \ldots, \varepsilon_k $, such that $ |\varepsilon_2| = $1 for $ i = 1, 2, \ldots, k $.
What is the maximum number of mutually independent subsets of a $2^n $-element set?
2012 Ukraine Team Selection Test, 12
We shall call the triplet of numbers $a, b, c$ of the interval $[-1,1]$ [i]qualitative [/i] if these numbers satisfy the inequality $1 + 2abc\ge a^2 + b^2 + c^2$. Prove that when the triples $a, b, c$, and $x, y, z$ are qualitative, then $ax, by, cz$ is also qualitative.
2011 Korea Junior Math Olympiad, 8
There are $n$ students each having $r$ positive integers. Their $nr$ positive integers are all different. Prove that we can divide the students into $k$ classes satisfying the following conditions:
(a) $k \le 4r$
(b) If a student $A$ has the number $m$, then the student $B$ in the same class can't have a number $\ell$ such that $(m - 1)! < \ell < (m + 1)! + 1$