Found problems: 295
Numbers $1,2,3,...,2n$ are divided onto two equal groups. Let $a_1,a_2,...,a_n$ be the first group numbers in the increasing order, and $b_1,b_2,...,b_n$ -- the second group numbers in the decreasing order. Prove that $$|a_1 - b_1| + |a_2 - b_2| + ... + |a_n - b_n| = n^2$$
Let $S$ be a set which is closed under the binary operation $\circ$, with the following properties:
(i) there is an element $e \in S$ such that $a \circ e = e \circ a = a$, for each $a \in S$.
(ii) $(a \circ b) \circ (c \circ d)=(a \circ c) \circ (b \circ d)$, for all $a,b, c,d \in S$.
Prove or disprove:
(a) $\circ$ is associative on S
(b) $\circ$ is commutative on S
The positive integers are partitioned into two infinite sets so that the sum of any $2023$ distinct integers in one set is also in that set. Prove that one set contains all the odd positive integers, and one set contains all the even positive integers.
[i]Proposed by Evan Chang (squareman), USA[/i]
It is given set with $n^2$ elements $(n \geq 2)$ and family $\mathbb{F}$ of subsets of set $A$, such that every one of them has $n$ elements. Assume that every two sets from $\mathbb{F}$ have at most one common element. Prove that
$i)$ Family $\mathbb{F}$ has at most $n^2+n$ elements
$ii)$ Upper bound can be reached for $n=3$
Consider a finite set of points, $\Phi$, in the $\mathbb{R}^2$, such that they follow the following properties :
[list]
[*] $\Phi$ doesn't contain the origin $\{(0,0)\}$ and not all points are collinear.
[*] If $\alpha \in \Phi$, then $-\alpha \in \Phi$, $c\alpha \notin \Phi $ for $c\neq 1$ or $-1$
[*] If $\alpha, \ \beta$ are in $\Phi$, then the reflection of $\beta$ in the line passing through the origin and perpendicular to the line containing origin and $\alpha$ is in $\Phi$
[*] If $\alpha = (a,b) , \ \beta = (c,d)$, (both $\alpha, \ \beta \in \Phi$) then $\frac{2(ac+bd)}{c^2+d^2} \in \mathbb{Z}$
[/list]
Prove that there cannot be 5 collinear points in $\Phi$
Let $n$ be a natural number. Two numbers are called "unsociable" if their greatest common divisor is $1$. The numbers $\{1,2,...,2n\}$ are partitioned into $n$ pairs. What is the minimum number of "unsociable" pairs that are formed?
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}$
Find all finite sets $M \subset R$ containing at least two elements such that $(2a/3 -b^2) \in M$ for any two different elements $a,b \in M$.
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$.
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 $p \geq 7$ be a prime number and $$S = \bigg\{jp+1 : 1 \leq j \leq \frac{p-5}{2}\bigg\}.$$ Prove that at least one element of $S$ can be written as $x^2+y^2$, where $x, y$ are integers.
Let $S_{1},$ $S_{2},$ $...,$ $S_{n}$ be finitely many subsets of $\mathbb{N}$ such that $S_{1}\cup S_{2}\cup...\cup S_{n}=\mathbb{N}.$ Prove that there exists some $k\in\left\{ 1,2,...,n\right\} $ such that for each positive integer $m,$ the set $S_{k}$ contains infinitely many multiples of $m.$
Let $n \ge 3$ be a positive integer. Determine, in terms of $n$, how many triples of sets $(A,B,C)$ satisfy the conditions:
$\bullet$ $A, B$ and $C$ are pairwise disjoint , that is, $A \cap B = A \cap C= B \cap C= \emptyset$.
$\bullet$ $A \cup B \cup C= \{ 1 , 2 , ... , n \}$.
$\bullet$ The sum of the elements of $A$, the sum of the elements of $B$ and the sum of the elements of $C$ leave the same remainder when divided by $3$.
Note: One or more of the sets may be empty.
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 $\mathfrak F=\{A_1,A_2,\ldots,A_n\}$ be a collection of subsets of the set $S=\{1,2,\ldots,n\}$ satisfying the following conditions:
(a) Any two distinct sets from $\mathfrak F$ have exactly one element in common;
(b) each element of $S$ is contained in exactly $k$ of the sets in $\mathfrak F$.
Can $n$ be equal to $1996$?
Pupils of a school are divided into $112$ groups, of $11$ members each.
Any two groups have exactly one common pupil. Prove that:
a) there is a pupil that belongs to at least $12$ groups.
b) there is a pupil that belongs to all the groups.
Let $k$, $m$ and $n$ be integers such that $1<n \leq m-1 \leq k$. Find maximum size of subset $S$ of set $\{1,2,...,k\}$ such that sum of any $n$ different elements from $S$ is not:
$a)$ equal to $m$,
$b)$ exceeding $m$
Take $k\in \mathbb{Z}_{\ge 1}$ and the sets $A_1,A_2,\dots, A_k$ consisting of $x_1,x_2,\dots ,x_k$ positive integers, respectively. For any two sets $A$ and $B$, define $A+B=\{a+b~|~a\in A,~b\in B\}$.
Find the least and greatest number of elements the set $A_1+A_2+\dots +A_k$ may have.
[i] (Andrei Bâra)[/i]
Let $S$ be a set of positive integers such that $\lfloor \sqrt{x}\rfloor =\lfloor \sqrt{y}\rfloor $ for all $x, y \in S$. Show that the products $xy$, where $x, y \in S$, are pairwise distinct.
There are $n$($\ge 2$) clubs $A_1,A_2,...A_n$ in Korean Mathematical Society. Prove that there exist $n-1$ sets $B_1,B_2,...B_{n-1}$ that satisfy the condition below.
(1) $A_1\cup A_2\cup \cdots A_n=B_1\cup B_2\cup \cdots B_{n-1}$
(2) for any $1\le i<j\le n-1$, $B_i\cap B_j=\emptyset, -1\le\left\vert B_i \right\vert -\left\vert B_j \right\vert\le 1$
(3) for any $1\le i \le n-1$, there exist $A_k,A_j $($1\le k\le j\le n$)such that $B_i\subseteq A_k\cup A_j$
Determine the sets $S{}$ of positive integers satisfying the following two conditions:
[list=a]
[*]For any positive integers $a, b, c{}$, if $ab + bc + ca{}$ is in $S$, then so are $a + b + c{}$ and $abc$; and
[*]The set $S{}$ contains an integer $N \geqslant 160$ such that $N-2$ is not divisible by $4$.
[/list]
[i]Bogdan Blaga, United Kingdom[/i]
We call a set $S$ a [i]good[/i] set if $S=\{x,2x,3x\}(x\neq 0).$ For a given integer $n(n\geq 3),$ determine the largest possible number of the [i]good[/i] subsets of a set containing $n$ positive integers.
From all possible permutations from $(a_1,a_2,...,a_n)$ from the set $\{1,2,..,n\}$, $n\geq 1$, consider the sets that satisfies the $2(a_1+a_2+...+a_m)$ is divisible by $m$, for every $m=1,2,...,n$. Find the total number of permutations.
Let $N$ be a positive integer. It is given set of weights which satisfies following conditions:
$i)$ Every weight from set has some weight from $1,2,...,N$;
$ii)$ For every $i\in {1,2,...,N}$ in given set there exists weight $i$;
$iii)$ Sum of all weights from given set is even positive integer.
Prove that set can be partitioned into two disjoint sets which have equal weight
$(a)$ Is it possible to partition the segment $[0,1]$ into two sets $A$ and $B$ and to define a continuous function $f$ such that for every $x\in A \ f(x)$ is in $B$, and for every $x\in B \ f(x)$ is in $A$?
$(b)$ The same question with $[0,1]$ replaced by $[0,1).$