We say that a table with three rows or infinite columns is [i]cool [/i] if it was filled with natural numbers, and also whenever the same number m appears in two or more different places in the table, the numbers that appear in the cells immediately below said places (when they exist) are equal. For example, the following table is cool: [img]https://cdn.artofproblemsolving.com/attachments/5/7/16583a6a9434fd2792a4df48a733226cf2f560.png[/img] For each of the following two tables, decide whether it is possible to fill in the empty cells before the resulting tables are cool, explaining how to do this, or why it is not possible to do this. In both tables from the fifth column, the number in the third line is two units greater than the number in the first line. [img]https://cdn.artofproblemsolving.com/attachments/8/a/56d2f05ea09555c39da88f09eb5901a57567f0.png[/img]

In the convex hexagon $ABCDEF$, the angles at the vertices $B$, $C$, $E$, and $F$ are equal. Moreover, the equality \[AB+DE=AF+CD\] holds. Prove that the line $AD$ and the bisectors of the segments $BC$ and $EF$ have a common point.

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that any real numbers $x{}$ and $y{}$ satisfy \[f(xf(x)+f(y))=f(f(x^2))+y.\]

Let $ABCD$ be a parallelogram. Let $M$ be the midpoint of the arc $AC$ containing $B$ of the circumcircle of $ABC$ . Let $E$ be a point on segment $AD$ and $F$ a point on segment $CD$ such that $ME=MD=MF$. Show that $BMEF$ is cyclic. [i]Proposed by A. Tereshin[/i]

(a) Prove that for every natural number $k$, there are positive integers $a_1<a_2<\ldots <a_k$ such that $a_i-a_j$ divides $a_i$ for all $1\leq i, j\leq k, i\neq j$. (b) Show that there is an absolute constant $C>0$ such that $a_1>k^{Ck}$ for every sequence $a_1,\ldots, a_k$ of numbers that satisfy the above divisibility condition. [A. Balogh, I. Z. Ruzsa]

Let $p$ and $q$ be different prime numbers. Solve the following system in integers: \[\frac{z+ p}x+\frac{z-p}y= q,\\ \frac{z+ p}y -\frac{z-p}x= q.\]

The points $E$ and $D$ lie in the interior of sides $AC$ and $BC$, respectively, of a triangle $ABC$. Let $F$ be the intersection of the lines $AD$ and $BE$.Show that the area of the traingles $ABC$ and $ABF$ satisfies: $ \frac{S_{ABC}}{S_{ABF}} = \frac{\mid{AC}\mid}{\mid{AE} \mid} + \frac{\mid{BC}\mid}{\mid{BD}\mid} - 1$.

Numbers $ a,b,c$ are such that the equation $ x^3 \plus{} ax^2 \plus{} bx \plus{} c$ has three real roots.Prove that if $ \minus{} 2\leq a \plus{} b \plus{} c\leq 0$,then at least one of these roots belongs to the segment $ [0,2]$

The diagonals of a convex quadrilateral divide it into four similar triangles. Prove that is possible to inscribe a circle into this quadrilateral

Is there a real interval $ I $ for which there exists a primitivable function $ f:I\longrightarrow I $ with the property that $ (f\circ f) (x)=-x, $ for all $ x\in I $ ?

Let $a, b, c$ be positive real numbers such that $abc=8$. Prove that \[ \frac{a^2}{\sqrt{(1+a^3)(1+b^3)}} +\frac{b^2}{\sqrt{(1+b^3)(1+c^3)}} +\frac{c^2}{\sqrt{(1+c^3)(1+a^3)}} \geq \frac{4}{3} \]

How many divisors of $12!$ are perfect squares? [i]2015 CCA Math Bonanza Lightning Round #4.1[/i]

Buffalo Shuffle-o is a card game in which all the cards are distributed evenly among all players at the start of the game. When Annika and $3$ of her friends play Buffalo Shuffle-o, each player is dealt $15$ cards. Suppose $2$ more friends join the next game. How many cards will be dealt to each player? $\textbf{(A) } 8\qquad\textbf{(B) } 9\qquad\textbf{(C) } 10\qquad\textbf{(D) } 11\qquad\textbf{(E) } 12$ ngl easily silliable

Let $a,b,n$ positive integers with $a>b$ and $ab-1=n^2$. Prove that $a-b \geq \sqrt{4n-3}$ and study the cases where the equality holds.

A circle centered at $O$ and inscribed in triangle $ABC$ meets sides $AC$;$AB$;$BC$ at $K$;$M$;$N$, respectively. The median $BB_1$ of the triangle meets $MN$ at $D$. Show that $O$;$D$;$K$ are collinear. [i]M. Sonkin[/i]

Determine the value of the expression $x^2 + y^2 + z^2$, if $x + y + z = 13$ , $xyz= 72$ and $\frac1x + \frac1y + \frac1z = \frac34$.

Find all the natural numbers equal to the square of its divisors number.

define $(a_n)_{n \in \mathbb{N}}$ such that $a_1=2$ and $$a_{n+1}=\left(1+\frac{1}{n}\right)^n \times a_{n}$$ Prove that there exists infinite number of $n$ such that $\frac{a_1a_2 \ldots a_n}{n+1}$ is a square of an integer.

Let $a,b,c$ be positive reals satisfying $a+b+c = \sqrt[7]{a} + \sqrt[7]{b} + \sqrt[7]{c}$. Prove that $a^a b^b c^c \ge 1$. [i]Proposed by Evan Chen[/i]

Let $n>1$ be an integer. A rook stands in one of the cells of an infinite chessboard that is initially all white. Each move of the rook is exactly $n{}$ cells in a single direction, either vertically or horizontally, and causes the $n{}$ cells passed over by the rook to be painted black. After several such moves, without visiting any cell twice, the rook returns to its starting cell, with the resulting black cells forming a closed path. Prove that the number of white cells inside the black path gives a remainder of $1{}$ when divided by $n{}$.

The set $M= \{1;2;3;\ldots ; 29;30\}$ is divided in $k$ subsets such that if $a+b=n^2, (a,b \in M, a\neq b, n$ is an integer number $)$, then $a$ and $b$ belong different subsets. Determine the minimum value of $k$.

Find the number of self-maps of a set of $ 5 $ elements having the property that the preimage of any element of this set has $ 2 $ elements at most. [i]Adrian Zanoschi[/i]

Find all integers $x$ between 0 and the prime number 4099 such that $x^3 - 3$ is divisible by 4099.

Alice and Bob play a game on a numbered row of $n \ge 5$ squares. At the beginning a pebble is put on the first square and then the players make consecutive moves; Alice starts. During a move a player is allowed to choose one of the following: [list] [*] move the pebble one square forward; [*] move the pebble four squares forward; [*] move the pebble two squares backwards. [/list] All of the possible moves are only allowed if the pebble stays within the borders of the square row. The player who moves the pebble to the last square (a.k.a $n\text{-th}$) wins. Determine for which values of $n$ each of the players has a winning strategy.

Two players in turn put two or three coins into their own hats (before the game starts, the hats are empty). Each time, after both players made five moves, they exchange hats.The player wins, if after his move his hat contains one hundred or more coins. Which player has a winning strategy?