Found problems: 233
2021 JBMO Shortlist, N3
For any set $A = \{x_1, x_2, x_3, x_4, x_5\}$ of five distinct positive integers denote by $S_A$ the sum of its elements, and denote by $T_A$ the number of triples $(i, j, k)$ with $1 \le i < j < k \le 5$ for which $x_i + x_j + x_k$ divides $S_A$.
Find the largest possible value of $T_A$.
2019 Mathematical Talent Reward Programme, SAQ: P 6
Consider a finite set of points, $\Phi$, in the $\mathbb{R}^2$, such that they follow the following properties :
[list]
[*] $\Phi$ doesn't contain the origin $\{(0,0)\}$ and not all points are collinear.
[*] If $\alpha \in \Phi$, then $-\alpha \in \Phi$, $c\alpha \notin \Phi $ for $c\neq 1$ or $-1$
[*] If $\alpha, \ \beta$ are in $\Phi$, then the reflection of $\beta$ in the line passing through the origin and perpendicular to the line containing origin and $\alpha$ is in $\Phi$
[*] If $\alpha = (a,b) , \ \beta = (c,d)$, (both $\alpha, \ \beta \in \Phi$) then $\frac{2(ac+bd)}{c^2+d^2} \in \mathbb{Z}$
[/list]
Prove that there cannot be 5 collinear points in $\Phi$
2014 Greece JBMO TST, 4
Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when:
a) $n=2014$
b) $n=2015 $
c) $n=2018$
2019 India PRMO, 21
Consider the set $E = \{5, 6, 7, 8, 9\}$. For any partition ${A, B}$ of $E$, with both $A$ and $B$ non-empty, consider the number obtained by adding the product of elements of $A$ to the product of elements of $B$. Let $N$ be the largest prime number amonh these numbers. Find the sum of the digits of $N$.
2018 India PRMO, 22
A positive integer $k$ is said to be [i]good [/i] if there exists a partition of $ \{1, 2, 3,..., 20\}$ into disjoint proper subsets such that the sum of the numbers in each subset of the partition is $k$. How many [i]good [/i] numbers are there?
2017 Kazakhstan NMO, Problem 5
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?
1987 China Team Selection Test, 1
a.) For all positive integer $k$ find the smallest positive integer $f(k)$ such that $5$ sets $s_1,s_2, \ldots , s_5$ exist satisfying:
[b]i.[/b] each has $k$ elements;
[b]ii.[/b] $s_i$ and $s_{i+1}$ are disjoint for $i=1,2,...,5$ ($s_6=s_1$)
[b]iii.[/b] the union of the $5$ sets has exactly $f(k)$ elements.
b.) Generalisation: Consider $n \geq 3$ sets instead of $5$.
2023 Brazil EGMO Team Selection Test, 2
Let $A$ be a finite set made up of prime numbers. Determine if there exists an infinite set $B$ that satisfies the following conditions:
$(i)$ the prime factors of any element of $B$ are in $A$;
$(ii)$ no term of $B$ divides another element of this set.
2021 Science ON grade VI, 3
Consider positive integers $a<b$ and the set $C\subset\{a,a+1,a+2,\dots ,b-2,b-1,b\}$. Suppose $C$ has more than $\frac{b-a+1}{2}$ elements. Prove that there are two elements $x,y\in C$ that satisfy $x+y=a+b$.
[i] (From "Radu Păun" contest, Radu Miculescu)[/i]
1990 Czech and Slovak Olympiad III A, 6
Let $k\ge 1$ be an integer and $\mathsf S$ be a family of 2-element subsets of the index set $\{1,\ldots,2k\}$ with the following property: if $\mathsf M_1,\ldots,\mathsf M_{2k}$ are arbitrary sets such that \[\mathsf M_i\cap\mathsf M_j\neq\emptyset\quad\Leftrightarrow\quad\{i,j\}\in\mathsf S,\] then the union $\mathsf M_1\cup\ldots\cup\mathsf M_{2k}$ contains at least $k^2$ elements. Show that there is a suitable family $\mathsf S$ for any integer $k\ge1.$
2015 Irish Math Olympiad, 7
Let $n > 1$ be an integer and $\Omega=\{1,2,...,2n-1,2n\}$ the set of all positive integers that are not larger than $2n$.
A nonempty subset $S$ of $\Omega$ is called [i]sum-free[/i] if, for all elements $x, y$ belonging to $S, x + y$ does not belong to $S$. We allow $x = y$ in this condition.
Prove that $\Omega$ has more than $2^n$ distinct [i]sum-free[/i] subsets.
2013 IFYM, Sozopol, 7
Let $T$ be a set of natural numbers, each of which is greater than 1. A subset $S$ of $T$ is called “good”, if for each $t\in T$ there exists $s\in S$, for which $gcd(t,s)>1$. Prove that the number of "good" subsets of $T$ is odd.
2007 German National Olympiad, 5
Determine all finite sets $M$ of real numbers such that $M$ contains at least $2$ numbers and any two elements of $M$ belong to an arithmetic progression of elements of $M$ with three terms.
2011 IMO Shortlist, 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]
1987 ITAMO, 4
Given $I_0 = \{-1,1\}$, define $I_n$ recurrently as the set of solutions $x$ of the equations $x^2 -2xy+y^2- 4^n = 0$,
where $y$ ranges over all elements of $I_{n-1}$. Determine the union of the sets $I_n$ over all nonnegative integers $n$.
2004 Junior Tuymaada Olympiad, 4
Given the disjoint finite sets of natural numbers $ A $ and $ B $, consisting of $ n $ and $ m $ elements, respectively. It is known that every natural number belonging to $ A $ or $ B $ satisfies at least one of the conditions $ k + 17 \in A $, $ k-31 \in B $. Prove that $ 17n = 31m $
1997 Estonia Team Selection Test, 1
$(a)$ Is it possible to partition the segment $[0,1]$ into two sets $A$ and $B$ and to define a continuous function $f$ such that for every $x\in A \ f(x)$ is in $B$, and for every $x\in B \ f(x)$ is in $A$?
$(b)$ The same question with $[0,1]$ replaced by $[0,1).$
2022 Korea -Final Round, P6
Set $X$ is called [i]fancy[/i] if it satisfies all of the following conditions:
[list]
[*]The number of elements of $X$ is $2022$.
[*]Each element of $X$ is a closed interval contained in $[0, 1]$.
[*]For any real number $r \in [0, 1]$, the number of elements of $X$ containing $r$ is less than or equal to $1011$.
[/list]
For [i]fancy[/i] sets $A, B$, and intervals $I \in A, J \in B$, denote by $n(A, B)$ the number of pairs $(I, J)$ such that $I \cap J \neq \emptyset$. Determine the maximum value of $n(A, B)$.
2021 Switzerland - Final Round, 3
Find all finite sets $S$ of positive integers with at least $2$ elements, such that if $m>n$ are two elements of $S$, then
$$ \frac{n^2}{m-n} $$
is also an element of $S$.
2000 VJIMC, Problem 1
Is there a countable set $Y$ and an uncountable family $\mathcal F$ of its subsets such that for every two distinct $A,B\in\mathcal F$, their intersection $A\cap B$ is finite?
2011 Korea Junior Math Olympiad, 4
For a positive integer $n$, ($n\ge 2$), find the number of sets with $2n + 1$ points $P_0, P_1,..., P_{2n}$ in the coordinate plane satisfying the following as its elements:
- $P_0 = (0, 0),P_{2n}= (n, n)$
- For all $i = 1,2,..., 2n - 1$, line $P_iP_{i+1}$ is parallel to $x$-axis or $y$-axis and its length is $1$.
- Out of $2n$ lines$P_0P_1, P_1P_2,..., P_{2n-1}P_{2n}$, there are exactly $4$ lines that are enclosed in the domain $y \le x$.
2004 Regional Olympiad - Republic of Srpska, 4
Set $S=\{1,2,...,n\}$ is firstly divided on $m$ disjoint nonempty subsets, and then on $m^2$ disjoint nonempty subsets. Prove that some $m$ elements of set $S$ were after first division in same set, and after the second division were in $m$ different sets
2016 Mathematical Talent Reward Programme, MCQ: P 10
Let $A=\{1,2,\cdots ,100\}$. Let $S$ be a subset of power set of $A$ such that any two elements of $S$ has nonzero intersection (Note that elements of $S$ are actually some subsets of $A$). Then the maximum possible cardinality of $S$ is
[list=1]
[*] $2^{99}$
[*] $2^{99}+1$
[*] $2^{99}+2^{98}$
[*] None of these
[/list]
2009 Serbia National Math Olympiad, 3
Determine the largest positive integer $n$ for which there exist pairwise different sets $\mathbb{S}_1 , ..., \mathbb{S}_n$ with the following properties:
$1$) $|\mathbb{S}_i \cup \mathbb{S}_j | \leq 2004$ for any two indices $1 \leq i, j\leq n$, and
$2$) $\mathbb{S}_i \cup \mathbb{S}_j \cup \mathbb{S}_k = \{ 1,2,...,2008 \}$ for any $1 \leq i < j < k \leq n$
[i]Proposed by Ivan Matic[/i]
2019 Switzerland Team Selection Test, 3
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$.