Determine all functions $f$ from the reals to the reals for which (1) $f(x)$ is strictly increasing and (2) $f(x) + g(x) = 2x$ for all real $x$, where $g(x)$ is the composition inverse function to $f(x)$. (Note: $f$ and $g$ are said to be composition inverses if $f(g(x)) = x$ and $g(f(x)) = x$ for all real $x$.)

Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there exists some $i \in \mathbb{N}$ with $a_i = m^2$. [i]Proposed by Nikola Velov, North Macedonia[/i]

The integer sequence $(s_i)$ "having pattern 2016'" is defined as follows: $\circ$ The first member $s_1$ is 2. $\circ$ The second member $s_2$ is the least positive integer exceeding $s_1$ and having digit 0 in its decimal notation. $\circ$ The third member $s_3$ is the least positive integer exceeding $s_2$ and having digit 1 in its decimal notation. $\circ$ The third member $s_3$ is the least positive integer exceeding $s_2$ and having digit 6 in its decimal notation. The following members are defined in the same way. The required digits change periodically: $2 \rightarrow 0 \rightarrow 1 \rightarrow 6 \rightarrow 2 \rightarrow 0 \rightarrow \ldots$. The first members of this sequence are the following: $2; 10; 11; 16; 20; 30; 31; 36; 42; 50$.\\ Does this sequence contain a) 2001, b) 2006?

A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible?

There are $2^{10}=1024$ possible 10-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than 3 adjacent letters that are identical.

A sequence of numbers is defined recursively by $a_1 = 1$, $a_2 = \frac{3}{7}$, and $$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$for all $n \geq 3$ Then $a_{2019}$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive inegers. What is $p+q ?$ $\textbf{(A) } 2020 \qquad\textbf{(B) } 4039 \qquad\textbf{(C) } 6057 \qquad\textbf{(D) } 6061 \qquad\textbf{(E) } 8078$

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

The rows $x_n$ and $y_n$ of positive real numbers are such that: $x_{n+1}=x_n+\frac{1}{2y_n}$ and $y_{n+1}=y_n+\frac{1}{2x_n}$ for each positive integer $n$. Prove that at least one of the numbers $x_{2018}$ and $y_{2018}$ is bigger than 44,9

The sequence $a_0,a_1,a_2,\dots$ is recursively defined by \[ a_0 = 1 \quad \text{and} \quad a_n = a_{n-1} \cdot \left(4-\frac{2}{n} \right) \quad \text{for } n \geq 1. \] Prove for each integer $n \geq 1$: (a) The number $a_n$ is a positive integer. (b) Each prime $p$ with $n < p \leq 2n$ is a divisor of $a_n$. (c) If $n$ is a prime, then $a_n-2$ is divisible by $n$.

Let $n$ and $t$ be positive integers. What is the number of ways to place $t$ dominoes $(1\times 2$ or $2\times 1$ rectangles) in a $2\times n$ table so that there is no $2\times 2$ square formed by $2$ dominoes and each $2\times 3$ rectangle either does not have a horizontal domino in the middle and last cell in the first row or does not have a horizontal domino in the first and middle cell in the second row (or both)?

A sequence of numbers is defined recursively by $a_1 = 1$, $a_2 = \frac{3}{7}$, and $$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$for all $n \geq 3$ Then $a_{2019}$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive inegers. What is $p+q ?$ $\textbf{(A) } 2020 \qquad\textbf{(B) } 4039 \qquad\textbf{(C) } 6057 \qquad\textbf{(D) } 6061 \qquad\textbf{(E) } 8078$

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

For a given positive integer $n$, you may perform a series of steps. At each step, you may apply an operation: you may increase your number by one, or if your number is divisible by 2, you may divide your number by 2. Let $\ell(n)$ be the minimum number of operations needed to transform the number $n$ to 1 (for example, $\ell(1) = 0$ and $\ell(7) = 4$). How many positive integers $n$ are there such that $\ell(n) \leq 12$?

An ant is at vertex of a cube. Every $10$ minutes it moves to an adjacent vertex along an edge. If $N$ is the number of one hour journeys that end at the starting vertex, find the sum of the squares of the digits of $N$.

Let $f(n)$ be the number of ways to write $n$ as a sum of powers of $2$, where we keep track of the order of the summation. For example, $f(4)=6$ because $4$ can be written as $4$, $2+2$, $2+1+1$, $1+2+1$, $1+1+2$, and $1+1+1+1$. Find the smallest $n$ greater than $2013$ for which $f(n)$ is odd.