Let $K$ be the number of sequences $A_1$, $A_2$, $\dots$, $A_n$ such that $n$ is a positive integer less than or equal to $10$, each $A_i$ is a subset of $\{1, 2, 3, \dots, 10\}$, and $A_{i-1}$ is a subset of $A_i$ for each $i$ between $2$ and $n$, inclusive. For example, $\{\}$, $\{5, 7\}$, $\{2, 5, 7\}$, $\{2, 5, 7\}$, $\{2, 5, 6, 7, 9\}$ is one such sequence, with $n = 5$. What is the remainder when $K$ is divided by $10$? $\textbf{(A) } 1 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 9$

A subset of the real numbers has the property that for any two distinct elements of it such as $x$ and $y$, we have $(x+y-1)^2 = xy+1$. What is the maximum number of elements in this set? $\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ \text{Infinity}$

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.

We make groups of numbers. Each group consists of [i]five[/i] distinct numbers. A number may occur in multiple groups. For any two groups, there are exactly four numbers that occur in both groups. (a) Determine whether it is possible to make $2015$ groups. (b) If all groups together must contain exactly [i]six [/i] distinct numbers, what is the greatest number of groups that you can make? (c) If all groups together must contain exactly [i]seven [/i] distinct numbers, what is the greatest number of groups that you can make?

Let $S$ be a set of $6$ positive real numbers such that $\left(a,b \in S \right) \left(a>b \right) \Rightarrow a+b \in S$ or $a-b \in S$ Prove that if we sort these numbers in ascending order, then they form an arithmetic progression

A collection $F$ of distinct (not necessarily non-empty) subsets of $X = \{1,2,\ldots,300\}$ is [i]lovely[/i] if for any three (not necessarily distinct) sets $A$, $B$ and $C$ in $F$ at most three out of the following eight sets are non-empty \begin{align*}A \cap B \cap C, \ \ \ \overline{A} \cap B \cap C, \ \ \ A \cap \overline{B} \cap C, \ \ \ A \cap B \cap \overline{C}, \\ \overline{A} \cap \overline{B} \cap C, \ \ \ \overline{A} \cap B \cap \overline {C}, \ \ \ A \cap \overline{B} \cap \overline{C}, \ \ \ \overline{A} \cap \overline{B} \cap \overline{C} \end{align*} where $\overline{S}$ denotes the set of all elements of $X$ which are not in $S$. What is the greatest possible number of sets in a lovely collection?

Let $X$ be a set which consists from $8$ consecutive positive integers. Set $X$ is divided on two disjoint subsets $A$ and $B$ with equal number of elements. If sum of squares of elements from set $A$ is equal to sum of squares of elements from set $B$, prove that sum of elements of set $A$ is equal to sum of elements of set $B$.

Let $n \ge 1$ be an integer. For each subset $S \subset \{1, 2, \ldots , 3n\}$, let $f(S)$ be the sum of the elements of $S$, with $f(\emptyset) = 0$. Determine, as a function of $n$, the sum $$\sum_{\mathclap{\substack{S \subset \{1,2,\ldots,3n\}\\ 3 \mid f(S)}}} f(S)$$ where $S$ runs through all subsets of $\{1, 2,\ldots, 3n\}$ such that $f(S)$ is a multiple of $3$.

Let $n$ be a positive integer. Initially the sequence $0,0,\cdots,0$ ($n$ times) is written on the board. In each round, Ananya choses an integer $t$ and a subset of the numbers written on the board and adds $t$ to all of them. What is the minimum number of rounds in which Ananya can make the sequence on the board strictly increasing? Proposed by Shantanu Nene

Let $A$ be a set of $65$ integers with pairwise different remainders modulo $2016$. Prove that exists a subset $B=\{a,b,c,d\}$ of set $A$ such that $a+b-c-d$ is divisible with $2016$

Let $A_o =\{1, 2\}$ and for $n> 0, A_n$ results from $A_{n-1}$ by adding the natural numbers to $A_{n-1}$ which can be represented as the sum of two different numbers from $A_{n-1}$. Let $a_n = |A_n |$ be the number of numbers in $A_n$. Determine $a_n$ as a function of $n$.

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]

A set $\mathcal{S}$ of distinct positive integers has the following property: for every integer $x$ in $\mathcal{S},$ the arithmetic mean of the set of values obtained by deleting $x$ from $\mathcal{S}$ is an integer. Given that 1 belongs to $\mathcal{S}$ and that 2002 is the largest element of $\mathcal{S},$ what is the greatet number of elements that $\mathcal{S}$ can have?

Let $\{E_1, E_2, \dots, E_m\}$ be a collection of sets such that $E_i \subseteq X = \{1, 2, \dots, 100\}$, $E_i \neq X$, $i = 1, 2, \dots, m$. It is known that every two elements of $X$ is contained together in exactly one $E_i$ for some $i$. Determine the minimum value of $m$.

A subset of $\{1, 2, 3, ... ... , 2015\}$ is called good if the following condition is fulfilled: for any element $x$ of the subset, the sum of all the other elements in the subset has the same last digit as $x$. For example, $\{10, 20, 30\}$ is a good subset since $10$ has the same last digit as $20 + 30 = 50$, $20$ has the same last digit as $10 + 30 = 40$, and $30$ has the same last digit as $10 + 20 = 30$. (a) Find an example of a good subset with 400 elements. (b) Prove that there is no good subset with 405 elements.

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.

$A$ is a set satisfying the following the condition. Show that $2001+\sqrt{2001}$ is an element of $A$. [b]Condition[/b] (1) $1 \in A$ (2) If $x \in A$, then $x^2 \in A$. (3) If $(x-3)^2 \in A$, then $x \in A$.

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

There are $12$ members in a club. The members created some small groups, which satisfy the following: - The small group consists of $3$ or $4$ people. - Also, for two arbitrary members, there exists exactly one small group that has both members. Prove that all members are in the same number of small groups.

Given a set $A$ of positive integers, the set $A'$ is composed from the elements of $A$ and all positive integers that can be obtained in the following way: Write down some elements of $A$ one after another without repeating, write a sign $+ $ or $-$ before each of them, and evaluate the obtained expression. The result is included in $A'$. For example, if $A = \{2,8,13,20\}$, numbers $8$ and $14 = 20-2+8$ are elements of $A'$. Set $A''$ is constructed from $A'$ in the same manner. Find the smallest possible number of elements of $A$, if $A''$ contains all the integers from $1$ to $40$.

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

A set $S$ of natural numbers is called [i]good[/i], if for each element $x \in S, x$ does not divide the sum of the remaining numbers in $S$. Find the maximal possible number of elements of a [i]good [/i]set which is a subset of the set $A = \{1,2, 3, ...,63\}$.

Let $A$ be the set of odd integers $\leq 2n-1.$ For a positive integer $m$, let $B=\{a+m\,|\, a\in A \}.$ Determine for which positive integers $n$ there exists a positive integer $m$ such that the product of all elements in $A$ and $B$ is a square.

Consider the following sequence of sets: $ \{ 1,2\} ,\{ 3,4,5\}, \{ 6,7,8,9\} ,... $ [b]a)[/b] Find the samllest element of the $ 100\text{-th} $ term. [b]b)[/b] Is $ 2015 $ the largest element of one of these sets?

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.