Pablo and Nacho write together a succession of positive integers of $2006$ terms, according to the following rules: Pablo begins, who in his first turn writes $1$, and from then on, each one in his turn writes an integer positive that is greater than or equal to the last number that the opponent wrote and less than or equal to triple the last number that the opponent wrote. When the two of them have written the $2006$ numbers, the sum $S$ of the first $ 2005$ numbers written (all except the last one) and the sum $T$ of the $2006$ numbers written. If $S$ and $T $ are co-cousins, Nacho wins. Otherwise, Pablo wins. Determine which of the two players has a winning strategy, describe the strategy and demonstrate that it is a winning one.

Let $0!!=1!!=1$ and $n!!=n\cdot (n-2)!!$ for all integers $n\geq 2$. Find all positive integers $n$ such that \[\dfrac{(2^n+1)!!-1}{2^{n+1}}\] is an integer.

Prove that, $$15x^2-7y^2=9$$ equation has any solutions in integers.

Let $a,b,c$ and $m$ ($0 \le m \le 26$) be integers such that $a + b + c = (a - b)(b- c)(c - a) = m$ (mod $27$) then $m$ is (A): $0$, (B): $1$, (C): $25$, (D): $26$ (E): None of the above.

Find all triples $(a, b, c)$ of positive integers such that $a^3 + b^3 + c^3 = (abc)^2$.

Determine whether there exists a positive integer $n$ such that it is possible to find at least $2018$ different quadruples $(x,y,z,t)$ of positive integers that simultaneously satisfy equations $$\begin{cases} x+y+z=n\\ xyz = 2t^3. \end{cases}$$

[b](a)[/b] Does there exist a positive integer $n$ such that the decimal representation of $n!$ ends with the string $2004$, followed by a number of digits from the set $\left\{0;\;4\right\}$ ? [b](b)[/b] Does there exist a positive integer $n$ such that the decimal representation of $n!$ starts with the string $2004$ ?

Find all pairs $(x,y)$ of integers such that $y^3-1=x^4+x^2$.

Call a positive integer [i]lonely [/i] if the sum of reciprocals of its divisors (including $1$ and the integer itself) is not equal to the sum of reciprocals of divisors of any other positive integer. Prove that a) all primes are lonely, b) there exist infinitely many non-lonely positive integers.

Is it possible for the least common multiple of five consecutive positive integers to be a perfect square?

For how many ordered pairs of positive integers $ (x,y)$ is $ x \plus{} 2y \equal{} 100$? $ \textbf{(A)}\ 33 \qquad \textbf{(B)}\ 49 \qquad \textbf{(C)}\ 50 \qquad \textbf{(D)}\ 99 \qquad \textbf{(E)}\ 100$

Let be given a set $\{r_1,r_2,...,r_k\}$ of natural numbers that give distinct remainders when divided by a natural number $m$. Prove that if $k > m/2$, then for every integer $n$ there exist indices $i$ and $j$ (not necessarily distinct) such that $r_i +r_j -n$ is divisible by $m$.

Suppose we choose two numbers $x,y\in[0,1]$ uniformly at random. If the probability that the circle with center $(x,y)$ and radius $|x-y|$ lies entirely within the unit square $[0,1]\times [0,1]$ is written as $\tfrac{p}{q}$ with $p$ and $q$ relatively prime nonnegative integers, then what is $p^2+q^2$?

Let $f$ be a function $f: \mathbb{N} \cup \{0\} \mapsto \mathbb{N},$ and satisfies the following conditions: (1) $f(0) = 0, f(1) = 1,$ (2) $f(n+2) = 23 \cdot f(n+1) + f(n), n = 0,1, \ldots.$ Prove that for any $m \in \mathbb{N}$, there exist a $d \in \mathbb{N}$ such that $m | f(f(n)) \Leftrightarrow d | n.$

Let $A$ be a set of positive integers such that a) if $a\in A$, the all the positive divisors of $a$ are also in $A$; b) if $a,b\in A$, with $1<a<b$, then $1+ab \in A$. Prove that if $A$ has at least 3 elements, then $A$ is the set of all positive integers.

Let $n > 1$ be an integer and let $a_1, a_2, \ldots, a_n$ be integers such that $n \mid a_i-i$ for all integers $1 \leq i \leq n$. Prove there exists an infinite sequence $b_1,b_2, \ldots$ such that [list] [*] $b_k\in\{a_1,a_2,\ldots, a_n\}$ for all positive integers $k$, and [*] $\sum\limits_{k=1}^{\infty}\frac{b_k}{n^k}$ is an integer. [/list]

$x$ and $y$ are integer $5$-digits numbers, such that in the decimal notation, all ten digits are used exactly once. Also $\tan{x}-\tan{y}=1+\tan{x}\tan{y}$, where $x,y$ are angles in degrees. Find maximum of $x$

A positive integer $m$ is called self-descriptive in base $b$, where $b\ge2$ is an integer, if i) The representation of $m$ in base $b$ is of the form $(a_0a_1\ldots a_{b-1})_b$ (that is $m=a_0b^{b-1}+a_1b^{b-2}+\ldots+a_{b-2}b+a_{b-1}$, where $0\le a_i\le b-1$ are integers). ii) $a_i$ is equal to the number of occurences of the number $i$ in the sequence $(a_0a_1\ldots a_{b-1})$. For example, $(1210)_4$ is self-descriptive in base $4$, because it has four digits and contains one $0$, two $1$s, one $2$ and no $3$s.

Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\] [i]Proposed by Angelo Di Pasquale, Australia[/i]

Prove that for any natural $n \geq 2$, the number $ \underbrace{2^{2^{\cdots^2}}}_{n \textrm{ times}}- \underbrace{2^{2^{\cdots^2}}}_{n-1 \textrm{ times}}$ is divisible by $n$. I know, that it is a very old problem :blush: but it is a problem from olympiad.

Determine whether it is possible to place the integers $1, 2,...,2012$ in a circle in such a way that the $2012$ products of adjacent pairs of numbers leave pairwise distinct remainders when divided by $2013$.

Find all positive integers which have exactly 16 positive divisors $1 = d_1 < d_2 < \ldots < d_{16} =n$ such that the divisor $d_k$, where $k = d_5$, equals $(d_2 + d_4) d_6$.

Let $p=4k+3$ be a prime number. Find the number of different residues mod p of $(x^{2}+y^{2})^{2}$ where $(x,p)=(y,p)=1.$

Jorge chooses $6$ different positive integers and writes one on each face of a cube. He threw his bucket three times. The first time his cube showed the number $5$ facing up and also the sum of the numbers on the faces sides was $20$. The second time his cube showed the number $7$ facing up and also the sum of the numbers on the faces sides was $17$. The third time his cube showed the number $4$ up, plus all the numbers on the side faces. They turned out to be primes. What are the numbers that Jorge chose and how did he distribute them on the faces of the cube? Analyze all odds. Remember that $1$ is not prime.

Find all pairs of nonnegative integers $ (x, y)$ satisfying $ (14y)^x \plus{} y^{x\plus{}y} \equal{} 2007$.