Found problems: 233
KoMaL A Problems 2017/2018, A. 720
We call a positive integer [i]lively[/i] if it has a prime divisor greater than $10^{10^{100}}$. Prove that if $S$ is an infinite set of lively positive integers, then it has an infinite subset $T$ with the property that the sum of the elements in any finite nonempty subset of $T$ is a lively number.
1974 Putnam, B6
For a set with $n$ elements, how many subsets are there whose cardinality is respectively $\equiv 0$ (mod $3$), $\equiv 1$ (mod $3$), $ \equiv 2$ (mod $3$)? In other words, calculate
$$s_{i,n}= \sum_{k\equiv i \;(\text{mod} \;3)} \binom{n}{k}$$
for $i=0,1,2$. Your result should be strong enough to permit direct evaluation of the numbers $s_{i,n}$ and to show clearly the relationship of $s_{0,n}, s_{1,n}$ and $s_{2,n}$ to each other for all positive integers $n$. In particular, show the relationships among these three sums for $n = 1000$.
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$.
2015 Bosnia And Herzegovina - Regional Olympiad, 4
It is given set $A=\{1,2,3,...,2n-1\}$. From set $A$, at least $n-1$ numbers are expelled such that:
$a)$ if number $a \in A$ is expelled, and if $2a \in A$ then $2a$ must be expelled
$b)$ if $a,b \in A$ are expelled, and $a+b \in A$ then $a+b$ must be also expelled
Which numbers must be expelled such that sum of numbers remaining in set stays minimal
2016 Spain Mathematical Olympiad, 5
From all possible permutations from $(a_1,a_2,...,a_n)$ from the set $\{1,2,..,n\}$, $n\geq 1$, consider the sets that satisfies the $2(a_1+a_2+...+a_m)$ is divisible by $m$, for every $m=1,2,...,n$. Find the total number of permutations.
1996 Italy TST, 2
2. Let $A_1,A_2,...,A_n$be distinct subsets of an n-element set $ X$ ($n \geq 2$). Show that there exists an element $x$ of $X$ such that the sets $A_1\setminus \{x\}$ ,:......., $A_n\setminus \{x\}$ are all distinct.
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.
2023 China Team Selection Test, P14
For any nonempty, finite set $B$ and real $x$, define
$$d_B(x) = \min_{b\in B} |x-b|$$
(1) Given positive integer $m$. Find the smallest real number $\lambda$ (possibly depending on $m$) such that for any positive integer $n$ and any reals $x_1,\cdots,x_n \in [0,1]$, there exists an $m$-element set $B$ of real numbers satisfying $$d_B(x_1)+\cdots+d_B(x_n) \le \lambda n$$
(2) Given positive integer $m$ and positive real $\epsilon$. Prove that there exists a positive integer $n$ and nonnegative reals $x_1,\cdots,x_n$, satisfying for any $m$-element set $B$ of real numbers, we have
$$d_B(x_1)+\cdots+d_B(x_n) > (1-\epsilon)(x_1+\cdots+x_n)$$
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$.
2022 Bulgarian Autumn Math Competition, Problem 10.4
The European zoos with exactly $100$ types of species each are separated into two groups $\hat{A}$ and $\hat{B}$ in such a way that every pair of zoos $(A, B)$ $(A\in\hat{A}, B\in\hat{B})$ have some animal in common. Prove that we can colour the cages in $3$ colours (all animals of the same type live in the same cage) such that no zoo has cages of only one colour
2018 Bosnia And Herzegovina - Regional Olympiad, 2
Determine all triplets $(a,b,c)$ of real numbers such that sets $\{a^2-4c, b^2-2a, c^2-2b \}$ and $\{a-c,b-4c,a+b\}$ are equal and $2a+2b+6=5c$. In every set all elements are pairwise distinct
1994 Bulgaria National Olympiad, 6
Let $n$ be a positive integer and $A$ be a family of subsets of the set $\{1,2,...,n\},$ none of which contains another subset from A . Find the largest possible cardinality of $A$ .
2004 Federal Math Competition of S&M, 3
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$?
2008 Korea Junior Math Olympiad, 4
Let $N$ be the set of positive integers. If $A,B,C \ne \emptyset$, $A \cap B = B \cap C = C \cap A = \emptyset$ and $A \cup B \cup C = N$, we say that $A,B,C$ are partitions of $N$. Prove that there are no partitions of $N, A,B,C$, that satis fy the following:
(i) $\forall a \in A, b \in B$, we have $a + b + 1 \in C$
(ii) $\forall b \in B, c \in C$, we have $b + c + 1 \in A$
(iii) $\forall c \in C, a \in A$, we have $c + a + 1 \in B$
2015 Thailand TSTST, 1
Let $A$ be a subset of $\{1, 2, \dots , 1000000\}$ such that for any $x, y \in A$ with $x\neq y$, we have $xy\notin A$. Determine the maximum possible size of $A$.
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 .
2011 IMO, 1
Given any set $A = \{a_1, a_2, a_3, a_4\}$ of four distinct positive integers, we denote the sum $a_1 +a_2 +a_3 +a_4$ by $s_A$. Let $n_A$ denote the number of pairs $(i, j)$ with $1 \leq i < j \leq 4$ for which $a_i +a_j$ divides $s_A$. Find all sets $A$ of four distinct positive integers which achieve the largest possible value of $n_A$.
[i]Proposed by Fernando Campos, Mexico[/i]
2017 Thailand TSTST, 1
1.1 Let $f(A)$ denote the difference between the maximum value and the minimum value of a set $A$. Find the sum of $f(A)$ as $A$ ranges over the subsets of $\{1, 2, \dots, n\}$.
1.2 All cells of an $8 × 8$ board are initially white. A move consists of flipping the color (white to black or vice versa) of cells in a $1\times 3$ or $3\times 1$ rectangle. Determine whether there is a finite sequence of moves resulting in the state where all $64$ cells are black.
1.3 Prove that for all positive integers $m$, there exists a positive integer $n$ such that the set $\{n, n + 1, n + 2, \dots , 3n\}$ contains exactly $m$ perfect squares.
2019 Thailand TST, 2
Given any set $S$ of positive integers, show that at least one of the following two assertions holds:
(1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$;
(2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.
2015 Czech-Polish-Slovak Match, 2
A family of sets $F$ is called perfect if the following condition holds: For every triple of sets $X_1, X_2, X_3\in F$, at least one of the sets $$ (X_1\setminus X_2)\cap X_3,$$ $$(X_2\setminus X_1)\cap X_3$$ is empty. Show that if $F$ is a perfect family consisting of some subsets of a given finite set $U$, then $\left\lvert F\right\rvert\le\left\lvert U\right\rvert+1$.
[i]Proposed by Michał Pilipczuk[/i]
2019 India IMO Training Camp, P1
Given any set $S$ of positive integers, show that at least one of the following two assertions holds:
(1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$;
(2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.
2018 Mathematical Talent Reward Programme, MCQ: P6
In a class among 80 students number of boys is 40 and number of girls is 40. 50 of the students use spectacles. Which of the following is correct?
[list=1]
[*] Only 10 boys use spectacles
[*] Only 20 girls use spectacles
[*] At most 25 boys do not use spectacles
[*] At most 30 girls do not use spectacles
[/list]
2013 Indonesia MO, 8
Let $A$ be a set of positive integers. $A$ is called "balanced" if [and only if] the number of 3-element subsets of $A$ whose elements add up to a multiple of $3$ is equal to the number of 3-element subsets of $A$ whose elements add up to not a multiple of $3$.
a. Find a 9-element balanced set.
b. Prove that no set of $2013$ elements can be balanced.
2020 Thailand TSTST, 4
Does there exist a set $S$ of positive integers satisfying the following conditions?
$\text{(i)}$ $S$ contains $2020$ distinct elements;
$\text{(ii)}$ the number of distinct primes in the set $\{\gcd(a, b) : a, b \in S, a \neq b\}$ is exactly $2019$; and
$\text{(iii)}$ for any subset $A$ of $S$ containing at least two elements, $\sum\limits_{a,b\in A; a<b}
ab$ is not a prime power.
2001 Regional Competition For Advanced Students, 4
Let $A_o =\{1, 2\}$ and for $n> 0, A_n$ results from $A_{n-1}$ by adding the natural numbers to $A_{n-1}$ which can be represented as the sum of two different numbers from $A_{n-1}$. Let $a_n = |A_n |$ be the number of numbers in $A_n$. Determine $a_n$ as a function of $n$.