Prove tha number $19 \cdot 8^n +17$ is composite for every positive integer $n$

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.

Let $p_n$ be the product of the $n$th roots of $1$. For integral $x > 4$, let $f(x) = p_1 - p_2 + p_3 - p_4 + ... + (-1)^{x+1}p_x$. What is $f(2010)$?

A triangle is [i]nondegenerate[/i] if its three vertices are not collinear. A particular nondegenerate triangle $\triangle JHU$ has side lengths $x,$ $y,$ and $z,$ and its angle measures, in degrees, are all integers. If there exists a nondegenerate triangle with side lengths $x^2,$ $y^2,$ and $z^2,$ then what is the largest possible angle measure in the original triangle $\triangle JHU,$ in degrees?

Let $A$ be an invertible $n \times n$ matrix with complex entries. Suppose that for each positive integer $m$, there exists a positive integer $k_m$ and an $n \times n$ invertible matrix $B_m$ such that $A^{k_m m} = B_m A B_m ^{-1}$. Show that all eigenvalues of $A$ are equal to $1$.

Let $x_0 = 10^9$, $x_n = \frac{x^2_{n-1}+2}{2x_{n-1}}$ for $n > 0$. Prove that $0 < x_{36} - \sqrt2 < 10^{-9}$.

In a cardboard box are a large number of loose socks. Some of the socks are red, the others are blue. It is stated that the total number of socks does not exceed $1993$. Furthermore, it is stated that the probability of pulling two socks from the same color when two socks are randomly drawn from the box is $1/2$. What is according to the available information, the largest number of red socks that can exist in the box?

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.

Andy flips a strange coin for which the probability of flipping heads is $\frac{1}{2^k+1}$, where $k$ is the number of heads that appeared previously. If Andy flips the coin repeatedly until he gets heads 10 times, what is the expected number of total flips he performs? [i]Proposed by Harry Kim[/i]

Let $ABCDEF$ be a convex hexagon with $\angle A = \angle C=\angle E$ and $\angle B = \angle D=\angle F$. [list=a] [*] Prove that there is a unique point $P$ which is equidistant from sides $AB,CD$ and $EF$. [*] If $G_1$ and $G_2$ are the centers of mass of $\triangle ACE$ and $\triangle BDF$, show that $\angle G_1PG_2=60^{\circ}$.

Let $n\ge 2$ be a positive integer, and let $P_1P_2\dots P_{2n}$ be a polygon with $2n$ sides such that no two sides are parallel. Denote $P_{2n+1}=P_1$. For some point $P$ and integer $i\in\{1,2,\ldots,2n\}$, we say that $i$ is a $P$-good index if $PP_{i}>PP_{i+1}$, and that $i$ is a $P$-bad index if $PP_{i}<PP_{i+1}$. Prove that there's a point $P$ such that the number of $P$-good indices is the same as the number of $P$-bad indices.

A [i]hedgehog[/i] is a circle without its boundaries. The diameter of the hedgehog is the diameter of the corresponding circle. We say that the hedgehog sits at the at the point where the center of the circle is located. We are given a triangle with sides $a, b, c$, with hedgehogs sitting at its vertices. It is known that inside the triangle there is a point from which you can reach any side of the triangle by walking along a straight line without hitting any hedgehog. What is the largest possible sum of the diameters of these hedgehogs? [i]Proposed by Oleksiy Masalitin[/i]

All sides of triangle $ABC$ are different. On rays $B A$ and $C A$ the segments $B K$ and $CM$ are laid out, equal to side $BC$. Let us denote by $x$ the length of the segment $KM$. In the same way, by plotting the side $AC$ on the rays $AB$ and $CB$ from $A$ and $C$, we obtain a segment of length $y$, and by plotting the side AB on the rays $AC$ and $BC$, we obtain a segment of length $z$. a) Prove that a triangle can be formed from the segments $x$, $y$ and $z$, and this triangle is similar to triangle $ABC$. b) Find the radius of the circumcircle of a triangle with sides $x$, $y$ and $z$, if the radii of the circumscribed and inscribed circles of triangle $ABC$ are equal to $R$ and $r$ respectively.

Let $I$ be the incenter of triangle $ABC$, and $\ell$ be the perpendicular bisector of $AI$. Suppose that $P$ is on the circumcircle of triangle $ABC$, and line $AP$ and $\ell$ intersect at point $Q$. Point $R$ is on $\ell$ such that $\angle IPR = 90^{\circ}$.Suppose that line $IQ$ and the midsegment of $ABC$ that is parallel to $BC$ intersect at $M$. Show that $\angle AMR = 90^{\circ}$ (Note: In a triangle, a line connecting two midpoints is called a midsegment.)

In trapezoid $ABCD$ with $AB$ parallel to $CD$ show that : $\frac{|AB|^2-|BC|^2+|AC|^2}{|CD|^2-|AD|^2+|AC|^2}=\frac{|AB|}{|CD|}=\frac{|AB|^2-|AD|^2+|BD|^2}{|CD|^2-|BC|^2+|BD|^2}$

Vulcan and Neptune play a turn-based game on an infinite grid of unit squares. Before the game starts, Neptune chooses a finite number of cells to be [i]flooded[/i]. Vulcan is building a [i]levee[/i], which is a subset of unit edges of the grid (called [i]walls[/i]) forming a connected, non-self-intersecting path or loop*. The game then begins with Vulcan moving first. On each of Vulcan’s turns, he may add up to three new walls to the levee (maintaining the conditions for the levee). On each of Neptune’s turns, every cell which is adjacent to an already flooded cell and with no wall between them becomes flooded as well. Prove that Vulcan can always, in a finite number of turns, build the levee into a closed loop such that all flooded cells are contained in the interior of the loop, regardless of which cells Neptune initially floods. ----- [size=75]*More formally, there must exist lattice points $\mbox{\footnotesize \(A_0, A_1, \dotsc, A_k\)}$, pairwise distinct except possibly $\mbox{\footnotesize \(A_0 = A_k\)}$, such that the set of walls is exactly $\mbox{\footnotesize \(\{A_0A_1, A_1A_2, \dotsc , A_{k-1}A_k\}\)}$. Once a wall is built it cannot be destroyed; in particular, if the levee is a closed loop (i.e. $\mbox{\footnotesize \(A_0 = A_k\)}$) then Vulcan cannot add more walls. Since each wall has length $\mbox{\footnotesize \(1\)}$, the length of the levee is $\mbox{\footnotesize \(k\)}$.[/size]

Solve the system of equations \[ |a_1-a_2|x_2+|a_1-a_3|x_3+|a_1-a_4|x_4=1 \] \[ |a_2-a_1|x_1+|a_2-a_3|x_3+|a_2-a_4|x_4=1 \] \[ |a_3-a_1|x_1+|a_3-a_2|x_2+|a_3-a_4|x_4=1 \] \[ |a_4-a_1|x_1+|a_4-a_2|x_2+|a_4-a_3|x_3=1 \] where $a_1, a_2, a_3, a_4$ are four different real numbers.