Let $ X $ be the power set of set of $ \{ 0\}\cup\mathbb{N} , $ and let be a function $ d:X^2\longrightarrow\mathbb{R} $ defined as $$ d(U,V)=\sum_{n\in\mathbb{N}}\frac{\chi_U (n) +\chi_V (n) -2\chi_{U\cap V} (n)}{2} , $$ where $ \chi_W (n)=\left\{ \begin{matrix} 1,& n\in W\\ 0,& n\not\in W \end{matrix} \right. ,\quad\forall W\in X,\forall n\in\mathbb{N} . $ [b]a)[/b] Prove that there exists an unique $ V' $ such that $ \lim_{k\to\infty} d\left( \{ k+i|i\in\mathbb{N}\} , V'\right) =0. $ [b]b)[/b] Demonstrate that for all $ V\in X $ there exists a $ v\in\mathbb{N} $ with $ d\left( \left\{ \frac{3}{2} -\frac{1}{2}(-1)^{v} \right\} , V \right) >\frac{1}{k} . $ [b]c)[/b] Let $ f: X\longrightarrow X,\quad f(X)=\left\{ 1+x|x\in X\right\} . $ Calculate $ d\left( f(A),f(B) \right) $ in terms of $ d(A,B) $ and prove that $ f $ admits an unique fixed point.

For any natural number $ n\ge 2, $ define $ m(n) $ to be the minimum number of elements of a set $ S $ that simultaneously satisfy: $ \text{(i)}\quad \{ 1,n\} \subset S\subset \{ 1,2,\ldots ,n\} $ $ \text{(ii)}\quad $ any element of $ S, $ distinct from $ 1, $ is equal to the sum of two (not necessarily distinct) elements from $ S. $ [b]a)[/b] Prove that $ m(n)\ge 1+\left\lfloor \log_2 n \right\rfloor ,\quad\forall n\in\mathbb{N}_{\ge 2} . $ [b]b)[/b] Prove that there are infinitely many natural numbers $ n\ge 2 $ such that $ m(n)=m(n+1). $ $ \lfloor\rfloor $ denotes the usual integer part.

A subset of the set $A={1,2,\dots ,n}$ is called [i]connected[/i], if it consists of one number or a certain amount of consecutive numbers. Find the greatest $k$ (defined as a function of $n$) for which there exists $k$ different subsets $A_1,A_2,…,A_k$ of $A$ the intersection of each two of which is a [i]connected[/i] set.

Given a finite set of real numbers $A$, not containing $0$ and $1$ and possessing the property: if the number a belongs to $A$, then numbers $\frac{1}{a}$ and $1-a$ also belong to $A$. How many numbers are in the set $A$?

Prove that there exist positive constants $ c$ and $ n_0$ with the following property. If $ A$ is a finite set of integers, $ |A| \equal{} n > n_0$, then \[ |A \minus{} A| \minus{} |A \plus{} A| \leq n^2 \minus{} c n^{8/5}.\]

Let $X$ be a finite set with $n\geqslant 3$ elements and let $A_1,A_2,\ldots, A_p$ be $3$-element subsets of $X$ satisfying $|A_i\cap A_j|\leqslant 1$ for all indices $i,j$. Show that there exists a subset $A{}$ of $X$ so that none of $A_1,A_2,\ldots, A_p$ is included in $A{}$ and $|A|\geqslant\lfloor\sqrt{2n}\rfloor$.

Is there a countable set $Y$ and an uncountable family $\mathcal F$ of its subsets such that for every two distinct $A,B\in\mathcal F$, their intersection $A\cap B$ is finite?

Let $S$ is the set of permutation of {1,2,3,4,5,6,7,8} (1)For all $\sigma=\sigma_1\sigma_2...\sigma_8\in S$ Evaluate the sum of S=$\sigma_1\sigma_2+\sigma_3\sigma_4+\sigma_5\sigma_6+\sigma_7\sigma_8$. Then for all elements in $S$,what is the arithmetic mean of S? (Notice $S$ and S are different.) (2)In $S$, how many permutations are there which satisfies "For all $k=1,2,...,7$,the digit after k is [b]not[/b] (k+1)"?

We say that a subset of $\mathbb{R}^n$ is $k$-[i]almost contained[/i] by a hyperplane if there are less than $k$ points in that set which do not belong to the hyperplane. We call a finite set of points $k$-[i]generic[/i] if there is no hyperplane that $k$-almost contains the set. For each pair of positive integers $(k, n)$, find the minimal number of $d(k, n)$ such that every finite $k$-generic set in $\mathbb{R}^n$ contains a $k$-generic subset with at most $d(k, n)$ elements. (Proposed by Shachar Carmeli, Weizmann Inst. and Lev Radzivilovsky, Tel Aviv Univ.)

King Radford of Peiza is hosting a banquet in his palace. The King has an enormous circular table with $2021$ chairs around it. At The King's birthday celebration, he is sitting in his throne (one of the $2021$ chairs) and the other $2020$ chairs are filled with guests, with the shortest guest sitting to the King's left and the remaining guests seated in increasing order of height from there around the table. The King announces that everybody else must get up from their chairs, run around the table, and sit back down in some chair. After doing this, The King notices that the person seated to his left is different from the person who was previously seated to his left. Each other person at the table also notices that the person sitting to their left is different. Find a closed form expression for the number of ways the people could be sitting around the table at the end. You may use the notation $D_{n},$ the number of derangements of a set of size $n$, as part of your expression.

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.

For $p$, $q$, $l$ strictly positive real numbers, consider the following problem: for $y \geq 0$ fixed, determine the values $x \geq 0$ such that $x^p - lx^q \leq y$. Denote by $S(y)$ the set of solutions of this problem. Prove that if one has $p < q$, $\epsilon \in (0, l^\frac{1}{p-q})$, $0 \leq x \leq \epsilon$ and $x \in S(y)$, then $$x\leq ky^{\delta},\ \text{where}\ k=\epsilon\left(\epsilon^p-l\epsilon^q\right)^{-\frac{1}{p}}\ \text{and}\ \delta=\frac{1}{p}$$

Prove that if $X{}$ is an infinite set of cardinality $\kappa$ then there is a collection $\mathcal{F}$ of subsets of $X$ such that[list] [*]For any $A\subseteq X$ with cardinality $\kappa$ there exists $F\in\mathcal{F}$ for which $A\cap F$ has cardinality $\kappa,$ and [*]$X$ cannot be written as the union of less than $\kappa$ sets from $\mathcal{F}$ and a single set of cardinality less than $\kappa$. [/list]

If $(A, <)$ is a partially ordered set, its dimension, $\dim (A, <)$, is the least cardinal $\kappa$ such that there exist $\kappa$ total orderings $\{ <_{\alpha} \colon \alpha < \kappa \}$ on $A$ with $<=\cap_{\alpha < \kappa} <_\alpha$. Show that if $\dim (A, <)>\aleph_0$, then there exist disjoint $A_0, A_1\subseteq A$ with $\dim (A_0, <)$, $\dim (A_1, <)>\aleph_0$. [D. Kelly, A. Hajnal, B. Weiss]

On the VI-th International Festival of Young Mathematicians in Sozopol $n$ teams were participating, each of which was with $k$ participants ($n>k>1$). The organizers of the competition separated the $nk$ participants into $n$ groups, each with $k$ people, in such way that no two teammates are in the same group. Prove that there can be found $n$ participants no two of which are in the same team or group.

On the VI-th International Festival of Young Mathematicians in Sozopol $n$ teams were participating, each of which was with $k$ participants ($n>k>1$). The organizers of the competition separated the $nk$ participants into $n$ groups, each with $k$ people, in such way that no two teammates are in the same group. Prove that there can be found $n$ participants no two of which are in the same team or group.

Determine the greatest natural number $n$, such that for each set $S$ of 2015 different integers there exist 2 subsets of $S$ (possible to be with 1 element and not necessarily non-intersecting) each of which has a sum of its elements divisible by $n$.

Let $S$ be a finite set with n elements and $\mathcal F$ a family of subsets of $S$ with the following property: $$A\in\mathcal F,A\subseteq B\subseteq S\implies B\in\mathcal F.$$Prove that the function $f:[0,1]\to\mathbb R$ given by $$f(t):=\sum_{A\in\mathcal F}t^{|A|}(1-t)^|S\setminus A|$$is nondecreasing ($|A|$ denotes the number of elements of $A$).

Let $S=\{A_1,A_2,\ldots ,A_n\}$, where $A_1,A_2,\ldots ,A_n$ are $n$ pairwise distinct finite sets $(n\ge 2)$, such that for any $A_i,A_j\in S$, $A_i\cup A_j\in S$. If $k= \min_{1\le i\le n}|A_i|\ge 2$, prove that there exist $x\in \bigcup_{i=1}^n A_i$, such that $x$ is in at least $\frac{n}{k}$ of the sets $A_1,A_2,\ldots ,A_n$ (Here $|X|$ denotes the number of elements in finite set $X$).

We call a system of non-empty sets $H$ [i]entwined[/i], if for every disjoint pair of sets $A$ and $B$ in $H$ there exists $b\in B$ such that $A\cup\{b\}$ is in $H$ or there exists $a\in A$ such that $B\cup\{a\}$ is in $H.$ Let $H$ be an entwined system of sets containing all of $\{1\},\{2\},\ldots,\{n\}.$ Prove that if $n>k(k+1)/2,$ then $H$ contains a set with at least $k+1$ elements, and this is sharp for every $k,$ i.e. if $n=k(k+1),$ it is possible that every set in $H$ has at most $k$ elements.

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

Find the biggest natural number $m$ that has the following property: among any five 500-element subsets of $\{ 1,2,\dots, 1000\}$ there exist two sets, whose intersection contains at least $m$ numbers.

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.

Find the minimum positive integer $n$ such that for any set $A$ with $n$ positive intergers has $15$ elements which sum is divisible by $15$.

Let be a parametric set: $$ \mathcal{F}_{\lambda } =\left\{ f:[1,\infty)\longrightarrow\mathbb{R}\bigg| x\in(1,\infty )\implies \int_{x}^{x^2+\lambda^2 x} f\left( \xi\right) d\xi =1\right\} . $$ [b]a)[/b] Show that $ \mathcal{F}_0 =\emptyset . $ [b]b)[/b] Prove that $ \lambda\neq 0 $ implies $ \mathcal{F}_{\lambda }\neq\emptyset . $