Show that the number of finite sequences of length $ n $ that are formed with $ 5 $ distinct numbers such that for any three consecutive terms of the sequence at least two are equal, is $ \frac{5}{2}\left( (-1)^n+3^n \right) . $

Given a square $ABCD$ with side length $6$. We draw line segments from the midpoints of each side to the vertices on the opposite side. For example, we draw line segments from the midpoint of side $AB$ to vertices $C$ and $D$. The eight resulting line segments together bound an octagon inside the square. What is the area of this octagon?

In a triangle $ABC$, right in $A$ and isosceles, let $D$ be a point on the side $AC$ ($A \ne D \ne C$) and $E$ be the point on the extension of $BA$ such that the triangle $ADE$ is isosceles. Let $P$ be the midpoint of segment $BD$, $R$ be the midpoint of the segment $CE$ and $Q$ the intersection point of $ED$ and $BC$. Prove that the quadrilateral $ARQP$ is a square.

A triangle has two sides of lengths $1984$ and $2016$. Find the maximum possible area of the triangle. [i]Proposed by Nathan Ramesh

The altitude $AH, BT$, and $CR$ are drawn in the non isosceles triangle $ABC$. On the side $BC$ mark the point $P$; points $X$ and $Y$ are projections of $P$ on $AB$ and $AC$. Two common external tangents to the circumscribed circles of triangles $XBH$ and $HCY$ intersect at point $Q$. The lines $RT$ and $BC$ intersect at point $K$. a). Prove that the point $Q$ lies on a fixed line independent of choice$ P$. b). Prove that $KQ = QH$.

Let $n\ge 1$ be an odd integer. Alice and Bob play the following game, taking alternating turns, with Alice playing first. The playing area consists of $n$ spaces, arranged in a line. Initially all spaces are empty. At each turn, a player either • places a stone in an empty space, or • removes a stone from a nonempty space $s,$ places a stone in the nearest empty space to the left of $s$ (if such a space exists), and places a stone in the nearest empty space to the right of $s$ (if such a space exists). Furthermore, a move is permitted only if the resulting position has not occurred previously in the game. A player loses if he or she is unable to move. Assuming that both players play optimally throughout the game, what moves may Alice make on her first turn?

Suppose that the greatest common divisor of $n$ and $5040$ is equal to $120.$ Determine the sum of the four smallest possible positive integers $n.$

Find all function $ f: \mathbb{R} \rightarrow \mathbb{R}$ such that \[ f(x \plus{} y)(f(x) \minus{} y) \equal{} xf(x) \minus{} yf(y) \] for all $ x,y \in \mathbb{R}$.

An integer number $n\geq 2$ and real numbers $x_1<x_2<\cdots < x_n$ are given. $f: \mathbb R \to \mathbb R$ is a function defined as $$ f(x) = \left | \dfrac{(x-x_2)(x-x_3)\cdots (x-x_n)}{(x_1-x_2)(x_1-x_3)\cdots (x_1-x_n)} \right | + \cdots + \left | \dfrac{(x-x_1)(x-x_2)\cdots (x-x_{n-1})}{(x_n-x_1)(x_n-x_2)\cdots (x_n-x_{n-1})} \right |. $$ Prove that there exists $i\in \{1,2,\cdots,n-1\}$ such that for all $x\in (x_i,x_{i+1})$ one has $f(x)< \sqrt n$. Proposed by [i]Navid Safaei[/i]

If $a$ and $b$ are randomly selected real numbers between $0$ and $1$, find the probability that the nearest integer to $\frac{a-b}{a+b}$ is odd.

Each face of a cube is painted either red or blue, each with probability $ 1/2$. The color of each face is determined independently. What is the probability that the painted cube can be placed on a horizontal surface so that the four vertical faces are all the same color? $ \textbf{(A)}\ \frac14 \qquad \textbf{(B)}\ \frac{5}{16} \qquad \textbf{(C)}\ \frac38 \qquad \textbf{(D)}\ \frac{7}{16} \qquad \textbf{(E)}\ \frac12$

A fly and an ant are on one corner of a unit cube. They wish to head to the opposite corner of the cube. The fly can fly through the interior of the cube, while the ant has to walk across the faces of the cube. How much shorter is the fly's path if both insects take the shortest path possible?

Determine all positive integers $d$ such that whenever $d$ divides a positive integer $n$, $d$ will also divide any integer obtained by rearranging the digits of $n$.

The following sets of points are considered in the plane: $A=\{$ affixes of complexes $z$ such that arg $(z - (2 + 3i))=\pi /4\}$, $B =\{$ affixes of complexes $z$ such that mod $( z- (2 + i)<2\}$. Determine the orthogonal projection on the $X$ axis of $A \cap B$.

$ABC$ is an acute triangle with orthocenter $H$. Points $D$ and $E$ lie on segment $BC$. Circumcircle of $\triangle BHC$ instersects with segments $AD$,$AE$ at $P$ and $Q$, respectively. Prove that if $BD^2+CD^2=2DP\cdot DA$ and $BE^2+CE^2=2EQ\cdot EA$, then $BP=CQ$.

Let $C$ be a coloring of all edges and diagonals of a convex $n$−gon in red and blue (in Romanian, rosu and albastru). Denote by $q_r(C)$ (resp. $q_a(C)$) the number of quadrilaterals having all its edges and diagonals red (resp. blue). Prove: $ \underset{C}{min} (q_r(C)+q_a(C)) \le \frac{1}{32} {n \choose 4}$