Positive real numbers $a_1>a_2>\ldots>a_n$ with sum $s$ are such that the equation $nx^2-sx+1=0$ has a positive root $a_{n+1}$ smaller than $a_n$. Prove that there exists a positive integer $r \leq n$ such that the inequality $a_ra_{r+1} \geq \frac{1}{r}$ holds. [i]M. Zorka[/i]

Find all positive integers $k$ and $\ell$ such that $k^2 -\ell^2 = 1005$.

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$

A graph $G=(V,E)$ is given. If at least $n$ colors are required to paints its vertices so that between any two same colored vertices no edge is connected, then call this graph ''$n-$colored''. Prove that for any $n \in \mathbb{N}$, there is a $n-$colored graph without triangles.

The sequence of digits \[ 1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 \dots \] is obtained by writing the positive integers in order. If the $10^n$-th digit in this sequence occurs in the part of the sequence in which the $m$-digit numbers are placed, define $f(n)$ to be $m$. For example, $f(2)=2$ because the 100th digit enters the sequence in the placement of the two-digit integer 55. Find, with proof, $f(1987)$.

Let $m$ be the answer to this question. What is the value of $2m - 5$?

Mariana plays with an $8\times 8$ board with all its squares blank. She says that two houses are [i]neighbors [/i] if they have a common side or vertex, that is, two houses can be neighbors vertically, horizontally or diagonally. The game consists of filling the $64$ squares on the board, one after the other, each with a number according to the following rule: she always chooses a house blank and fill it with an integer equal to the number of neighboring houses that are still in White. Once this is done, the house is no longer considered blank. Show that the value of the sum of all $64$ numbers written on the board at the end of the game does not depend in the order of filling. Also, calculate the value of this sum. Note: A house is not neighbor to itself. [hide=original wording]Mariana brinca com um tabuleiro 8 x 8 com todas as suas casas em branco. Ela diz que duas casas s˜ao vizinhas se elas possu´ırem um lado ou um v´ertice em comum, ou seja, duas casas podem ser vizinhas verticalmente, horizontalmente ou diagonalmente. A brincadeira consiste em preencher as 64 casas do tabuleiro, uma ap´os a outra, cada uma com um n´umero de acordo com a seguinte regra: ela escolhe sempre uma casa em branco e a preenche com o n´umero inteiro igual `a quantidade de casas vizinhas desta que ainda estejam em branco. Feito isso, a casa n˜ao ´e mais considerada em branco. Demonstre que o valor da soma de todos os 64 n´umeros escritos no tabuleiro ao final da brincadeira n˜ao depende da ordem do preenchimento. Al´em disso, calcule o valor dessa soma. Observa¸c˜ao: Uma casa n˜ao ´e vizinha a si mesma[/hide]

Determine all the functions $ f: \mathbb{N}\rightarrow \mathbb{N}$ such that \[ f(n)\plus{}f(n\plus{}1)\plus{}f(f(n))\equal{}3n\plus{}1, \quad \forall n\in \mathbb{N}.\]

The [i]equatorial algebra[/i] is defined as the real numbers equipped with the three binary operations $\natural$, $\sharp$, $\flat$ such that for all $x, y\in \mathbb{R}$, we have \[x\mathbin\natural y = x + y,\quad x\mathbin\sharp y = \max\{x, y\},\quad x\mathbin\flat y = \min\{x, y\}.\] An [i]equatorial expression[/i] over three real variables $x$, $y$, $z$, along with the [i]complexity[/i] of such expression, is defined recursively by the following: [list] [*] $x$, $y$, and $z$ are equatorial expressions of complexity 0; [*] when $P$ and $Q$ are equatorial expressions with complexity $p$ and $q$ respectively, all of $P\mathbin\natural Q$, $P\mathbin\sharp Q$, $P\mathbin\flat Q$ are equatorial expressions with complexity $1+p+q$. [/list] Compute the number of distinct functions $f: \mathbb{R}^3\rightarrow \mathbb{R}$ that can be expressed as equatorial expressions of complexity at most 3. [i]Proposed by Yannick Yao[/i]

An equilateral triangle $ A_1 A_2 A_3$ is divided into four smaller equilateral triangles by joining the midpoints $ A_4,A_5,A_6$ of its sides. Let $ A_7,...,A_{15}$ be the midpoints of the sides of these smaller triangles. The $ 15$ points $ A_1,...,A_{15}$ are colored either green or blue. Show that with any such colouring there are always three mutually equidistant points $ A_i,A_j,A_k$ having the same color.

[asy]pair A=(-2,0), O=origin, C=(2,0); path X=Arc(O,2,0,180), Y=Arc((-1,0),1,180,0), Z=Arc((1,0),1,180,0), N=X..Y..Z..cycle; filldraw(N, black, black); draw(reflect(A,C)*N); draw(A--C, dashed); label("A",A,W); label("C",C,E); label("O",O,SE); dot((-1,0)); dot(O); dot((1,0)); label("1",(-1,0),NE); label("1",(1,0),NW);[/asy] The large circle has diameter $ \overline{AC}$. The two small circles have their centers on $ \overline{AC}$ and just touch at $ O$, the center of the large circle. If each small circle has radius $ 1$, what is the value of the ratio of the area of the shaded region to the area of one of the small circles? \[ \textbf{(A)}\ \text{between }\frac{1}{2} \text{ and }1 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ \text{between 1 and }\frac{3}{2} \qquad \textbf{(D)}\ \text{between }\frac{3}{2} \text{ and }2 \\ \textbf{(E)}\ \text{cannot be determined from the information given} \]

A bee is moving in three-dimensional space. A fair six-sided die with faces labeled $A^+, A^-, B^+, B^-, C^+$, and $C^-$ is rolled. Suppose the bee occupies the point $(a, b, c)$. If the die shows $A^+$, then the bee moves to the point $(a+1, b, c)$ and if the die shows $A^-$, then the bee moves to the point $(a-1, b, c)$. Analogous moves are made with the other four outcomes. Suppose the bee starts at the point $(0, 0, 0)$ and the die is rolled four times. What is the probability that the bee traverses four distinct edges of some unit cube? $ \textbf{(A) }\frac{1}{54} \qquad \textbf{(B) }\frac{7}{54} \qquad \textbf{(C) }\frac{1}{6} \qquad \textbf{(D) }\frac{5}{18} \qquad \textbf{(E) }\frac{2}{5} \qquad $

What fraction of the large $12$ by $18$ rectangular region is shaded? [asy] draw((0,0)--(18,0)--(18,12)--(0,12)--cycle); draw((0,6)--(18,6)); for(int a=6; a<12; ++a) { draw((1.5a,0)--(1.5a,6)); } fill((15,0)--(18,0)--(18,6)--(15,6)--cycle,black); label("0",(0,0),W); label("9",(9,0),S); label("18",(18,0),S); label("6",(0,6),W); label("12",(0,12),W); [/asy] $\text{(A)}\ \frac{1}{108} \qquad \text{(B)}\ \frac{1}{18} \qquad \text{(C)}\ \frac{1}{12} \qquad \text{(D)}\ \frac29 \qquad \text{(E)}\ \frac13$

Let $ a$, $ b$, $ c$ be positive reals such that $ a^4 \plus{} b^4 \plus{} c^4 \equal{} 3$. Prove that $ \sum\frac1{4 \minus{} ab}\leq1$, where the $ \sum$ sign stands for cyclic summation. [i]Alternative formulation:[/i] For any positive reals $ a$, $ b$, $ c$ satisfying $ a^4 \plus{} b^4 \plus{} c^4 \equal{} 3$, prove the inequality $ \frac{1}{4\minus{}bc}\plus{}\frac{1}{4\minus{}ca}\plus{}\frac{1}{4\minus{}ab}\leq 1$.

Determine all triples of positive integers $(x, y, z)$ that satisfy $$x < y < z, \ \ gcd(x, y) = 6, \ \ gcd(y, z) = 10, \ \ gcd(z, x) = 8 \ \ and \ \ lcm(x, y, z) = 2400.$$

There are $k$ heaps on the table, each containing a different positive number of stones. Juri and Mari make moves alternatingly, Juri starts. On each move, the player making the move has to pick a heap and remove one or more stones in it from the table; in addition, the player is allowed to distribute any number of remaining stones from that heap in any way between other non-empty heaps. The player to remove the last stone from the table wins. For which positive integers $k$ does Juri have a winning strategy for any initial state that satisfies the conditions?