Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

Points $M$, $N$, $K$ lie on the sides $BC$, $CA$, $AB$ of a triangle $ABC$, respectively, and are different from its vertices. The triangle $MNK$ is called[i] beautiful[/i] if $\angle BAC=\angle KMN$ and $\angle ABC=\angle KNM$. If in the triangle $ABC$ there are two beautiful triangles with a common vertex, prove that the triangle $ABC$ is right-angled. [i]Proposed by Nairi M. Sedrakyan, Armenia[/i]

$P(x)$ is a monoic polynomial with integer coefficients so that there exists monoic integer coefficients polynomials $p_1(x),p_2(x),\dots ,p_n(x)$ so that for any natural number $x$ there exist an index $j$ and a natural number $y$ so that $p_j(y)=P(x)$ and also $deg(p_j) \ge deg(P)$ for all $j$.Show that there exist an index $i$ and an integer $k$ so that $P(x)=p_i(x+k)$.

9.2 Given 19 cards. Is it possible to write a nonzero digit on each card in such a way that you can compose from these cards an unique 19-digits number, which is divisible by 11? ([i]R. Zhenodarov, I. Bogdanov[/i])

Can one cover a cube by three paper triangles (without overlapping)?

Let $G$ be the centroid of a triangle $ABC$ and let $d$ be a line that intersects $AB$ and $AC$ at $B_{1}$ and $C_{1}$, respectively, such that the points $A$ and $G$ are not separated by $d$. Prove that: $[BB_{1}GC_{1}]+[CC_{1}GB_{1}] \geq \frac{4}{9}[ABC]$.

$(SWE 2)$ For each $\lambda (0 < \lambda < 1$ and $\lambda = \frac{1}{n}$ for all $n = 1, 2, 3, \cdots)$, construct a continuous function $f$ such that there do not exist $x, y$ with $0 < \lambda < y = x + \lambda \le 1$ for which $f(x) = f(y).$

Consider the equation $ x^4 \minus{} 4x^3 \plus{} 4x^2 \plus{} ax \plus{} b \equal{} 0$, where $ a,b\in\mathbb{R}$. Determine the largest value $ a \plus{} b$ can take, so that the given equation has two distinct positive roots $ x_1,x_2$ so that $ x_1 \plus{} x_2 \equal{} 2x_1x_2$.

Determine all pairs $(m,n)$ of positive integers such that a $m\times n$ rectangle can be tiled with L-trominoes.

Let $ABCD$ be an isosceles trapezoid with bases $AB$ and $CD$. Prove that the centroid of triangle $ABD$ lies on $CF$ where $F$ is the projection of $D$ to $AB$.

For which positive integers $n \ge 3$ is it possible to mark $n$ points of a plane in such a way that, starting from one marked point and moving on each step to the marked point which is the second closest to the current point, one can walk through all the marked points and return to the initial one? For each point, the second closest marked point must be uniquely determined.

The numbers $a,b,c$ are the digits of a three digit number which satisfy $49a+7b+c = 286$. What is the three digit number $(100a+10b+c)$?

Let $n$ be a positive integer, and let $A_{n}$ be the the set of all positive integers $a\le n$ such that $n|a^{n}+1$. a) Find all $n$ such that $A_{n}\neq \emptyset$ b) Find all $n$ such that $|{A_{n}}|$ is even and non-zero. c) Is there $n$ such that $|{A_{n}}| = 130$?

If the normal to the curve $x^{\frac{2}{3}}+y^{\frac23}=a^{\frac23}$ at some point makes an angle $\theta$ with the $X$-axis, show that the equation of the normal is \[y\cos\theta-x\sin\theta=a\cos 2\theta\]

Let $PQ$ and $PR$ be tangents to a circle $\omega$ with diameter $AB$ so that $A, Q, R, B$ lie on $\omega$ in that order. Let $H$ be the projection of $P$ onto $AB$ and let $AR$ and $PH$ intersect at $S$. If $\angle QPH = 30^{\circ}$ and $\angle HPR = 20^\circ$, find $\angle ASQ$ in degrees.

In triangle $ABC$ the angular bisector from $A$ intersects the side $BC$ at the point $D$, and the angular bisector from $B$ intersects the side $AC$ at the point $E$. Furthermore $|AE| + |BD| = |AB|$. Prove that $\angle C = 60^o$ [img]https://1.bp.blogspot.com/-8ARqn8mLn24/XzP3P5319TI/AAAAAAAAMUQ/t71-imNuS18CSxTTLzYXpd806BlG5hXxACLcBGAsYHQ/s0/2018%2BMohr%2Bp5.png[/img]

Let $n$ be a natural number. A sequence $x_1,x_2, \cdots ,x_{n^2}$ of $n^2$ numbers is called $n-\textit{good}$ if each $x_i$ is an element of the set $\{1,2,\cdots ,n\}$ and the ordered pairs $\left(x_i,x_{i+1}\right)$ are all different for $i=1,2,3,\cdots ,n^2$ (here we consider the subscripts modulo $n^2$). Two $n-$good sequences $x_1,x_2,\cdots ,x_{n^2}$ and $y_1,y_2,\cdots ,y_{n^2}$ are called $\textit{similar}$ if there exists an integer $k$ such that $y_i=x_{i+k}$ for all $i=1,2,\cdots,n^2$ (again taking subscripts modulo $n^2$). Suppose that there exists a non-trivial permutation (i.e., a permutation which is different from the identity permutation) $\sigma$ of $\{1,2,\cdots ,n\}$ and an $n-$ good sequence $x_1,x_2,\cdots,x_{n^2}$ which is similar to $\sigma\left(x_1\right),\sigma\left(x_2\right),\cdots ,\sigma\left(x_{n^2}\right)$. Show that $n\equiv 2\pmod{4}$.

a) Prove that the equation $2^x + 21^x = y^3$ has no solution in the set of natural numbers. b) Solve the equation $2^x + 21^y = z^2y$ in the set of non-negative integer numbers.

There are $n$ light bulbs in a circle and one of them is marked. Let operation $A$: Take a positive divisor $d$ of the number $n,$ starting with the light bulb marked and clockwise, we count around the circumference from $1$ to $dn$, changing the state (on or off) to those light bulbs that correspond to the multiples of $d$. Let operation $B$ be: Apply operation$ A$ to all positive divisors of $n$ (to the first divider that is applied is with all the light bulbs off and the remaining divisors is with the state resulting from the previous divisor). Determine all the positive integers $n$, such that when applying the operation on $B$, all the light bulbs are on.

Let $\displaystyle a,b,c,d \in \mathbb R$ such that $\displaystyle a>c>d>b>1$ and $\displaystyle ab>cd$. Prove that $\displaystyle f : \left[ 0,\infty \right) \to \mathbb R$, defined through \[ \displaystyle f(x) = a^x+b^x-c^x-d^x, \, \forall x \geq 0 , \] is strictly increasing.

Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions: (a) every square that does not contain a checker shares a side with one that does; (b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side. Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.

$x$, $y$ and $z$ are real numbers where the sum of any two among them is not $1$. Show that, \[ \dfrac{(x^2+y)(x+y^2)}{(x+y-1)^2}+\dfrac{(y^2+z)(y+z^2)}{(y+z-1)^2} + \dfrac{(z^2+x)(z+x^2)}{(z+x-1)^2} \ge 2(x+y+z) - \dfrac{3}{4}\]Find all triples $(x,y,z)$ of real numbers satisfying the equality case.

Byan is playing raven, raven, falcon with his three friends. His friends sit down in a circle, and Byan repeatedly walks clockwise around them, tapping each friend he passes on the head and then saying `raven' or `falcon', each with probability $\frac{1}{2}$. The game ends after Byan has said `falcon' twice. The probability one of his friends will be called a falcon twice can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $100m+n$. [i]Individual #6[/i]

On a semicircle with unit radius four consecutive chords $AB,BC, CD,DE$ with lengths $a, b, c, d$, respectively, are given. Prove that \[a^2 + b^2 + c^2 + d^2 + abc + bcd < 4.\]

$n$ is natural number and $p$ is prime number. If $1+np$ is square of natural number then prove that $n+1$ is equal to some sum of $p$ square of natural numbers.