How many $10$-digit positive integers containing only the numbers $1,2,3$ can be written such that the first and the last digits are same, and no two consecutive digits are same? $ \textbf{(A)}\ 768 \qquad\textbf{(B)}\ 642 \qquad\textbf{(C)}\ 564 \qquad\textbf{(D)}\ 510 \qquad\textbf{(E)}\ 456 $

Mrs. Sanders has three grandchildren, who call her regularly. One calls her every three days, one calls her every four days, and one calls her every five days. All three called her on December 31, 2016. On how many days during the next year did she not receive a phone call from any of her grandchildren? $\textbf{(A) }78\qquad\textbf{(B) }80\qquad\textbf{(C) }144\qquad\textbf{(D) }146\qquad\textbf{(E) }152$

If you are given $ \log 8 \approx .9031$ and $ \log 9 \approx .9542$, then the only logarithm that cannot be found without the use of tables is: $ \textbf{(A)}\ \log 17 \qquad\textbf{(B)}\ \log \frac {5}{4} \qquad\textbf{(C)}\ \log 15 \qquad\textbf{(D)}\ \log 600 \qquad\textbf{(E)}\ \log .4$

Compute the number of positive integers $n$ between $2017$ and $2017^2$ such that $n^n \equiv 1$ (mod $2017$). ($2017$ is prime.)

A line is drawn through the $A$ vertex of triangle $ABC$ with $|AB|\ne|AC|$. Prove that the line can not contain more than one point $M$ such, that $M$ is not a triangle vertex, and $\angle ABM = \angle ACM$. What lines do not contain such a point $M$ at all?

Let $ A,B,S $ be three $ 3\times 3 $ complex matrices with $ B=S^{-1}AS , $ and $ S $ nonsingular. Show: $$ \text{tr} \left( B^2\right) +2\text{tr}(C(B)) = \left(\text{tr} (A)\right)^2 , $$ where $ C(B) $ is the cofactor of $ B. $ [i]Mihai Haivas[/i]

$A_0B, A_0C$ rays that satisfy $\angle BA_0C=14^{\circ}$. You are to place points $A_1, A_2, ...$ by the following rules. [b]Rules[/b] (1) On the first move, place $A_1$ on any point on $A_0B$(except $A_0$). (2) On the $n>1$th move, place $A_n$ on $A_0B$ iff $A_{n-1}$ is on $A_0C$, and place $A_n$ on $A_0C$ iff $A_{n-1}$ is one $A_0B$. $A_n$ must be place on the point that satisfies $A_{n-2}A_n{n-1}=A_{n-1}A_n$. All the points must be placed in different locations. What is the maximum number of points that can be placed?

In an acute triangle $ABC$ the bisector of $\angle BAC$ crosses $BC$ at $D$. Points $P$ and $Q$ are orthogonal projections of $D$ on lines $AB$ and $AC$. Prove that $[APQ]=[BCQP]$ if and only if the circumcenter of $ABC$ lies on $PQ$.

Consider an equilateral triangle $\triangle ABC$. The points $K$ and $L$ divide the leg $BC$ into three equal parts, the point $M$ divides the leg $AC$ in the ratio $1:2$, counting from the vertex $A$. Prove that $\angle AKM+\angle ALM=30^{\circ}$. Proposed by V. Proizvolov

In some of the $ 1\times1 $ squares of a square garden $ 50\times50 $ we've grown apple, pomegranate and peach trees (At most one tree in each square). We call a $ 1\times1 $ square a [i]room[/i] and call two rooms [i]neighbor[/i] if they have one common side. We know that a pomegranate tree has at least one apple neighbor room and a peach tree has at least one apple neighbor room and one pomegranate neighbor room. We also know that an empty room (a room in which there’s no trees) has at least one apple neighbor room and one pomegranate neighbor room and one peach neighbor room. Prove that the number of empty rooms is not greater than $ 1000. $

If $3 = k \cdot 2^r$ and $15 = k \cdot 4^r$, then $r =$ $\text{(A)}\ - \log_2 5 \qquad \text{(B)}\ \log_5 2 \qquad \text{(C)}\ \log_{10} 5 \qquad \text{(D)}\ \log_2 5 \qquad \text{(E)}\ \displaystyle \frac{5}{2}$

In line for a SuperRockPop concert were 2005 people. With the aim of offering $3$ tickets for the "backstage", the first person in line was asked to shout "Super", ` the second "Rock", ` the third "Pop", ` the fourth "Super", ` the fifth "Rock", ` the sixth "Pop" and so on. Anyone who said "Rock" or "Pop" was eliminated. This process was repeated, always starting from the first person in the new line, until only $3$ people remained. What positions were these people in at the beginning?

Find all triplets of positive integers $(x, y, z)$ such that $2^x+1=7^y+2^z$.

Solve the equation $ \sqrt{4 \minus{} 3\sqrt{10 \minus{} 3x}} \equal{} x \minus{} 2$.

A deck of $ n$ playing cards, which contains three aces, is shuffled at random (it is assumed that all possible card distributions are equally likely). The cards are then turned up one by one from the top until the second ace appears. Prove that the expected (average) number of cards to be turned up is $ (n\plus{}1)/2$.

If $a$ and $b$ are positive numbers, prove the inequality $$a^2 +ab+b^2\ge 3(a+b-1).$$

Show that for $n > 1$ we can find a polynomial $P(a, b, c)$ with integer coefficients such that $$P(x^{n},x^{n+1},x+x^{n+2})=x.$$

The sides of the triangle $ABC$ satisfy the relation $c^2 = a^2 + b^2$. Show that angle $C$ is right.

Find the locus of the center of a rectangle, whose four vertices lies on the sides of a given triangle.

Jeff rotates spinners $ P$, $ Q$ and $ R$ and adds the resulting numbers. What is the probability that his sum is an odd number? [asy]size(200); path circle=circle((0,0),2); path r=(0,0)--(0,2); draw(circle,linewidth(1)); draw(shift(5,0)*circle,linewidth(1)); draw(shift(10,0)*circle,linewidth(1)); draw(r,linewidth(1)); draw(rotate(120)*r,linewidth(1)); draw(rotate(240)*r,linewidth(1)); draw(shift(5,0)*r,linewidth(1)); draw(shift(5,0)*rotate(90)*r,linewidth(1)); draw(shift(5,0)*rotate(180)*r,linewidth(1)); draw(shift(5,0)*rotate(270)*r,linewidth(1)); draw(shift(10,0)*r,linewidth(1)); draw(shift(10,0)*rotate(60)*r,linewidth(1)); draw(shift(10,0)*rotate(120)*r,linewidth(1)); draw(shift(10,0)*rotate(180)*r,linewidth(1)); draw(shift(10,0)*rotate(240)*r,linewidth(1)); draw(shift(10,0)*rotate(300)*r,linewidth(1)); label("$P$", (-2,2)); label("$Q$", shift(5,0)*(-2,2)); label("$R$", shift(10,0)*(-2,2)); label("$1$", (-1,sqrt(2)/2)); label("$2$", (1,sqrt(2)/2)); label("$3$", (0,-1)); label("$2$", shift(5,0)*(-sqrt(2)/2,sqrt(2)/2)); label("$4$", shift(5,0)*(sqrt(2)/2,sqrt(2)/2)); label("$6$", shift(5,0)*(sqrt(2)/2,-sqrt(2)/2)); label("$8$", shift(5,0)*(-sqrt(2)/2,-sqrt(2)/2)); label("$1$", shift(10,0)*(-0.5,1)); label("$3$", shift(10,0)*(0.5,1)); label("$5$", shift(10,0)*(1,0)); label("$7$", shift(10,0)*(0.5,-1)); label("$9$", shift(10,0)*(-0.5,-1)); label("$11$", shift(10,0)*(-1,0));[/asy] $ \textbf{(A)}\ \dfrac{1}{4} \qquad \textbf{(B)}\ \dfrac{1}{3} \qquad \textbf{(C)}\ \dfrac{1}{2} \qquad \textbf{(D)}\ \dfrac{2}{3} \qquad \textbf{(E)}\ \dfrac{3}{4}$

It is given a plane with a coordinate system with a beginning at the point $O$. $A(n)$, when $n$ is a natural number is a count of the points with whole coordinates which distances to $O$ are less than or equal to $n$. (a) Find $$\ell=\lim_{n\to\infty}\frac{A(n)}{n^2}.$$ (b) For which $\beta$ $(1<\beta<2)$ does the following limit exist? $$\lim_{n\to\infty}\frac{A(n)-\pi n^2}{n^\beta}$$

$P\left(x\right)$ is a polynomial of degree at most $6$ such that such that $P\left(1\right)$, $P\left(2\right)$, $P\left(3\right)$, $P\left(4\right)$, $P\left(5\right)$, $P\left(6\right)$, and $P\left(7\right)$ are $1$, $2$, $3$, $4$, $5$, $6$, and $7$ in some order. What is the maximum possible value of $P\left(8\right)$? [i]2018 CCA Math Bonanza Individual Round #13[/i]

Given a fixed positive integer $a\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying: (1)$\tau (n)=a$ (2)$n|\phi (n)+\sigma (n)$ Note: For positive integer $n$, $\tau (n)$ is the number of positive divisors of $n$, $\phi (n)$ is the number of positive integers $\leq n$ and relatively prime with $n$, $\sigma (n)$ is the sum of positive divisors of $n$.

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

All diagonals of a convex pentagon are drawn, dividing it in one smaller pentagon and $10$ triangles. Find the maximum number of triangles with the same area that may exist in the division.