A sequence $a_1, a_2, a_3, \ldots $ is defined as follows: $a_1$ is a positive integer and $$a_{n+1} = \left\lfloor \frac{3}{2} a_n \right\rfloor +1$$ for all $n \in \mathbb{N}$. Can $a_1$ be chosen in such a way that the first $100000$ terms of the sequence are even, but the $100001$-th term is odd?

Let $\mathbb N$ be the set of positive integers. Find all functions $f\colon\mathbb N\to \mathbb N$ such that for every $m,n\in \mathbb N$, \[ f(m)+f(n)\mid m+n. \]

Let $a, b, c$ and $d$ are positive real numbers so that $abcd = \frac14$. Prove that holds $$\left( 16ac +\frac{a}{c^2b}+\frac{16c}{a^2d}+\frac{4}{ac}\right)\left( bd +\frac{b}{256d^2c}+\frac{d}{b^2a}+\frac{1}{64bd}\right) \ge \frac{81}{4}$$ When does the equality hold?

Let $a,$ $b,$ $c,$ $d$ be four positive reals such that $d=a+b+c+2\sqrt{ab+bc+ca}.$ Prove that $a=b+c+d-2\sqrt{bc+cd+db}.$ Darij Grinberg

Let $a,b,c$ be three positive real numbers such that $abc=1$. Show that: \[ \displaystyle \frac{a}{(a+1)(b+1)}+\frac{b}{(b+1)(c+1)}+ \frac{c}{(c+1)(a+1)} \geq \frac{3}{4}. \] When is there equality?

Determine the sum of all distinct real values of $x$ such that $||| \cdots ||x|+x| \cdots |+x|+x|=1$ where there are $2017$ $x$s in the equation.

Say that a positive integer is [i]sweet[/i] if it uses only the digits 0, 1, 2, 4, and 8. For instance, 2014 is sweet. There are sweet integers whose squares are sweet: some examples (not necessarily the smallest) are 1, 2, 11, 12, 20, 100, 202, and 210. There are sweet integers whose cubes are sweet: some examples (not necessarily the smallest) are 1, 2, 10, 20, 200, 202, 281, and 2424. Prove that there exists a sweet positive integer $n$ whose square and cube are both sweet, such that the sum of all the digits of $n$ is 2014.

For certain real numbers $a$, $b$, and $c$, the polynomial \[g(x) = x^3 + ax^2 + x + 10\] has three distinct roots, and each root of $g(x)$ is also a root of the polynomial \[f(x) = x^4 + x^3 + bx^2 + 100x + c.\] What is $f(1)$? $\textbf{(A)}\ -9009 \qquad\textbf{(B)}\ -8008 \qquad\textbf{(C)}\ -7007 \qquad\textbf{(D)}\ -6006 \qquad\textbf{(E)}\ -5005$

[u]Round 1[/u] [b]p1.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p2.[/b] A positive number is placed on each of the $10$ circles in this picture. It turns out that for each of the nine little equilateral triangles, the number on one of its corners is the sum of the numbers on the other two corners. Is it possible that all $10$ numbers are different? [img]https://cdn.artofproblemsolving.com/attachments/b/f/c501362211d1c2a577e718d2b1ed1f1eb77af1.png[/img] [b]p3.[/b] Pablo and Nina take turns entering integers into the cells of a $3 \times 3$ table. Pablo goes first. The person who fills the last empty cell in a row must make the numbers in that row add to $0$. Can Nina ensure at least two of the columns have a negative sum, no matter what Pablo does? [b]p4. [/b]All possible simplified fractions greater than $0$ and less than $1$ with denominators less than or equal to $100$ are written in a row with a space before each number (including the first). Zeke and Qing play a game, taking turns choosing a blank space and writing a “$+$” or “$-$” sign in it. Zeke goes first. After all the spaces have been filled, Zeke wins if the value of the resulting expression is an integer. Can Zeke win no matter what Qing does? [img]https://cdn.artofproblemsolving.com/attachments/3/6/15484835686fbc2aa092e8afc6f11cd1d1fb88.png[/img] [b]p5.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/0/c/d827cf26c8eaabfd5b0deb92612a6e6ebffb47.png[/img] [u]Round 2[/u] [b]p6.[/b] Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$. [b]p7.[/b] Given a list of three numbers, a zap consists of picking two of the numbers and decreasing each of them by their average. For example, if the list is $(5, 7, 10)$ and you zap $5$ and $10$, whose average is $7.5$, the new list is $(-2.5, 7, 2.5)$. Is it possible to start with the list $(3, 1, 4)$ and, through some sequence of zaps, end with a list in which the sum of the three numbers is $0$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that the product of four consecutive integers plus $1$ is a perfect square.

Let $f(x)=a(3a+2c)x^2-2b(2a+c)x+b^2+(c+a)^2$ $(a,b,c\in R, a(3a+2c)\neq 0).$ If $$f(x)\leq 1$$for any real $x$, find the maximum of $|ab|.$

Find all ordered pairs of integers $(a,b)$ such that there exists a function $f\colon \mathbb{N} \to \mathbb{N}$ satisfying $$f^{f(n)}(n)=an+b$$ For all $n\in \mathbb{N}$.

Compute the smallest positive integer $n$ such that $\int_{0}^{n} \lfloor x\rfloor\,dx$ is at least $2021.$

$a_1 \le a_2 \le ... \le a_n$ is a sequence of reals $b_1, _b2, b_3,..., b_n$ is any rearrangement of the sequence $B_1 \le B_2 \le ...\le B_n$. Show that $\sum a_ib_i \le \sum a_i B_i$.

Let $x,y\in\mathbb{R}$ be such that $x = y(3-y)^2$ and $y = x(3-x)^2$. Find all possible values of $x+y$.

There's a special computer and it has a memory. At first, it's memory just contains $x$. We fill up the memory with the following rules. 1) If $f\neq 0$ is in the memory, then we can also put $\frac{1}{f}$ in it. 2) If $f,g$ are in the memory, then we can also put $ f+g$ and $f-g$ in it. Find all natural number $n$ such that we can have $x^n$ in the memory.

Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions: (i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$; (ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$. Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list] [i]Proposed by Hans Zantema, Netherlands[/i]

[b]Problem 6.[/b] Let $p>2$ be prime. Find the number of the subsets $B$ of the set $A=\{1,2,\ldots,p-1\}$ such that, the sum of the elements of $B$ is divisible by $p.$ [i] Ivan Landgev[/i]

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Let $x_0, x_1, . . . , x_{2014}$ be a sequence of real numbers, which for all $i < j$ satisfy $x_i + x_j \le 2j$. Determine the largest possible value of the sum $x_0 + x_1 + · · · + x_{2014}$.

Determine all functions $f: \mathbb N\to \mathbb N$ such that for every positive integer $n$ we have: \[ 2n+2001\leq f(f(n))+f(n)\leq 2n+2002. \]

Six numbers are placed on a circle. For every number $A$ we have: $A$ equals the absolute value of $(B- C)$, where $B$ and $C$ follow $A$ clockwise. The total sum of the numbers equals $1$. Find all the numbers. (Folklore)

Let $n$ be a positive integer. Solve the system of equations \begin{align*}x_{1}+2x_{2}+\cdots+nx_{n}&= \frac{n(n+1)}{2}\\ x_{1}+x_{2}^{2}+\cdots+x_{n}^{n}&= n\end{align*} for $n$-tuples $(x_{1},x_{2},\ldots,x_{n})$ of nonnegative real numbers.

Let $a$, $b$, and $c$ be positive real numbers. Prove that $$(a^5 - a^2 +3)(b^5 - b^2 +3)(c^5 - c^2 +3)\ge (a+b+c)^3$$

Let $a, b, c \in R,$ $a \ne 0$, such that $a$ and $4a+3b+2c$ have the same sign. Show that the equation $ax^2+bx+c=0$ cannot have both roots in the interval $(1,2)$.