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$ ?

The set of $\{1,2,3,...,63\}$ was divided into three non-empty disjoint sets $A,B$. Let $a,b,c$ be the product of all numbers in each set $A,B,C$ respectively and finally we have determined the greatest common divisor of these three products. What was the biggest result we could get?

Let $M$ be the set of positive odd integers. For every positive integer $n$, denote $A(n)$ the number of the subsets of $M$ whose sum of elements equals $n$. For instance, $A(9) = 2$, because there are exactly two subsets of $M$ with the sum of their elements equal to $9$: $\{9\}$ and $\{1, 3, 5\}$. a) Prove that $A(n) \le A(n + 1)$ for every integer $n \ge 2$. b) Find all the integers $n \ge 2$ such that $A(n) = A(n + 1)$

Determine how many unordered pairs $\{A,B\}$ is there such that $A,B\subseteq\{1,\ldots,n\}$ and $A\cap B=\emptyset.$

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?

Find all positive integers $n$ such that we can divide the set $\{1,2,3,\ldots,n\}$ into three sets with the same sum of members.

Defined as $N_0$ as the set of all non-negative integers. Set $S \subset N_0$ with not so many elements is called beautiful if for every $a, b \in S$ with $a \ge b$ ($a$ and $b$ do not have to be different), exactly one of $a + b$ or $a - b$ is in $S$. Set $T \subset N_0$ with not so many elements is called charming if the largest number $k$ such that up to 3$^k | a$ is the same for each element $a \in T$. Prove that each beautiful set must be charming.

Can the set $\{1,2,...,33\}$ be partitioned into $11$ three-element sets, in each of which one element equals the sum of the other two?

For finite sets $A,M$ such that $A \subseteq M \subset \mathbb{Z}^+$, we define $$f_M(A)=\{x\in M \mid x\text{ is divisible by an odd number of elements of }A\}.$$ Given a positive integer $k$, we call $M$ [i]k-colorable[/i] if it is possible to color the subsets of $M$ with $k$ colors so that for any $A \subseteq M$, if $f_M(A)\neq A$ then $f_M(A)$ and $A$ have different colors. Determine the least positive integer $k$ such that every finite set $M \subset\mathbb{Z}^+$ is k-colorable.

Suppose that we have $2n$ non-empty subset of $ \big\{0,1,2,...,2n-1\big\} $ that sum of the elements of these subsets is $ \binom{2n+1}{2}$ . Prove that we can choose one element from every subset that some of them is $ \binom{2n}{2}$ [i]Proposed by Morteza Saghafian and Afrouz Jabalameli [/i]

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$.

Let $X=\{1,2,3,...,10\}$. Find the number of pairs of $\{A,B\}$ such that $A\subseteq X, B\subseteq X, A\ne B$ and $A\cap B=\{2,3,5,7\}$.

The sets of rational numbers $A = \{a_1, \dots, a_5\}$ and $B = \{b_1, \dots, b_5\}$ both contain $0$ and satisfy the condition that $$ \{a_i + b_j\}_{i,j} = \{0, 1, 2, \dots, 23, 24\}. $$ Determine these sets. (The set $\{a_i + b_j\}_{i,j}$ consists of all possible sums between an element of $A$ and an element of $B$)

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$

For $n\geq3$ define $S_n=\{1, 2, ..., n\}$. $A_1, A_{2}, ..., A_{n}$ are given subsets of $S_n$, each having an even number of elements. Prove that there exists a set $\{i_1, i_2, ..., i_t\}$, a nonempty subset of $S_n$ such that $$A_{i_1} \Delta A_{i_2} \Delta \ldots \Delta A_{i_t}=\emptyset$$ (For two sets $A, B$, we define $\Delta$ as $A \Delta B=(A\cup B)-(A\cap B)$)

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$.

A graph $G$ has $n + k$ vertices. Let $A$ be a subset of $n$ vertices of the graph $G$, and $B$ be a subset of other $k$ vertices. Each vertex of $A$ is joined to at least $k - p$ vertices of $B$. Prove that if $np < k$ then there is a vertex in $B$ that can be joined to all vertices of $A$.

Given a set $S$ of positive real numbers, let $$\Sigma (S) = \Bigg\{ \sum_{x \in A} x : \emptyset \neq A \subset S \Bigg\}.$$ be the set of all the sums of elements of non-empty subsets of $S$. Find the least constant $L> 0$ with the following property: for every integer greater than $1$ and every set $S$ of $n$ positive real numbers, it is possible partition $\Sigma(S)$ into $n$ subsets $\Sigma_1,\ldots, \Sigma_n$ so that the ratio between the largest and smallest element of each $\Sigma_i$ is at most $L$.

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

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.

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$ 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$ .

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$.)

$k > 1$ is fixed. Show that for $n$ sufficiently large for every partition of $\{1,2,\dots,n\}$ into $k$ disjoint subsets we can find $a \neq b$ such that $a$ and $b$ are in the same subset and $a+1$ and $b+1$ are in the same subset. What is the smallest $n$ for which this is true?

Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.