A permutation of a set is a bijection from the set to itself. For example, if $\sigma$ is the permutation $1 7\mapsto 3$, $2 \mapsto 1$, and $3 \mapsto 2$, and we apply it to the ordered triplet $(1, 2, 3)$, we get the reordered triplet $(3, 1, 2)$. Let $\sigma$ be a permutation of the set $\{1, ... , n\}$. Let $$\theta_k(m) = \begin{cases} m + 1 & \text{for} \,\, m < k\\ 1 & \text{for} \,\, m = k\\ m & \text{for} \,\, m > k\end{cases}$$ Call a finite sequence $\{a_i\}^{j}_{i=1}$ a disentanglement of $\sigma$ if $\theta_{a_j} \circ ...\circ \theta_{a_j} \circ \sigma$ is the identity permutation. For example, when $\sigma = (3, 2, 1)$, then $\{2, 3\}$ is a disentaglement of $\sigma$. Let $f(\sigma)$ denote the minimum number $k$ such that there is a disentanglement of $\sigma$ of length $k$. Let $g(n)$ be the expected value for $f(\sigma)$ if $\sigma$ is a random permutation of $\{1, ... , n\}$. What is $g(6)$?

Let $n \ne 0$ be a natural number and integers $x_1, x_2, ...., x_n, y_1, y_2, ...., y_n$ with the properties: a) $x_1 + x_2 + .... + x_n = y_1 + y_2 + .... + y_n = 0,$ b) $x_1 ^ 2 + y_1 ^ 2 = x_2 ^ 2 + y_2 ^ 2 = .... = x_n ^ 2 + y_n ^ 2$. Show that $n$ is even.

Let $\lambda$ be a line and let $M, N$ be two points on $\lambda$. Circles $\alpha$ and $\beta$ centred at $A$ and $B$ respectively are both tangent to $\lambda$ at $M$, with $A$ and $B$ being on opposite sides of $\lambda$. Circles $\gamma$ and $\delta$ centred at $C$ and $D$ respectively are both tangent to $\lambda$ at $N$, with $C$ and $D$ being on opposite sides of $\lambda$. Moreover $A$ and $C$ are on the same side of $\lambda$. Prove that if there exists a circle tangent to all circles $\alpha, \beta, \gamma, \delta$ containing all of them in its interior, then the lines $AC, BD$ and $\lambda$ are either concurrent or parallel.

During his excursion to the historical park, Pepito set out to collect stones whose weight in kilograms is a power of two. Once the first stone has been collected, Pepito only collects stones strictly heavier than the first. At the end of the excursion, her partner Ana chooses a positive integer $K \ge 2$ and challenges Pepito to divide the stones into $K$ groups of equal weight. a) Can Pepito meet the challenge if all the stones he collected have different weights? b) Can Pepito meet the challenge if some collected stones are allowed to have equal weight?

From the altitudes of an acute-angled triangle, a triangle can be composed. Prove that a triangle can be composed from the bisectors of this triangle.

Let $ x$ and $ y$ be two-digit integers such that $ y$ is obtained by reversing the digits of $ x$. The integers $ x$ and $ y$ satisfy $ x^2 \minus{} y^2 \equal{} m^2$ for some positive integer $ m$. What is $ x \plus{} y \plus{} m$? $ \textbf{(A)}\ 88\qquad \textbf{(B)}\ 112\qquad \textbf{(C)}\ 116\qquad \textbf{(D)}\ 144\qquad \textbf{(E)}\ 154$

Let p be a prime and $a_1 , a_2 , ..., a_k$ pairwise incongruent modulo p . Prove that $[\sqrt {k-1}]$ of the elements can be selected from $a_i$'s such that adding any numbers different from the selected ones will never give a number divisible by p .

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

Let $ABCD$ be a cyclic quadrilateral with $O$ is circumcenter and $AC$ meets $BD$ at $I$ Suppose that rays $DA,CD$ meet at $E$ and rays $BA,CD$ meet at $F$. The Gauss line of $ABCD$ meets $AB,BC,CD,DA$ at points $M,N,P,Q$ respectively. Prove that the circle of diameter $OI$ is tangent to two circles $(ENQ), (FMP)$

Let $p > 3$ be a prime number and $ x$ an integer, denote by $r ( x )\in \{ 0 , 1 , ... , p - 1 \}$ to the rest of $x$ modulo $p$ . Let $x_1, x_2, ... , x_k$ ( $2 < k < p$) different integers modulo $p$ and not divisible by $p$. We say that a number $a \in \{ 1 , 2 ,..., p -1 \}$ is [i]good [/i] if $r ( a x_1) < r ( a x_2) <...< r ( a x_k)$. Show that there are at most $\frac{2 p}{k + 1}-{ 1}$ [i]good [/i] numbers.