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: 295

2017 South East Mathematical Olympiad, 8

Tags: set , combinatorics
Given the positive integer $m \geq 2$, $n \geq 3$. Define the following set $$S = \left\{(a, b) | a \in \{1, 2, \cdots, m\}, b \in \{1, 2, \cdots, n\} \right\}.$$ Let $A$ be a subset of $S$. If there does not exist positive integers $x_1, x_2, x_3, y_1, y_2, y_3$ such that $x_1 < x_2 < x_3, y_1 < y_2 < y_3$ and $$(x_1, y_2), (x_2, y_1), (x_2, y_2), (x_2, y_3), (x_3, y_2) \in A.$$ Determine the largest possible number of elements in $A$.

2020 Vietnam National Olympiad, 7

Tags: algebra , set
Given a positive integer $n>1$. Denote $T$ a set that contains all ordered sets $(x;y;z)$ such that $x,y,z$ are all distinct positive integers and $1\leq x,y,z\leq 2n$. Also, a set $A$ containing ordered sets $(u;v)$ is called [i]"connected"[/i] with $T$ if for every $(x;y;z)\in T$ then $\{(x;y),(x;z),(y;z)\} \cap A \neq \varnothing$. a) Find the number of elements of set $T$. b) Prove that there exists a set "connected" with $T$ that has exactly $2n(n-1)$ elements. c) Prove that every set "connected" with $T$ has at least $2n(n-1)$ elements.

2014 Rioplatense Mathematical Olympiad, Level 3, 1

Let $n \ge 3$ be a positive integer. Determine, in terms of $n$, how many triples of sets $(A,B,C)$ satisfy the conditions: $\bullet$ $A, B$ and $C$ are pairwise disjoint , that is, $A \cap B = A \cap C= B \cap C= \emptyset$. $\bullet$ $A \cup B \cup C= \{ 1 , 2 , ... , n \}$. $\bullet$ The sum of the elements of $A$, the sum of the elements of $B$ and the sum of the elements of $C$ leave the same remainder when divided by $3$. Note: One or more of the sets may be empty.

2019 India PRMO, 30

Tags: set , sum
Let $E$ denote the set of all natural numbers $n$ such that $3 < n < 100$ and the set $\{ 1, 2, 3, \ldots , n\}$ can be partitioned in to $3$ subsets with equal sums. Find the number of elements of $E$.

2004 Federal Math Competition of S&M, 3

Tags: combinatorics , set
Let $A = \{1,2,3, . . . ,11\}$. How many subsets $B$ of $A$ are there, such that for each $n\in \{1,2, . . . ,8\}$, if $n$ and $n+2$ are in $B$ then at least one of the numbers $ n+1$ and $n+3$ is also in $B$?

2018 China Girls Math Olympiad, 6

Given $k \in \mathbb{N}^+$. A sequence of subset of the integer set $\mathbb{Z} \supseteq I_1 \supseteq I_2 \supseteq \cdots \supseteq I_k$ is called a $k-chain$ if for each $1 \le i \le k$ we have (i) $168 \in I_i$; (ii) $\forall x, y \in I_i$, we have $x-y \in I_i$. Determine the number of $k-chain$ in total.

2016 USAJMO, 4

Tags: set
Find, with proof, the least integer $N$ such that if any $2016$ elements are removed from the set ${1, 2,...,N}$, one can still find $2016$ distinct numbers among the remaining elements with sum $N$.

2018 Danube Mathematical Competition, 4

Let $M$ be the set of positive odd integers. For every positive integer $n$, denote $A(n)$ the number of the subsets of $M$ whose sum of elements equals $n$. For instance, $A(9) = 2$, because there are exactly two subsets of $M$ with the sum of their elements equal to $9$: $\{9\}$ and $\{1, 3, 5\}$. a) Prove that $A(n) \le A(n + 1)$ for every integer $n \ge 2$. b) Find all the integers $n \ge 2$ such that $A(n) = A(n + 1)$

2018 Brazil Undergrad MO, 5

Consider the set $A = \left\{\frac{j}{4}+\frac{100}{j}|j=1,2,3,..\right\} $ What is the smallest number that belongs to the $ A $ set?

2011 Silk Road, 1

Tags: set , combinatorics
Determine the smallest possible value of $| A_{1} \cup A_{2} \cup A_{3} \cup A_{4} \cup A_{5} |$, where $A_{1}, A_{2}, A_{3}, A_{4}, A_{5}$ sets simultaneously satisfying the following conditions: $(i)$ $| A_{i}\cap A_{j} | = 1$ for all $1\leq i < j\leq 5$, i.e. any two distinct sets contain exactly one element in common; $(ii)$ $A_{i}\cap A_{j} \cap A_{k}\cap A_{l} =\varnothing$ for all $1\leq i<j<k<l\leq 5$, i.e. any four different sets contain no common element. Where $| S |$ means the number of elements of $S$.

1989 Romania Team Selection Test, 2

Let $P$ be a point on a circle $C$ and let $\phi$ be a given angle incommensurable with $2\pi$. For each $n \in N, P_n$ denotes the image of $P$ under the rotation about the center $O$ of $C$ by the angle $\alpha_n = n \phi$. Prove that the set $M = \{P_n | n \ge 0\}$ is dense in $C$.

2001 VJIMC, Problem 1

Let $A$ be a set of positive integers such that for any $x,y\in A$, $$x>y\implies x-y\ge\frac{xy}{25}.$$Find the maximal possible number of elements of the set $A$.

2013 Junior Balkan Team Selection Tests - Romania, 5

a) Prove that for every positive integer n, there exist $a, b \in R - Z$ such that the set $A_n = \{a - b, a^2 - b^2, a^3 - b^3,...,a^n - b^n\}$ contains only positive integers. b) Let $a$ and $b$ be two real numbers such that the set $A = \{a^k - b^k | k \in N*\}$ contains only positive integers. Prove that $a$ and $b$ are integers.

2016 Dutch IMO TST, 4

Tags: set , combinatorics
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$.

2021 Balkan MO Shortlist, C1

Let $\mathcal{A}_n$ be the set of $n$-tuples $x = (x_1, ..., x_n)$ with $x_i \in \{0, 1, 2\}$. A triple $x, y, z$ of distinct elements of $\mathcal{A}_n$ is called [i]good[/i] if there is some $i$ such that $\{x_i, y_i, z_i\} = \{0, 1, 2\}$. A subset $A$ of $\mathcal{A}_n$ is called [i]good[/i] if every three distinct elements of $A$ form a good triple. Prove that every good subset of $\mathcal{A}_n$ has at most $2(\frac{3}{2})^n$ elements.

2001 Korea Junior Math Olympiad, 7

Finite set $\{a_1, a_2, ..., a_n, b_1, b_2, ..., b_n\}=\{1, 2, …, 2n\}$ is given. If $a_1<a_2<...<a_n$ and $b_1>b_2>...>b_n$, show that $$\sum_{i=1}^n |a_i-b_i|=n^2$$

2013 Bosnia And Herzegovina - Regional Olympiad, 4

Tags: set , combinatorics
If $A=\{1,2,...,4s-1,4s\}$ and $S \subseteq A$ such that $\mid S \mid =2s+2$, prove that in $S$ we can find three distinct numbers $x$, $y$ and $z$ such that $x+y=2z$

2017 Kazakhstan NMO, Problem 5

Tags: logic , set , combinatorics
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?

2022 Belarus - Iran Friendly Competition, 3

Tags: set , combinatorics
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.

2011 VTRMC, Problem 4

Tags: set , number theory
Let $m,n$ be positive integers and let $[a]$ denote the residue class$\pmod{mn}$ of the integer $a$ (thus $\{[r]|r\text{ is an integer}\}$ has exactly $mn$ elements). Suppose the set $\{[ar]|r\text{ is an integer}\}$ has exactly $m$ elements. Prove that there is a positive integer $q$ such that $q$ is coprime to $mn$ and $[nq]=[a]$.

2014 JBMO TST - Macedonia, 5

Tags: combinatorics , set
Prove that there exist infinitely many pairwisely disjoint sets $A(1), A(2),...,A(2014)$ which are not empty, whose union is the set of positive integers and which satisfy the following condition: For arbitrary positive integers $a$ and $b$, at least two of the numbers $a$, $b$ and $GCD(a,b)$ belong to one of the sets $A(1), A(2),...,A(2014)$.

1983 Austrian-Polish Competition, 4

The set $N$ has been partitioned into two sets A and $B$. Show that for every $n \in N$ there exist distinct integers $a, b > n$ such that $a, b, a + b$ either all belong to $A$ or all belong to $B$.

2016 Bosnia And Herzegovina - Regional Olympiad, 2

Find all elements $n \in A = \{2,3,...,2016\} \subset \mathbb{N}$ such that: every number $m \in A$ smaller than $n$, and coprime with $n$, must be a prime number

OMMC POTM, 2022 8

The positive integers are partitioned into two infinite sets so that the sum of any $2023$ distinct integers in one set is also in that set. Prove that one set contains all the odd positive integers, and one set contains all the even positive integers. [i]Proposed by Evan Chang (squareman), USA[/i]

2024 Assara - South Russian Girl's MO, 8

Tags: combinatorics , set
Given a set $S$ of $2024$ natural numbers satisfying the following condition: if you select any $10$ (different) numbers from $S$, then you can select another number from $S$ so that the sum of all $11$ selected numbers is divisible by $10$. Prove that one of the numbers can be thrown out of $S$ so that the resulting set $S'$ of $2023$ numbers satisfies the condition: if you choose any $9$ (different) numbers from $S'$, then you can choose another number from $S'$ so that the sum of all $10$ selected numbers is divisible by $10$. [i]K.A.Sukhov[/i]