Found problems: 295
Let $A$ and $B$ be two non-infinite sets of natural numbers, each of which contains at least 3 elements. Two numbers $a\in A$ and $b\in B$ are called [i]"harmonious"[/i], if they are not coprime. It is known that each element from $A$ is not [i]harmonious[/i] with at least one element from $B$ and each element from $B$ is harmonious with at least one from $A$. Prove that there exist $a_1,a_2\in A$ and $b_1,b_2\in B$ such that $(a_1,b_1)$ and $(a_2,b_2)$ are [i]harmonious[/i] but $(a_1,b_2)$ and $(a_2,b_1)$ are not.
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$.
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]
Let $\mathcal M$ be the set of all polynomial functions $f$ of degree at most 3 such that \[\forall x\in[-1,1]:\ |f(x)|\le 1.\] Denote $a$ the (possibly zero) coefficient of $f$ at $x^3.$ Show that there is a positive number $k$ such that \[\forall f\in\mathcal M:\ |a|\le k\] and find the least $k$ with this property.
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]
Let $A$ be a subset with seven elements of the set $\{1,2,3, ...,26\}$.
Show that there are two distinct elements of $A$, having the same sum of their elements.
Find the number of triples of sets $(A, B, C)$ such that $A \cup B \cup C = \{1, 2, 3, ... , 2549\}$
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$.
Given the set $S$ whose elements are zero and the even integers, positive and negative. Of the five operations applied to any pair of elements: (1) addition (2) subtraction (3) multiplication (4) division (5) finding the arithmetic mean (average), those elements that only yield elements of $S$ are:
$ \textbf{(A)}\ \text{all} \qquad\textbf{(B)}\ 1,2,3,4\qquad\textbf{(C)}\ 1,2,3,5\qquad\textbf{(D)}\ 1,2,3\qquad\textbf{(E)}\ 1,3,5 $
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
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$?
$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$
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)$.
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.
Prove that the numbers $1,2,...,1998$ cannot be separated into three classes whose sums of elements are divisible by $2000,3999$, and $5998$, respectively.
Let $A$ be a set $A=\{1,2,3,...,2017\}$. Subset $S$ of set $A$ is [i]good [/i] if for all $x\in A$ sum of remaining elements of set $S$ has same last digit as $x$. Prove that [i]good[/i] subset with $405$ elements is not possible.
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$.
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$.
Let there be $n$ students and $m$ clubs. The students joined the clubs so that the following is true:
- For all students $x$, you can choose some clubs such that $x$ is the only student who joined all of the chosen clubs.
Let the number of clubs each student joined be $a_1,a_2,...,a_m$. Prove that
$$a_1!(m - a_1)! + a_2!(m - a_2)! + ... + a_n!(m -a_n)! \le m!$$
Determine if there exists a set $S$ of $5783$ different real numbers with the following property:
For every $a,b\in S$ (not necessarily distinct) there are $c\neq d$ in $S$ so that $a\cdot b=c+d$.
Let the set $M =\{\frac{1998}{1999},\frac{1999}{2000} \}$.
The set $M$ is completed with new fractions according to the rule:
take two distinct fractions$ \frac{p_1}{q_1}$ and $\frac{p_2}{q_2}$ from $M$ thus there are no other numbers in $M$ located between them and a new fraction is formed, $\frac{p_1+p_2}{q_1+q_2}$ which is included in $M$, etc.
Show that, after each procedure, the newly obtained fraction is irreducible and is different from the fractions previously included in $M$.
Alice and Bob are playing a game. First, Alice chooses a partition $\mathcal{C}$ of the positive integers
into a (not necessarily finite) set of sets, such that each positive integer is in exactly one of the
sets in $\mathcal{C}$. Then Bob does the following operation a finite number of times.
Choose a set $S \in \mathcal{C}$ not previously chosen, and let $D$ be the set of all positive integers dividing at least one element in $S$. Then add the set $D \setminus S$ (possibly the empty set) to $\mathcal{C}$.
Bob wins if there are two equal sets in $\mathcal{C}$ after he has done all his moves, otherwise, Alice wins.
Determine which player has a winning strategy.
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$.
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$.
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$ ?