Found problems: 175
Let $A$ be the subset of $\{1, 2, ..., 16\}$ that has $6$ elements. Prove that there exist $2$ subsets of $A$ that are disjoint, and the sum of their elements are the same.
For a finite set $A$ of positive integers and its subset $B$, call $B$ a [i]half subset[/i] of $A$ when it satisfies the equation $\sum_{a\in A}a=2\sum_{b\in B}b$. For example, if $A=\{1,2,3\}$, then $\{1,2\}$ and $\{3\}$ are half subset of $A$. Determine all positive integers $n$ such that there exists a finite set $A$ which has exactly $n$ half subsets.
Given two distinct elements $a,b \in \{-1,0,1\}$, consider the matrix $A$ .
Find a subset $S$ of the set of the rows of $A$, of minimum size, such that every other row of $A$ is a linear combination of the rows in $S$ with integer coefficients.
Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$.
(a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$.
(b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good
Let $p >3$ be a prime number. For each nonempty subset $T$ of $\{0,1,2,3, \ldots , p-1\}$, let $E(T)$ be the set of all $(p-1)$-tuples $(x_1, \ldots ,x_{p-1} )$, where each $x_i \in T$ and $x_1+2x_2+ \ldots + (p-1)x_{p-1}$ is divisible by $p$ and let $|E(T)|$ denote the number of elements in $E(T)$. Prove that
\[|E(\{0,1,3\})| \geq |E(\{0,1,2\})|\]
with equality if and only if $p = 5$.
Given the disjoint finite sets of natural numbers $ A $ and $ B $, consisting of $ n $ and $ m $ elements, respectively. It is known that every natural number belonging to $ A $ or $ B $ satisfies at least one of the conditions $ k + 17 \in A $, $ k-31 \in B $. Prove that $ 17n = 31m $
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$.
We shall call the triplet of numbers $a, b, c$ of the interval $[-1,1]$ [i]qualitative [/i] if these numbers satisfy the inequality $1 + 2abc\ge a^2 + b^2 + c^2$. Prove that when the triples $a, b, c$, and $x, y, z$ are qualitative, then $ax, by, cz$ is also qualitative.
Consider the set $M=\{1,2,3,...,2003\}$. How many subsets of $M$ with even number of elements exist?
Let $A$ be a set with $1000$ members and $\mathcal F =${$A_1,A_2,\ldots,A_n$} a family of subsets of A such that
(a) Each element in $\mathcal F$ consists of 3 members
(b) For every five elements in $\mathcal F$, the union of them all will have at least $12$ members
Find the largest value of $n$
Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$.
(a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$.
(b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good
Let $m$ and $n$ be positive integers with $m > n \ge 2$. Set $S =\{1,2,...,m\}$, and set $T = \{a_1,a_2,...,a_n\}$ is a subset of $S$ such that every element of $S$ is not divisible by any pair of distinct elements of $T$. Prove that
$$\frac{1}{a_1}+\frac{1}{a_2}+ ...+ \frac{1}{a_n} < \frac{m+n}{m}$$
A set $S$ has $7$ elements. Several $3$-elements subsets of $S$ are listed, such
that any $2$ listed subsets have exactly $1$ common element. What is the maximum number of subsets that can be listed?
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$
Find all finite sets $M \subset R, |M| \ge 2$, satisfying the following condition:
[i]for all $a, b \in M, a \ne b$, the number $a^3 - \frac{4}{9}b$ also belongs to $M$.
[/i]
(I. Voronovich)
Let $1\le k\le n$ be integers. At most how many $k$-element subsets can we select from $\{1,2,\dots,n\}$ such that for any two selected subsets, one of the subsets consists of the $k$ smallest elements of their union?
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)$.
Determine how many unordered pairs $\{A,B\}$ is there such that $A,B\subseteq\{1,\ldots,n\}$ and $A\cap B=\emptyset.$
Is it possible to divide the integers from $1$ to $100$ inclusive into $50$ pairs such that for $1\le k\le 50$, the difference between the two numbers in the $k$-th pair is $k$?
(V Proizvolov)
Let $Y$ be the family of all subsets of $X = \{1,2,...,n\}$ ($n > 1$) and let $f : Y \to X$ be an arbitrary mapping. Prove that there exist distinct subsets $A,B$ of $X$ such that $f(A) = f(B) = max A\triangle B$, where $A\triangle B = (A-B)\cup(B-A)$.
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 $X=\{1,2,3,...,12\}$. 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,8\}$.
Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.
Consider two disjoint finite sets of positive integers, $A$ and $B$, have $n$ and $m$ elements, respectively. It is knows that all $k$ belonging to $A \cup B$ satisfies at least one of the conditions $k + 17 \in A$ and $k - 31 \in B$.
Prove that $17n = 31m$.