Found problems: 4
For $n=2^m$ (m is a positive integer) consider the set $M(n) = \{ 1,2,...,n\}$ of natural numbers.
Prove that there exists an order $a_1, a_2, ..., a_n$ of the elements of M(n), so that for all $1\leq i < j < k \leq n$ holds: $a_j - a_i \neq a_k - a_j$.
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 $p = (a_{1}, a_{2}, \ldots , a_{12})$ be a permutation of $1, 2, \ldots, 12$.
We will denote \[S_{p} = |a_{1}-a_{2}|+|a_{2}-a_{3}|+\ldots+|a_{11}-a_{12}|\]We'll call $p$ $\textit{optimistic}$ if $a_{i} > \min(a_{i-1}, a_{i+1})$ $\forall i = 2, \ldots, 11$.
$a)$ What is the maximum possible value of $S_{p}$. How many permutations $p$ achieve this maximum?$\newline$
$b)$ What is the number of $\textit{optimistic}$ permtations $p$?
$c)$ What is the maximum possible value of $S_{p}$ for an $\textit{optimistic}$ $p$? How many $\textit{optimistic}$ permutations $p$ achieve this maximum?
A permutation $\sigma$ of the numbers $1,2,\ldots , 10$ is called $\textit{bad}$ if there exist integers $i, j, k$ which satisfy
\[1 \leq i < j < k \leq 10 \quad \text{ and }\quad \sigma(j) < \sigma(k) < \sigma(i)\]
and $\textit{good}$ otherwise. Find the number of $\textit{good}$ permutations.