Let $n$ be any positive integer, and let $S(n)$ denote the number of permutations $\tau$ of $\{1,\dots,n\}$ such that $k^4+(\tau(k))^4$ is prime for all $k=1,\dots,n$. Show that $S(n)$ is always a square.

Let $A_{1}A_{2}A_{3}$ be an acute triangle, and let $O$ and $H$ be its circumcenter and orthocenter, respectively. For $1\leq i \leq 3$, points $P_{i}$ and $Q_{i}$ lie on lines $OA_{i}$ and $A_{i+1}A_{i+2}$ (where $A_{i+3}=A_{i}$), respectively, such that $OP_{i}HQ_{i}$ is a parallelogram. Prove that \[\frac{OQ_{1}}{OP_{1}}+\frac{OQ_{2}}{OP_{2}}+\frac{OQ_{3}}{OP_{3}}\geq 3.\]

The positive integer equal to the expression \[ \sum_{i=0}^{9} \left(i+(-9)^i\right)8^{9-i} \binom{9}{i}\] is divisible by exactly six distinct primes. Find the sum of these six distinct prime factors. [i]Team #7[/i]

Let point $I$ be the center of the inscribed circle of an acute-angled triangle $ABC$. Rays $AI$ and $BI$ intersect the circumcircle $k$ of triangle $ABC$ at points $D$ and $E$ respectively. The segments $DE$ and $CA$ intersect at point $F$, the line through point $E$ parallel to the line $FI$ intersects the circle $k$ at point $G$, and the lines $FI$ and $DG$ intersect at point $H$. Prove that the lines $CA$ and $BH$ touch the circumcircle of the triangle $DFH$ at the points $F$ and $H$ respectively.

The external bisectors of the angles of the convex quadrilateral $ABCD$ intersect each other in $E,F,G$ and $H$ such that $A\in EH, \ B\in EF, \ C\in FG, \ D\in GH$. We know that the perpendiculars from $E$ to $AB$, from $F$ to $BC$ and from $G$ to $CD$ are concurrent. Prove that $ABCD$ is cyclic.

Let $\, D \,$ be an arbitrary point on side $\, AB \,$ of a given triangle $\, ABC, \,$ and let $\, E \,$ be the interior point where $\, CD \,$ intersects the external common tangent to the incircles of triangles $\, ACD \,$ and $\, BCD$. As $\, D \,$ assumes all positions between $\, A \,$ and $\, B \,$, prove that the point $\, E \,$ traces the arc of a circle.

Find all prime numbers $p$ and positive integers $m$ such that $2p^2 + p + 9 = m^2.$

Consider $n\geq 3$ points in the plane, no three of which are collinear. For every convex polygon with vertices among the $n$ points, place $k\cdot 2^k$ coins in every one of its vertices, where $k$ is the number of points strictly in the interior of the polygon. Show that in total, no matter the configuration of the $n$ points, there are at most $n(n+1)\cdot 2^{n-3}$ placed coins. [i]Cristi Săvescu[/i]

For any $ n\ge 2 $ natural, show that the following inequality holds: $$ \sum_{i=2}^n\frac{1}{\sqrt[i]{(2i)!}}\ge\frac{n-1}{2n+2} . $$

On the sides $AB, AC ,BC$ of the triangle $ABC$, the points $M, N, K$ are selected, respectively, such that $AM = AN$ and $BM = BK$. The circle circumscribed around the triangle $MNK$ intersects the segments $AB$ and $BC$ for the second time at points $P$ and $Q$, respectively. Lines $MN$ and $PQ$ intersect at point $T$. Prove that the line $CT$ bisects the segment $MP$.

The $m \times n$ chessboard is colored by black and white. In one step, two neighbouring squares are selected (squares with a common side) and their color changes according to the follwing way: - white becomes black, - black become red, - Red becomes white. For which $m$ and $n$, these steps can change the colors of all the initial squares from white to black and from black to white?

Let $S$ be the set of all n-tuples $(X_1,...,X_n)$ of subsets of the set $\{1,2,..,1000\}$, not necessarily different and not necessarily nonempty. For $a = (X_1,...,X_n)$ denote by $E(a)$ the number of elements of $X_1\cup ... \cup X_n$. Find an explicit formula for the sum $\sum_{a\in S} E(a)$

Let $ \lfloor x \rfloor$ denote the greatest integer less than or equal to $ x.$ Pick any $ x_1$ in $ [0, 1)$ and define the sequence $ x_1, x_2, x_3, \ldots$ by $ x_{n\plus{}1} \equal{} 0$ if $ x_n \equal{} 0$ and $ x_{n\plus{}1} \equal{} \frac{1}{x_n} \minus{} \left \lfloor \frac{1}{x_n} \right \rfloor$ otherwise. Prove that \[ x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n < \frac{F_1}{F_2} \plus{} \frac{F_2}{F_3} \plus{} \ldots \plus{} \frac{F_n}{F_{n\plus{}1}},\] where $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$ for $ n \geq 1.$

Given four spheres with their radii equal to $2,2,3,3$ respectively, each sphere externally touches the other spheres. Suppose that there is another sphere that is externally tangent to all those four spheres, determine the radius of this sphere.

Gary plays the following game with a fair $n$-sided die whose faces are labeled with the positive integers between $1$ and $n$, inclusive: if $n = 1$, he stops; otherwise he rolls the die, and starts over with a $k$-sided die, where $k$ is the number his $n$-sided die lands on. (In particular, if he gets $k = 1$, he will stop rolling the die.) If he starts out with a $6$-sided die, what is the expected number of rolls he makes?

Square $ABCD$ has side length $1$; circle $\Gamma$ is centered at $A$ with radius $1$. Let $M$ be the midpoint of $BC$, and let $N$ be the point on segment $CD$ such that $MN$ is tangent to $\Gamma$. Compute $MN$. [i]2018 CCA Math Bonanza Individual Round #11[/i]

Let $\triangle{ABC}$ be an equilateral triangle. Point $D$ is on segment $\overline{BC}$ such that $BD=1$ and $DC=4.$ Points $E$ and $F$ lie on rays $\overrightarrow{AC}$ and $\overrightarrow{AB},$ respectively, such that $D$ is the midpoint of $\overline{EF}.$ Compute $EF.$

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that \[ f(xy) = yf(x) + x + f(f(y) - f(x)) \] for all $x,y \in \mathbb{R}$.

Let $\omega=\cos\frac{\pi}{5}+\text{i}\sin\frac{\pi}{5}$, which equation has roots $\omega,\omega^3,\omega^7,\omega^9$? $\text{(A)}x^4+x^3+x^2+x+1=0\qquad\text{(B)}x^4-x^3+x^2-x+1=0$ $\text{(C)}x^4-x^3-x^2+x+1=0\qquad\text{(D)}x^4+x^3+x^2-x+1=0$

In a tournament each player played exactly one game against each of the other players. In each game the winner was awarded $1$ point, the loser got $0$ points, and each of the two players earned $\tfrac{1}{2}$ point if the game was a tie. After the completion of the tournament, it was found that exactly half of the points earned by each player were earned in games against the ten players with the least number of points. (In particular, each of the ten lowest scoring players earned half of his points against the other nine of the ten). What was the total number of players in the tournament?

What is the largest positive integer that is not the sum of a positive integral multiple of 42 and a positive composite integer?

A nine-digit number has the form $\overline{6ABCDEFG3}$, where every three consecutive digits sum to $13$. Find $D$. [i]Proposed by Levi Iszler[/i]

For $a,b,c$ positive reals find the minimum value of \[ \frac{a^2+b^2}{c^2+ab}+\frac{b^2+c^2}{a^2+bc}+\frac{c^2+a^2}{b^2+ca}. \]

In concurrent computing, two processes may have their steps interwoven in an unknown order, as long as the steps of each process occur in order. Consider the following two processes: \begin{tabular}{c|cc} Process & $A$ & $B$\\ \hline Step 1 & $x\leftarrow x-4$ & $x\leftarrow x-5$\\ Step 2 & $x\leftarrow x\cdot3$ & $x\leftarrow x\cdot4$\\ Step 3 & $x\leftarrow x-4$ & $x\leftarrow x-5$\\ Step 4 & $x\leftarrow x\cdot3$ & $x\leftarrow x\cdot4$ \end{tabular} One such interweaving is $A1$, $B1$, $A2$, $B2$, $A3$, $B3$, $B4$, $A4$, but $A1$, $A3$, $A2$, $A4$, $B1$, $B2$, $B3$, $B4$ is not since the steps of $A$ do not occur in order. We run $A$ and $B$ concurrently with $x$ initially valued at $6$. Find the minimal possible value of $x$ among all interweavings.

Let $n>1$ be a positive integer. Find the number of binary strings $(a_1, a_2, \ldots, a_n)$, such that the number of indices $1\leq i \leq n-1$ such that $a_i=a_{i+1}=0$ is equal to the number of indices $1 \leq i \leq n-1$, such that $a_i=a_{i+1}=1$.