Find the maximal cardinality $|S|$ of the subset $S \subset A=\{1, 2, 3, \dots, 9\}$ given that no two sums $a+b | a, b \in S, a \neq b$ are equal.

Find the number of $6$-tuples $(A_1,A_2,...,A_6)$ of subsets of $M = \{1,..., n\}$ (not necessarily different) such that each element of $M$ belongs to zero, three, or six of the subsets $A_1,...,A_6$.

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.

Given a set $S$, of integers, an [i]optimal partition[/i] of S into sets T, U is a partition which minimizes the value $|t - u|$, where $t$ and $u$ are the sum of the elements of $T$ and U respectively. Let $P$ be a set of distinct positive integers such that the sum of the elements of $P$ is $2k$ for a positive integer $k$, and no subset of $P$ sums to $k$. Either show that there exists such a $P$ with at least $2020$ different optimal partitions, or show that such a $P$ does not exist.

Let $S = \{1, 2, 3, ..., 100\}$ and $P$ is the collection of all subset $T$ of $S$ that have $49$ elements, or in other words: $$P = \{T \subset S : |T| = 49\}.$$ Every element of $P$ is labelled by the element of $S$ randomly (the labels may be the same). Show that there exist subset $M$ of $S$ that has $50$ members such that for every $x \in M$, the label of $M -\{x\}$ is not equal to $x$

The numbers from$ 1$ to $2016$ are divided into three (disjoint) subsets $A, B$ and $C$, each one contains exactly $672$ numbers. Prove that you can find three numbers, each from a different subset, such that the sum of two of them is equal to the third. [hide=original wording]Skaitļi no 1 līdz 2016 ir sadalīti trīs (nešķeļošās) apakškopās A, B un C, katranotām satur tieši 672 skaitļus. Pierādīt, ka var atrast trīs tādus skaitļus, katru no citas apakškopas, ka divu no tiem summa ir vienāda ar trešo. [/hide]

Let $X= \{A_1, A_2, A_3, A_4\}$ be a set of four distinct points in the plane. Show that there exists a subset $Y$ of $X$ with the property that there is no (closed) disk $K$ such that $K\cap X = Y$.

What is the number of ordered pairs $(A,B)$ where $A$ and $B$ are subsets of $\{1,2,..., 5\}$ such that neither $A \subseteq B$ nor $B \subseteq A$?

Find maximal value of positive integer $n$ such that there exists subset of $S=\{1,2,...,2001\}$ with $n$ elements, such that equation $y=2x$ does not have solutions in set $S \times S$

For every nonempty subset $R$ of $S = \{1,2,...,10\}$, we define the alternating sum $A(R)$ as follows: If $r_1,r_2,...,r_k$ are the elements of $R$ in the increasing order, then $A(R) = r_k -r_{k-1} +r_{k-2}- ... +(-1)^{k-1}r_1$. (a) Is it possible to partition $S$ into two sets having the same alternating sum? (b) Determine the sum $\sum_{R} A(R)$, where $R$ runs over all nonempty subsets of $S$.

$ P_1, P_2, \ldots, P_n $ are different two-element subsets of $ \{1,2,\ldots,n\} $. The sets $ P_i $, $ P_j $ for $ i\neq j $ have a common element if and only if the set $ \{i,j\} $ is one of the sets $ P_1, P_2, \ldots, P_n $. Prove that each of the numbers $ 1,2,\ldots,n $ is a common element of exactly two sets from $ P_1, P_2, \ldots, P_n $.

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$

Let $n \ge 1$ be an integer. Prove that there exists a set $S$ of $n$ positive integers with the following property: if $A$ and $B$ are any two distinct non-empty subsets of $S$, then the averages $\frac{P_{x\in A} x}{|A|}$ and $\frac{P_{x\in B} x}{|B|}$ are two relatively prime composite integers.

Let $ A_i,i=1,2,\dots,t$ be distinct subsets of the base set $\{1,2,\dots,n\}$ complying to the following condition $$ \displaystyle A_ {i} \cap A_ {k} \subseteq A_ {j}$$for any $1 \leq i <j <k \leq t.$ Find the maximum value of $t.$ Thanks @dgrozev

Let $A_1, A_2, A_3$ be nonempty sets of integers such that for $\{i, j, k\} = \{1, 2, 3\}$ holds $$(x \in A_i, y\in A_j) \Rightarrow (x + y \in A_k, x - y \in A_k).$$ Prove that at least two of the sets $A_1, A_2, A_3$ are equal. Can any of these sets be disjoint?

Let $p$ be an odd prime. Let $A(n)$ be the number of subsets of $\{1,2,...,n\}$ such that the sum of elements of the subset is a multiple of $p$. Prove that if $2^{p-1}-1$ is not a multiple of $p^2$, there exists infinitely many positive integer $m$ for any integer $k$ that satisfies the following. (The sum of elements of the empty set is 0.) $$\frac{A(m)-k}{p}\in\mathbb{Z}$$

Prove that there exist $16$ subsets of set $M = \{1,2,...,10000\}$ with the following property: For every $z \in M$ there are eight of these subsets whose intersection is $\{z\}$.

Show that the $120$ five digit numbers which are permutations of $12345$ can be divided into two sets with each set having the same sum of squares.

Let $S$ be the set $\{1, 2, ..., 10\}$. Let $A$ be a subset of $S$. We arrange the elements of $A$ in increasing order, that is, $A = \{a_1, a_2, ...., a_k\}$ with $a_1 < a_2 < ... < a_k$. Define [i]WSUM [/i] for this subset as $3(a_1 + a_3 +..) + 2(a_2 + a_4 +...)$ where the first term contains the odd numbered terms and the second the even numbered terms. (For example, if $A = \{2, 5, 7, 8\}$, [i]WSUM [/i] is $3(2 + 7) + 2(5 + 8)$.) Find the sum of [i]WSUMs[/i] over all the subsets of S. (Assume that WSUM for the null set is $0$.)

Determine if there exists a subset $E$ of $Z \times Z$ with the properties: (i) $E$ is closed under addition, (ii) $E$ contains $(0,0),$ (iii) For every $(a,b) \ne (0,0), E$ contains exactly one of $(a,b)$ and $-(a,b)$. Remark: We define $(a,b)+(a',b') = (a+a',b+b')$ and $-(a,b) = (-a,-b)$.

Consider the set $S = \{1,2,3, ...,1441\}$. 1. Nora counts thoses subsets of $S$ having exactly two elements, tbe sum of which is even. Rania counts those subsets of $S$ having exactly two elements, the sum of which is odd. Determine the numbers counted by Nora and Rania. 2. Let $t$ be the number of subsets of $S$ which have at least two elements and the product of the elements is even. Determine the greatest power of $2$ which divides $t$. 3. Ahmad counts the subsets of $S$ having $77$ elements such that in each subset the sum of the elements is even. Bushra counts the subsets of $S$ having $77$ elements such that in each subset the sum of the elements is odd. Whose number is bigger? Determine the difference between the numbers found by Ahmad and Bushra.

Given a set $S \subset N$ and a positive integer n, let $S\oplus \{n\} = \{s+n / s \in S\}$. The sequence $S_k$ of sets is defined inductively as follows: $S_1 = {1}$, $S_k=(S_{k-1} \oplus \{k\}) \cup \{2k-1\}$ for $k = 2,3,4, ...$ (a) Determine $N - \cup _{k=1}^{\infty} S_k$. (b) Find all $n$ for which $1994 \in S_n$.

Consider the set $A = \{1, 2, ..., n\}$, where $n \in N, n \ge 6$. Show that $A$ is the union of three pairwise disjoint sets, with the same cardinality and the same sum of their elements, if and only if $n$ is a multiple of $3$.

Let n be a natural number. Let $A_1, A_2, . . . , A_k$ be distinct $3$-element subsets of $\{1, 2, . . . , n\}$ such that $|A_i \cap A_j | \ne 1$ for all $1 \le i, j \le k$. Determine all $n$ for which there are $n$ such that these subsets exist. [hide=original wording of last sentence]Bestimme alle n, fur die es n solche Teilmengen gibt.[/hide]

Is it possible to partition the set $A = \{1, 2, 3, ... , 32, 33\}$ into eleven subsets that contain three integers each, such that for every one of these eleven subsets, one of the integers is equal to the sum of the other two? If so, give such a partition, if not, prove that such a partition cannot exist.