Find all prime numbers $p$ and $q$ such that $p^q + 5q - 2$ is also a prime number.

If $a + b = 13, b + c = 14, c + a = 15,$ find the value of $c$.

[asy] size(120); real t = 2/sqrt(3); real x = 1 + sqrt(3); pair A = t*dir(90), D = x*A; pair B = t*dir(210), E = x*B; pair C = t*dir(330), F = x*C; draw(D--E--F--cycle); draw(Circle(A, 1)); draw(Circle(B, 1)); draw(Circle(C, 1)); //Credit to MSTang for the diagram[/asy] Each of the three circles in the adjoining figure is externally tangent to the other two, and each side of the triangle is tangent to two of the circles. If each circle has radius three, then the perimeter of the triangle is $\textbf{(A) }36+9\sqrt{2}\qquad\textbf{(B) }36+6\sqrt{3}\qquad\textbf{(C) }36+9\sqrt{3}\qquad\textbf{(D) }18+18\sqrt{3}\qquad \textbf{(E) }45$

Let $n$ be a positive integer and let $\alpha_n $ be the number of $1$'s within binary representation of $n$. Show that for all positive integers $r$, \[2^{2n-\alpha_n}\phantom{-1} \bigg|^{\phantom{0}}_{\phantom{-1}} \sum_{k=-n}^{n} \binom{2n}{n+k} k^{2r}.\]

The function $f(x) = ax + b$ satisfies the following equalities: \begin{align*} f(f(f(1))) &= 2023, \\ f(f(f(0))) &= 1996. \end{align*} Find the value of $a$.

We are given a combination lock consisting of $6$ rotating discs. Each disc consists of digits $0, 1, 2,\ldots , 9$ in that order (after digit $9$ comes $0$). Lock is opened by exactly one combination. A move consists of turning one of the discs one digit in any direction and the lock opens instantly if the current combination is correct. Discs are initially put in the position $000000$, and we know that this combination is not correct. [list] a) What is the least number of moves necessary to ensure that we have found the correct combination? b) What is the least number of moves necessary to ensure that we have found the correct combination, if we know that none of the combinations $000000, 111111, 222222, \ldots , 999999$ is correct?[/list] [i]Proposed by Ognjen Stipetić and Grgur Valentić[/i]

Prove that the distance between the midpoint of side $BC$ of triangle $ABC$ and the midpoint of the arc $ABC$ of its circumscribed circle is not less than $AB / 2$

On the fields of a chesstable of dimensions $ n\times n$, where $ n\geq 4$ is a natural number, are being put coins. We shall consider a [i]diagonal[/i] of table each diagonal formed by at least $ 2$ fields. What is the minimum number of coins put on the table, s.t. on each column, row and diagonal there is at least one coin? Explain your answer.

Let a sequence $(x_n)$ be given and let $y_n = x_{n-1} +2 x_n $ for $n>1.$ Suppose that the sequence $(y_n)$ converges. Prove that the sequence $(x_n)$ converges, too.

Let $ABC$ be a triangle, and let $P$ be a distinct point on the plane. Moreover, let $A'B'C'$ be a homothety of $ABC$ with ratio $2$ and center $P$, and let $O$ and $O'$ be the circumcenters of $ABC$ and $A'B'C'$, respectively. The circumcircles of $AB'C'$, $A'BC'$, and $A'B'C$ meet at points $X$, $Y$, and $Z$, different from $A'$, $B'$, and $C'$. In a similar way, the circumcircles of $A'BC$, $AB'C$, and $ABC'$ meet at $X'$, $Y'$, and $Z'$, different from $A$, $B$, $C$. Let $W$ and $W'$ be the circumcenters of $XYZ$ and $X'Y'Z'$, respectively. Prove that $OW$ is parallel to $O'W'$. [i]Proposed by Mateus Thimóteo, Brazil.[/i]

Chandler the Octopus along with his friends Maisy the Bear and Jeff the Frog are solving LMT problems. It takes Maisy $3$ minutes to solve a problem, Chandler $4$ minutes to solve a problem and Jeff $5$ minutes to solve a problem. They start at $12:00$ pm, and Chandler has a dentist appointment from $12:10$ pm to $12:30$, after which he comes back and continues solving LMT problems. The time it will take for them to finish solving $50$ LMT problems, in hours, is $m/n$ ,where $m$ and $n$ are relatively prime positive integers. Find $m +n$. [b]Note:[/b] they may collaborate on problems. [i]Proposed by Aditya Rao[/i]

Given two vectors $v = (v_1,\dots,v_n)$ and $w = (w_1\dots,w_n)$ in $\mathbb{R}^n$, lets define $v*w$ as the matrix in which the element of row $i$ and column $j$ is $v_iw_j$. Supose that $v$ and $w$ are linearly independent. Find the rank of the matrix $v*w - w*v.$

An integer $n$ is called $k$-special, with $k$ a positive integer, if it's the sum of the squares of $k$ consecutive integers. For example, $13$ is $2$-special, since $13=2^2+3^2$, and $2$ is $3$-special, since $2=(-1)^2+0^2+1^2$. a) Prove that there's no perfect square that is $4$-special. b) Find a perfect square that is $I^2$-special, for some odd positive integer $I$ with $I\ge 3$.

From point $M$ in triangle $ABC$ perpendiculars are dropped to each altitude. It can be shown that each of the line segments of altitudes, measured between the vertex and the foot of the perpendicular drawn to it, are of equal length. Prove that these lengths are each equal to the diameter of the circle inscribed in the triangle.

Call an odd prime $p$ [i]adjective[/i] if there exists an infinite sequence $a_0,a_1,a_2,\ldots$ of positive integers such that \[a_0\equiv1+\frac{1}{a_1}\equiv1+\frac{1}{1+\frac{1}{a_2}}\equiv1+\frac{1}{1+\frac{1}{1+\frac{1}{a_3}}}\equiv\ldots\pmod p.\] What is the sum of the first three odd primes that are [i]not[/i] adjective? Note: For two common fractions $\frac{a}{b}$ and $\frac{c}{d}$, we say that $\frac{a}{b}\equiv\frac{c}{d}\pmod p$ if $p$ divides $ad-bc$ and $p$ does not divide $bd$. [i]2019 CCA Math Bonanza Individual Round #14[/i]

How many three-digit numbers have at least one $2$ and at least one $3$? $\textbf{(A) }52\qquad\textbf{(B) }54\qquad\textbf{(C) }56\qquad\textbf{(D) }58\qquad\textbf{(E) }60$

The diagonals $AC$ and $CE$ of the regular hexagon $ABCDEF$ are divided by inner points $M$ and $N$ respectively, so that \[ {AM\over AC}={CN\over CE}=r. \] Determine $r$ if $B,M$ and $N$ are collinear.

Let $ABC$ a triangle and $C$ it´s circuncircle. Let $D$ a point in arc $AB$ that not contain $A$, diferent of $B$ and $C$ such that $CD$ and $AB$ are not parallel. Let $E$ the intersection of $CD$ and $AB$ and $O$ the circumcircle of triangle $DBE$. Prove that the measure of $\angle OBE$ does not depend of the choice of $D$.

[i][b]a)[/b][/i] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^2+B^2=C^2$. [b][i]b)[/i][/b] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^4+B^4=C^4$. [b]Note[/b]: The notation $A\in \mathrm{SL}_{2}(\mathbb{Z})$ means that $A$ is a $2\times 2$ matrix with integer entries and $\det A=1$.

Let $M$ be a point in the interior of triangle $ABC$. Let $A'$ lie on $BC$ with $MA'$ perpendicular to $BC$. Define $B'$ on $CA$ and $C'$ on $AB$ similarly. Define \[ p(M) = \frac{MA' \cdot MB' \cdot MC'}{MA \cdot MB \cdot MC}. \] Determine, with proof, the location of $M$ such that $p(M)$ is maximal. Let $\mu(ABC)$ denote this maximum value. For which triangles $ABC$ is the value of $\mu(ABC)$ maximal?

Let $ \left( a_i \right)_{1\le i\le n} $ and $ \left( b_i \right)_{1\le i\le n} $ be two sequences, the former being a decreasing sequence and the latter being an increasing sequence. All the terms of $ \left( a_i \right)_{1\le i\le n} $ and $ \left( b_i \right)_{1\le i\le n} $ form the set $ \{1,2,3,\ldots ,2n \} . $ Prove that: $$ \left| a_1-b_1 \right| +\left| a_2-b_2 \right| +\cdots +\left| a_n-b_n \right|=n^2 $$

Katrine has a bag containing 4 buttons with distinct letters M, P, F, G on them (one letter per button). She picks buttons randomly, one at a time, without replacement, until she picks the button with letter G. What is the probability that she has at least three picks and her third pick is the button with letter M?

Let $n\geq 2$ be an integer. For each $k$-tuple of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+\cdots +a_k=n$, consider the sums $S_i=1+2+\ldots +a_i$ for $1\leq i\leq k$. Determine, in terms of $n$, the maximum possible value of the product $S_1S_2\cdots S_k$. [i]Proposed by Misael Pelayo[/i]

If $x^x = 2012^{2012^{2013}}$ , find $x$.

Determine the smallest natural number $n$ such that $n^n$ is not a divisor of the product $1\cdot 2\cdot 3\cdot ... \cdot 2015\cdot 2016$.