This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 149

2010 Belarus Team Selection Test, 4.1

Tags: Subsets , algebra
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)

2018 JBMO Shortlist, C1

A set $S$ is called [i]neighbouring [/i] if it has the following two properties: a) $S$ has exactly four elements b) for every element $x$ of $S$, at least one of the numbers $x - 1$ or $x+1$ belongs to $S$. Find the number of all [i]neighbouring [/i] subsets of the set $\{1,2,... ,n\}$.

2008 Indonesia TST, 1

Let $A$ be the subset of $\{1, 2, ..., 16\}$ that has $6$ elements. Prove that there exist $2$ subsets of $A$ that are disjoint, and the sum of their elements are the same.

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?

2002 Switzerland Team Selection Test, 10

Given an integer $m\ge 2$, find the smallest integer $k > m$ such that for any partition of the set $\{m,m + 1,..,k\}$ into two classes $A$ and $B$ at least one of the classes contains three numbers $a,b,c$ (not necessarily distinct) such that $a^b = c$.

2013 Serbia Additional Team Selection Test, 3

Tags: Subsets , TST , algebra
Let $p > 3$ be a given prime number. For a set $S \subseteq \mathbb{Z}$ and $a \in \mathbb{N}$ , define $S_a = \{ x \in \{ 0,1, 2,...,p-1 \}$ | $(\exists_s \in S) x \equiv_p a \cdot s \}$ . $(a)$ How many sets $S \subseteq \{ 1, 2,...,p-1 \} $ are there for which the sequence $S_1 , S_2 , ..., S_{p-1}$ contains exactly two distinct terms? $(b)$ Determine all numbers $k \in \mathbb{N}$ for which there is a set $ S \subseteq \{ 1, 2,...,p-1 \} $ such that the sequence $S_1 , S_2 , ..., S_{p-1} $ contains exactly $k$ distinct terms. [i]Proposed by Milan Basic and Milos Milosavljevic[/i]

1974 Bundeswettbewerb Mathematik, 3

Let $M$ be a set with $n$ elements. How many pairs $(A, B)$ of subsets of $M$ are there such that $A$ is a subset of $B?$

1999 Abels Math Contest (Norwegian MO), 4

For every nonempty subset $R$ of $S = \{1,2,...,10\}$, we define the alternating sum $A(R)$ as follows: If $r_1,r_2,...,r_k$ are the elements of $R$ in the increasing order, then $A(R) = r_k -r_{k-1} +r_{k-2}- ... +(-1)^{k-1}r_1$. (a) Is it possible to partition $S$ into two sets having the same alternating sum? (b) Determine the sum $\sum_{R} A(R)$, where $R$ runs over all nonempty subsets of $S$.

2020 Canadian Mathematical Olympiad Qualification, 2

Given a set $S$, of integers, an [i]optimal partition[/i] of S into sets T, U is a partition which minimizes the value $|t - u|$, where $t$ and $u$ are the sum of the elements of $T$ and U respectively. Let $P$ be a set of distinct positive integers such that the sum of the elements of $P$ is $2k$ for a positive integer $k$, and no subset of $P$ sums to $k$. Either show that there exists such a $P$ with at least $2020$ different optimal partitions, or show that such a $P$ does not exist.

2018 JBMO Shortlist, A7

Let $A$ be a set of positive integers satisfying the following : $a.)$ If $n \in A$ , then $n \le 2018$. $b.)$ If $S \subset A$ such that $|S|=3$, then there exists $m,n \in S$ such that $|n-m| \ge \sqrt{n}+\sqrt{m}$ What is the maximum cardinality of $A$ ?

1985 Czech And Slovak Olympiad IIIA, 2

Let $A_1, A_2, A_3$ be nonempty sets of integers such that for $\{i, j, k\} = \{1, 2, 3\}$ holds $$(x \in A_i, y\in A_j) \Rightarrow (x + y \in A_k, x - y \in A_k).$$ Prove that at least two of the sets $A_1, A_2, A_3$ are equal. Can any of these sets be disjoint?

1953 Kurschak Competition, 1

$A$ and $B$ are any two subsets of $\{1, 2,...,n - 1\}$ such that $|A| +|B|> n - 1$. Prove that one can find $a$ in $A$ and $b$ in $B$ such that $a + b = n$.

1993 Romania Team Selection Test, 3

Show that the set $\{1,2,....,2^n\}$ can be partitioned in two classes, none of which contains an arithmetic progression of length $2n$.

2021 Indonesia TST, C

Let $p$ be an odd prime. Determine the number of nonempty subsets from $\{1, 2, \dots, p - 1\}$ for which the sum of its elements is divisible by $p$.

2012 Ukraine Team Selection Test, 11

Let $P$ be a polynomial with integer coefficients of degree $d$. For the set $A = \{ a_1, a_2, ..., a_k\}$ of positive integers we denote $S (A) = P (a_1) + P (a_2) + ... + P (a_k )$. The natural numbers $m, n$ are such that $m ^{d+ 1} | n$. Prove that the set $\{1, 2, ..., n\}$ can be subdivided into $m$ disjoint subsets $A_1, A_2, ..., A_m$ with the same number of elements such that $S (A_1) = S(A_2) = ... = S (A_m )$.

2017 Saudi Arabia JBMO TST, 4

Let $S = \{-17, -16, ..., 16, 17\}$. We call a subset $T$ of $S$ a good set if $-x \in T$ for all $x \in T$ and if $x, y, z \in T (x, y, z$ may be equal) then $x + y + z \ne 0$. Find the largest number of elements in a good set.

2020 Iran MO (3rd Round), 3

find all $k$ distinct integers $a_1,a_2,...,a_k$ such that there exists an injective function $f$ from reals to themselves such that for each positive integer $n$ we have $$\{f^n(x)-x| x \in \mathbb{R} \}=\{a_1+n,a_2+n,...,a_k+n\}$$.

2007 Thailand Mathematical Olympiad, 13

Let $S = \{1, 2,..., 8\}$. How many ways are there to select two disjoint subsets of $S$?

1999 Ukraine Team Selection Test, 3

Let $m,n$ be positive integers with $m \le n$, and let $F$ be a family of $m$-element subsets of $\{1,2,...,n\}$ satisfying $A \cap B \ne \varnothing$ for all $A,B \in F$. Determine the maximum possible number of elements in $F$.

I Soros Olympiad 1994-95 (Rus + Ukr), 9.1

Divide the set of twelve numbers $A = \{3, 4, 5, ...,13, 14\}$ into two sets $ B$ and $C$ 'of six numbers each according to this condition: for any two different numbers with $ B$ their sum does not belong to $ B$ and for any two different numbers from $C$, the sum does not belong to $C$.

2022 SEEMOUS, 4

Let $\mathcal{F}$ be the family of all nonempty finite subsets of $\mathbb{N} \cup \{0\}.$ Find all real numbers $a$ for which the series $$\sum_{A \in \mathcal{F}} \frac{1}{\sum_{k \in A}a^k}$$ is convergent.

2023 Iran Team Selection Test, 6

Suppose that we have $2n$ non-empty subset of $ \big\{0,1,2,...,2n-1\big\} $ that sum of the elements of these subsets is $ \binom{2n+1}{2}$ . Prove that we can choose one element from every subset that some of them is $ \binom{2n}{2}$ [i]Proposed by Morteza Saghafian and Afrouz Jabalameli [/i]

2012 India Regional Mathematical Olympiad, 6

Let $S$ be the set $\{1, 2, ..., 10\}$. Let $A$ be a subset of $S$. We arrange the elements of $A$ in increasing order, that is, $A = \{a_1, a_2, ...., a_k\}$ with $a_1 < a_2 < ... < a_k$. Define [i]WSUM [/i] for this subset as $3(a_1 + a_3 +..) + 2(a_2 + a_4 +...)$ where the first term contains the odd numbered terms and the second the even numbered terms. (For example, if $A = \{2, 5, 7, 8\}$, [i]WSUM [/i] is $3(2 + 7) + 2(5 + 8)$.) Find the sum of [i]WSUMs[/i] over all the subsets of S. (Assume that WSUM for the null set is $0$.)

2021 China Girls Math Olympiad, 6

Given a finite set $S$, $P(S)$ denotes the set of all the subsets of $S$. For any $f:P(S)\rightarrow \mathbb{R}$ ,prove the following inequality:$$\sum_{A\in P(S)}\sum_{B\in P(S)}f(A)f(B)2^{\left| A\cap B \right|}\geq 0.$$

1972 Czech and Slovak Olympiad III A, 5

Determine how many unordered pairs $\{A,B\}$ is there such that $A,B\subseteq\{1,\ldots,n\}$ and $A\cap B=\emptyset.$