Baron Munchausen took several cards and wrote a positive integer on each one (some numbers may be the same). The baron reports that he has used only two distinct digits to do that. He also reports that among the leftmost digits of the sums of integers on each pair of these cards there are all the digits from 1 to 9 . Can it occur that the baron is right? Maxim Didin

The ship [i]Meridiano do Bacalhau[/i] does its fishing business during $64$ days. Each day the capitain chooses a direction which may be either north or south and the ship sails that direction in that day. On the first day of business the ship sails $1$ mile, on the second day sails $2$ miles; generally, on the $n$-th day it sails $n$ miles. After of the $64$-th day, the ship was $2014$ miles north from its initial position. What is the greatest number of days that the ship could have sailed south?

An equilateral triangle $T$ with side $111$ is partitioned into small equilateral triangles with side $1$ using lines parallel to the sides of $T$. Every obtained point except the center of $T$ is marked. A set of marked points is called $\textit{linear}$ if the points lie on a line, parallel to a side of $T$ (among the drawn ones). In how many ways we can split the marked point into $111$ $\textit{linear}$ sets?

Define $S_r(n)$: digit sum of $n$ in base $r$. For example, $38=(1102)_3,S_3(38)=1+1+0+2=4$. Prove: [b](a)[/b] For any $r>2$, there exists prime $p$, for any positive intenger $n$, $S_{r}(n)\equiv n\mod p$. [b](b)[/b] For any $r>1$ and prime $p$, there exists infinitely many $n$, $S_{r}(n)\equiv n\mod p$.

Each point of the plane is coloured in one of two colours. Given an odd integer number $n \geq 3$, prove that there exist (at least) two similar triangles whose similitude ratio is $n$, each of which has a monochromatic vertex-set. [i]Vasile Pop[/i]

Find the real root of $x^5+5x^3+5x-1$. Hint: Let $x = u+k/u$.

Prove that every tetrahedron has a vertex whose three edges have the right lengths to form a triangle.

Dirock has a very neat rectangular backyard that can be represented as a $32\times 32$ grid of unit squares. The rows and columns are each numbered $1,2,\ldots, 32$. Dirock is very fond of rocks, and places a rock in every grid square whose row and column number are both divisible by $3$. Dirock would like to build a rectangular fence with vertices at the centers of grid squares and sides parallel to the sides of the yard such that [list] [*] The fence does not pass through any grid squares containing rocks; [*] The interior of the fence contains exactly 5 rocks. [/list] In how many ways can this be done? [i]Ray Li[/i]

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y\in \mathbb{R}$: $$f\left(f(x)^2-y^2\right)^2+f(2xy)^2=f\left(x^2+y^2\right)^2$$ [i]Proposed by Ali Behrouz - Mojtaba Zare Bidaki[/i]

Let $n$ be a positive integer. A regular hexagon with side length $n$ is divided into equilateral triangles with side length $1$ by lines parallel to its sides. Find the number of regular hexagons all of whose vertices are among the vertices of those equilateral triangles. [i]UK - Sahl Khan[/i]

Hexagon $ABCDEF$ is inscribed in a circle $O$. Let $BD \cap CF = G, AC \cap BE = H, AD \cap CE = I$ Following conditions are satisfied. $BD \perp CF , CI=AI$ Prove that $CH=AH+DE$ is equivalent to $GH \times BD = BC \times DE$

Let $\triangle ABC$ be an acute-angled triangle with $AB>AC$, $O$ be its circumcenter and $D$ the midpoint of side $BC$. The circle with diameter $AD$ meets sides $AB,AC$ again at points $E,F$ respectively. The line passing through $D$ parallel to $AO$ meets $EF$ at $M$. Show that $EM=MF$.

The convex quadrilateral $ABCD$ is given, $AB<BC$ and $AD<CD$. $P,Q$ are points on $BC$ and $CD$ respectively such that $PB=AB$ and $QD=AD$. $M$ is midpoint of $PQ$. We assume that $\angle BMD=90^{\circ}$, prove that $ABCD$ is cyclic.

An ant crawls along the edges of a cube turning only at its vertices. It has visited one of the vertices $25$ times. Is it possible that it has visited each of the other $7$ vertices exactly $20$ times? (S Tokarev)

Find $ a,b,c \in N$ such that $ ab$ divides $ a^2\plus{}b^2\plus{}1$.

Given a finite sequence with terms in the set $A=\{0,1,…,121\}$ , it is allowed to replace each term by a number from the set $A$ so that like terms are replaced by like numbers, and different terms by different numbers. (Terms may remain without replacement.) The objective is to obtain, from a given sequence, through several such changes, a new sequence with sum divisible by $121$ . Show that it is possible to achieve the objective for every initial sequence. [hide=original wording]Dada una secuencia finita con términos en el conjunto A={0,1,…,121} , está permitido reemplazar cada término por un número del conjunto A de modo que términos iguales se reemplacen por números iguales, y términos distintos por números distintos. (Pueden quedar términos sin reemplazar.) El objetivo es obtener, a partir de una sucesión dada, mediante varios de tales cambios, una nueva sucesión con suma divisible por 121 . Demostrar que es posible lograr el objetivo para toda sucesión inicial.[/hide]

Triangle $ABC$ is equilateral with side length $12$. Point $D$ is the midpoint of side $\overline{BC}$. Circles $A$ and $D$ intersect at the midpoints of side $AB$ and $AC$. Point $E$ lies on segment $\overline{AD}$ and circle $E$ is tangent to circles $A$ and $D$. Compute the radius of circle $E$. [i]2015 CCA Math Bonanza Individual Round #5[/i]

There are 4 countries: Argentina, Brazil, Peru and Uruguay. Each country consists of 4 islands. There are bridges going back and forth between some of the 16 islands. Carlos noted that whenever he travels between some of the islands using the bridges, without using the same bridge twice, and ending in the island where he started his journey, he will necessarily visit at least one island of each country. Determine the maximum number of bridges there can be.

Let $ k$ be a positive integer, let $ m\equal{}2^k\plus{}1$, and let $ r\neq 1$ be a complex root of $ z^m\minus{}1\equal{}0$. Prove that there exist polynomials $ P(z)$ and $ Q(z)$ with integer coefficients such that $ (P(r))^2\plus{}(Q(r))^2\equal{}\minus{}1$.

Kevin has $255$ cookies, each labeled with a unique nonempty subset of $\{1,2,3,4,5,6,7,8\}$. Each day, he chooses one cookie uniformly at random out of the cookies not yet eaten. Then, he eats that cookie, and all remaining cookies that are labeled with a subset of that cookie (for example, if he chooses the cookie labeled with $\{1,2\}$, he eats that cookie as well as the cookies with $\{1\}$ and $\{2\}$). The expected value of the number of days that Kevin eats a cookie before all cookies are gone can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [i]Proposed by Ray Li[/i]

A particle $(x,y)$ moves so that its angular velocities about $(1,0)$ and $(-1,0)$ are equal in magnitude but opposite in sign. Prove that $$y(x^2 +y^2 +1)\; dx= x(x^2 +y^2 -1) \;dy,$$ and verify that this is the differential equation of the family of rectangular hyperbolas passing through $(1,0)$ and $(-1,0)$ and having the origin as center.

Consider all the tetrahedrons $AXBY$, circumscribed around the sphere. Let $A$ and $B$ points be fixed. Prove that the sum of angles in the non-plane quadrangle $AXBY$ doesn't depend on points $X$ and $Y$ .

Determine the increasing geometric progressions, with three integer terms, such that the sum of these terms is $57$

Petya, Vasya and Tolya play a game on a $100\times 100$ board. They take turns (starting from Petya, then Vasya, then Tolya, then Petya, etc.) paint the boundary cells of the board (i.e., having a common side with the boundary of the board.) It is forbidden to paint the cell that is adjacent to the already painted one. In addition, it’s also forbidden to paint the cell which is symmetrical to the painted one, with respect to the center of the board. The player who can’t make the move loss. Can Vasya and Tolya, after agreeing, play so that Petya loses?

Compute \[ \frac{(10^4+324)(22^4+324)(34^4+324)(46^4+324)(58^4+324)}{(4^4+324)(16^4+324)(28^4+324)(40^4+324)(52^4+324)}. \]