Found problems: 295
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.
2015 Ukraine Team Selection Test, 7
Let $A$ and $B$ be two sets of real numbers. Suppose that the elements of the set $AB = \{ab: a\in A, b\in B\}$ form a finite arithmetic progression. Prove that one of these sets contains no more than three elements
ICMC 4, 1
Let \(S\) be a set with 10 distinct elements. A set \(T\) of subsets of \(S\) (possibly containing the empty set) is called [i]union-closed[/i] if, for all \(A, B \in T\), it is true that \(A \cup B \in T\). Show that the number of union-closed sets \(T\) is less than \(2^{1023}\).
[i]Proposed by Tony Wang[/i]
1998 Belarus Team Selection Test, 2
Find all finite sets $M \subset R$ containing at least two elements such that $(2a/3 -b^2) \in M$ for any two different elements $a,b \in M$.
2010 ISI B.Stat Entrance Exam, 3
Let $I_1, I_2, I_3$ be three open intervals of $\mathbb{R}$ such that none is contained in another. If $I_1\cap I_2 \cap I_3$ is non-empty, then show that at least one of these intervals is contained in the union of the other two.
1968 Putnam, A3
Let $S$ be a finite set and $P$ the set of all subsets of $S$. Show that one can label the elements of $P$ as $A_i$ such that
(1) $A_1 =\emptyset$.
(2) For each $n\geq1 $ we either have $A_{n-1}\subset A_{n}$ and $|A_{n} \setminus A_{n-1}|=1$ or $A_{n}\subset A_{n-1}$ and $|A_{n-1} \setminus A_{n}|=1.$
2009 Jozsef Wildt International Math Competition, W. 11
Find all real numbers $m$ such that $$\frac{1-m}{2m} \in \{x\ |\ m^2x^4+3mx^3+2x^2+x=1\ \forall \ x\in \mathbb{R} \}$$
2021 Junior Balkan Team Selection Tests - Romania, P4
Let $M$ be a set of $13$ positive integers with the property that $\forall \ m\in M, \ 100\leq m\leq 999$. Prove that there exists a subset $S\subset M$ and a combination of arithmetic operations (addition, subtraction, multiplication, division – without using parentheses) between the elements of $S$, such that the value of the resulting expression is a rational number in the interval $(3,4)$.
2018 IFYM, Sozopol, 1
$A = \{a_1, a_2, . . . , a_k\}$ is a set of positive integers for which the sum of some (we can have only one number too) different numbers from the set is equal to a different number i.e. there $2^k - 1$ different sums of different numbers from $A$. Prove that the following inequality holds:
$\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}<2$
2017 Canada National Olympiad, 3
Define $S_n$ as the set ${1,2,\cdots,n}$. A non-empty subset $T_n$ of $S_n$ is called $balanced$ if the average of the elements of $T_n$ is equal to the median of $T_n$. Prove that, for all $n$, the number of balanced subsets $T_n$ is odd.
2015 Korea Junior Math Olympiad, 8
A positive integer $n$ is given. If there exist sets $F_1, F_2, \cdots F_m$ satisfying the following, prove that $m \le n$.
(For sets $A, B$, $|A|$ is the number of elements in $A$. $A-B$ is the set of elements that are in $A$ but not $B$)
(i): For all $1 \le i \le m$, $F_i \subseteq \{1,2,\cdots n\}$
(ii): $|F_1| \le |F_2| \le \cdots \le |F_m|$
(iii): For all $1 \le i < j \le m$, $|F_i-F_j|=1$.
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$.
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$.
2015 USAMO, 6
Consider $0<\lambda<1$, and let $A$ be a multiset of positive integers. Let $A_n=\{a\in A: a\leq n\}$. Assume that for every $n\in\mathbb{N}$, the set $A_n$ contains at most $n\lambda$ numbers. Show that there are infinitely many $n\in\mathbb{N}$ for which the sum of the elements in $A_n$ is at most $\frac{n(n+1)}{2}\lambda$. (A multiset is a set-like collection of elements in which order is ignored, but repetition of elements is allowed and multiplicity of elements is significant. For example, multisets $\{1, 2, 3\}$ and $\{2, 1, 3\}$ are equivalent, but $\{1, 1, 2, 3\}$ and $\{1, 2, 3\}$ differ.)
2017 AMC 12/AHSME, 9
Let $S$ be the set of points $(x,y)$ in the coordinate plane such that two of the three quantities $3$, $x+2$, and $y-4$ are equal and the third of the three quantities is no greater than this common value. Which of the following is a correct description of $S$?
$\textbf{(A) } \text{a single point} \qquad \textbf{(B) } \text{two intersecting lines} \\ \\ \textbf{(C) } \text{three lines whose pairwise intersections are three distinct points} \\ \\ \textbf{(D) } \text{a triangle} \qquad \textbf{(E) } \text{three rays with a common endpoint}$
2024 Assara - South Russian Girl's MO, 8
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]
2015 Korea National Olympiad, 3
A positive integer $n$ is given. If there exists sets $F_1, F_2, \cdots F_m$ satisfying the following conditions, prove that $m \le n$. (For sets $A, B$, $|A|$ is the number of elements of $A$. $A-B$ is the set of elements that are in $A$ but not $B$. $\text{min}(x,y)$ is the number that is not larger than the other.)
(i): For all $1 \le i \le m$, $F_i \subseteq \{1,2,\cdots,n\}$
(ii): For all $1 \le i < j \le m$, $\text{min}(|F_i-F_j|,|F_j-F_i|) = 1$
Oliforum Contest V 2017, 5
Find the smallest integer $n > 3$ such that, for each partition of $\{3, 4,..., n\}$ in two sets, at least one of these sets contains three (not necessarily distinct) numbers $ a, b, c$ for which $ab = c$.
(Alberto Alfarano)
2017 South East Mathematical Olympiad, 8
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$.
2012 Dutch BxMO/EGMO TST, 5
Let $A$ be a set of positive integers having the following property:
for each positive integer $n$ exactly one of the three numbers $n, 2n$ and $3n$ is an element of $A$.
Furthermore, it is given that $2 \in A$. Prove that $13824 \notin A$.
2019 India PRMO, 20
Consider the set $E$ of all natural numbers $n$ such that whenn divided by $11, 12, 13$, respectively, the remainders, int that order, are distinct prime numbers in an arithmetic progression. If $N$ is the largest number in $E$, find the sum of digits of $N$.
2022 AMC 10, 14
Suppose that $S$ is a subset of $\{1, 2, 3,...,25\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S$. What is the maximum number of elements $S$ may contain?
$\textbf{(A) }12 \qquad \textbf{(B) }13 \qquad \textbf{(C) }14 \qquad \textbf{(D) }15 \qquad \textbf{(E) }16$
2022 Turkey EGMO TST, 2
We are given some three element subsets of $\{1,2, \dots ,n\}$ for which any two of them have at most one common element. We call a subset of $\{1,2, \dots ,n\}$ [i]nice [/i] if it doesn't include any of the given subsets. If no matter how the three element subsets are selected in the beginning, we can add one more element to every 29-element [i]nice [/i] subset while keeping it nice, find the minimum value of $n$.
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.
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$