Consider fractions $\frac{a}{b}$ where $a$ and $b$ are positive integers. (a) Prove that for every positive integer $n$, there exists such a fraction $\frac{a}{b}$ such that $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}+1$. (b) Show that there are infinitely many positive integers $n$ such that no such fraction $\frac{a}{b}$ satisfies $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}$.

Let $1<t<2$ be a real number. Prove that for all sufficiently large positive integers like $d$, there is a monic polynomial $P(x)$ of degree $d$, such that all of its coefficients are either $+1$ or $-1$ and $$\left|P(t)-2019\right| <1.$$ [i]Proposed by Navid Safaei[/i]

The quadratic trinomials $ f $, $ g $ and $ h $ are such that for every real $ x $ the numbers $ f (x) $, $ g (x) $ and $ h (x) $ are the lengths of the sides of some triangles, and the numbers $ f (x) -1 $, $ g (x) -1 $ and $ h (x) -1 $ are not the lengths of the sides of the triangle. Prove that at least of the polynomials $ f + g-h $, $ f + h-g $, $ g + h-f $ is constant.

Show that every natural number $n\leq2^{1\;000\;000}$ can be obtained first with 1 doing less than $1\;100\;000$ sums; more precisely, there is a finite sequence of natural numbers $x_0,\ x_1,\dots,\ x_k\mbox{ with }k\leq1\;100\;000,\ x_0=1,\ x_k=n$ such that for all $i=1,\ 2,\dots,\ k$ there exist $r,\ s$ with $0\leq{r}\leq{s}<i$ such that $x_i=x_r+x_s$.

Let $a,b$ and $c$ be positive reals such that $abc=\frac{1}{8}$.Then prove that \[a^2+b^2+c^2+a^2b^2+a^2c^2+b^2c^2\ge\frac{15}{16}\]

It is given the expression $y=\frac{x^2-2x+1}{x^2-2x+2}$, where $x$ is a variable. Prove that: (a) if $x_1$ and $x_2$ are two values of $x$, the $y_1$ and $y_2$ are the respective values of $y$ only if $x_1<x_2$, $y_1<y_2$; (b) when $x$ is varying $y$ attains all possible values for which $0\le y<1$.

Does there exist a polynomial $p(x)$ with integer coefficients for which $$p(\sqrt{2})=\sqrt{2}$$ $$p(2\sqrt{2})=2\sqrt{2}+2$$

Given real numbers $x,y,z$ such that $x+y+z=0$, show that \[\dfrac{x(x+2)}{2x^2+1}+\dfrac{y(y+2)}{2y^2+1}+\dfrac{z(z+2)}{2z^2+1}\ge 0\] When does equality hold?

Prove that there is no polynomial $P \in \mathbb C[x]$ such that set $\left \{ P(z) \; | \; \left | z \right | =1 \right \}$ in complex plane forms a polygon. In other words, a complex polynomial can't map the unit circle to a polygon. (30 points)

[u]Round 1 [/u] [b]p1.[/b] Pirate Jim had $8$ boxes with gun powder weighing $1, 2, 3, 4, 5, 6, 7$, and $8$ pounds (the weight is printed on top of every box). Pirate Bob hid a $1$-pound gold bar in one of these boxes. Pirate Jim has a balance scale that he can use, but he cannot open any of the boxes. Help him find the box with the gold bar using two weighings on the balance scale. [b]p2.[/b] James Bond will spend one day at Dr. Evil's mansion to try to determine the answers to two questions: a) Is Dr. Evil at home? b) Does Dr. Evil have an army of ninjas? The parlor in Dr. Evil's mansion has three windows. At noon, Mr. Bond will sneak into the parlor and use open or closed windows to signal his answers. When he enters the parlor, some windows may already be opened, and Mr. Bond will only have time to open or close one window (or leave them all as they are). Help Mr. Bond and Moneypenny design a code that will tell Moneypenny the answers to both questions when she drives by later that night and looks at the windows. Note that Moneypenny will not have any way to know which window Mr. Bond opened or closed. [b]p3.[/b] Suppose that you have a triangle in which all three side lengths and all three heights are integers. Prove that if these six lengths are all different, there cannot be four prime numbers among them. p4. Fred and George have designed the Amazing Maze, a $5\times 5$ grid of rooms, with Adorable Doors in each wall between rooms. If you pass through a door in one direction, you gain a gold coin. If you pass through the same door in the opposite direction, you lose a gold coin. The brothers designed the maze so that if you ever come back to the room in which you started, you will find that your money has not changed. Ron entered the northwest corner of the maze with no money. After walking through the maze for a while, he had $8$ shiny gold coins in his pocket, at which point he magically teleported himself out of the maze. Knowing this, can you determine whether you will gain or lose a coin when you leave the central room through the north door? [b]p5.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? [u]Round 2 [/u] [b]p6.[/b] $1000$ non-zero numbers are written around a circle and every other number is underlined. It happens that each underlined number is equal to the sum of its two neighbors and that each non-underlined number is equal to the product of its two neighbors. What could the sum of all the numbers written on the circle be? [b]p7.[/b] A grasshopper is sitting at the edge of a circle of radius $3$ inches. He can hop exactly $4$ inches in any direction, as long as he stays within the circle. Which points inside the circle can the grasshopper reach if he can make as many jumps as he likes? [img]https://cdn.artofproblemsolving.com/attachments/1/d/39b34b2b4afe607c1232f4ce9dec040a34b0c8.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find every real-valued function $f$ whose domain is an interval $I$ (finite or infinite) having $0$ as a left-hand endpoint, such that for every positive $x\in I$ the average of $f$ over the closed interval $[0,x]$ is equal to $\sqrt{ f(0) f(x)}.$

Find all integer coefficient polynomials $Q$ such that [list] [*] $Q(n)\ge 1$ $\forall n\in \mathbb{Z}_+$. [*] $Q(mn)$ and $Q(m)Q(n)$ have the same number of prime divisors $\forall m,n\in\mathbb{Z}_+$. [/list]

We are given a finite number of functions of the form $y = c2^{-|x-d|}$. In each case $c$ and $d$ are parameters with $c > 0$. The function $f(x)$ is defined on the interval $[a, b]$ as follows: For each $x$ in $[a, b]$, $f(x)$ is the maximum value taken by any of the given functions $y$ (defined above) at that point $x$. It is known that $f(a) = f(b)$. Prove that the total length of the intervals in which the function $f$ is increasing is equal to the total length of the intervals in which it is decreasing (that is, both are equal to $(b- a)/2$ ). (NB Vasiliev)

Let $N = \{1, 2, \ldots, n\}$, $n \geq 3$. To each pair $i \neq j $ of elements of $N$ there is assigned a number $f_{ij} \in \{0, 1\}$ such that $f_{ij} + f_{ji} = 1$. Let $r(i)=\sum_{i \neq j} f_{ij}$, and write $M = \max_{i\in N} r(i)$, $m = \min_{i\in N} r(i)$. Prove that for any $w \in N$ with $r(w) = m$ there exist $u, v \in N$ such that $r(u) = M$ and $f_{uv}f_{vw} = 1$.

A function $f$ is called injective if when $f(n) = f(m)$, then $n = m$. Suppose that $f$ is injective and $\frac{1}{f(n)}+\frac{1}{f(m)}=\frac{4}{f(n) + f(m)}$. Prove $m = n$

Peter and Vasil together thought of ten 5-degree polynomials. Then, Vasil began calling consecutive natural numbers starting with some natural number. After each called number, Peter chose one of the ten polynomials at random and plugged in the called number. The results were recorded on the board. They eventually form a sequence. After they finished, their sequence was arithmetic. What is the greatest number of numbers that Vasil could have called out? [i]A. Golovanov[/i]

For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.

Karina has a polynomial $p_1(x) = x^2 + x + k$, where $k$ is an integer. Noticing that $p_1$ has integer roots, she forms a new polynomial $p_2(x) = x^2 + a_1x + b_1$, where $a_1$ and $b_1$ are the roots of $p_1$ and $a_1 \ge b_1$. The polynomial $p_2$ also has integer roots, so she forms a new polynomial $p_3(x) = x^2 + a_2x + b_2$, where $a_2$ and $b_2$ are the roots of $p_2$ and $a_2 \ge b_2$. She continues this process until she reaches $p_7(x)$ and finds that it does not have integer roots. What is the largest possible value of $k$?

Let $\alpha$ be a real number. Determine all polynomials $P$ with real coefficients such that $$P(2x+\alpha)\leq (x^{20}+x^{19})P(x)$$ holds for all real numbers $x$. [i]Proposed by Walther Janous, Austria[/i]

Let $a,b,c$ be distinct positive real numbers such that $\frac{1}{1+a}+\frac{1}{1+b}+\frac{1}{1+c}\leq 1$. Prove that $$2\left(\sqrt{\frac{a+b}{ac}}+\sqrt{\frac{b+c}{ba}}+\sqrt{\frac{c+a}{cb}}\right)<\frac{a^3}{(a-b)(a-c)}+\frac{b^3}{(b-c)(b-a)}+\frac{c^3}{(c-a)(c-b)}.$$

Let $A$ be the set of natural numbers $n$ such that the distance of the real number $n\sqrt{2022} - \frac13$ from the nearest integer is at most $\frac1{2022}$. Show that the equation $$20x + 21y = 22z$$ has no solutions over the set $A$.

Let be a function $ s:\mathbb{N}^2\longrightarrow \mathbb{N} $ that sends $ (m,n) $ to the number of solutions in $ \mathbb{N}^n $ of the equation: $$ x_1+x_2+\cdots +x_n=m $$ [b]1)[/b] Prove that: $$ s(m+1,n+1)=s(m,n)+s(m,n+1) =\prod_{r=1}^n\frac{m-r+1}{r} ,\quad\forall m,n\in\mathbb{N} $$ [b]2)[/b] Find $ \max\left\{ a_1a_2\cdots a_{20}\bigg| a_1+a_2+\cdots +a_{20}=2007, a_1,a_2,\ldots a_{20}\in\mathbb{N} \right\} . $

Let $\mathbb{F}_{p}$ denote the $p$-element field for a prime $p>3$ and let $S$ be the set of functions from $\mathbb{F}_{p}$ to $\mathbb{F}_{p}$. Find all functions $D\colon S\to S$ satisfying \[D(f\circ g)=(D(f)\circ g)\cdot D(g)\] for all $f,g \in {S}$. Here, $\circ$ denotes the function composition, so $(f\circ g)(x)$ is the function $f(g(x))$, and $\cdot$ denotes multiplication, so $(f\cdot g)=f(x)g(x)$.

Let be nine nonzero decimal digits $ a_1,a_2,a_3,b_1,b_2,b_3,c_1,c_2,c_3 $ chosen such that the polynom $$ \left( 100a_1+10a_2+a_3 \right) X^2 +\left( 100b_1+10b_2+b_3 \right) X +100c_1+10c_2+c_3 $$ admits at least a real solution. Prove that at least one of the polynoms $ a_iX^2+b_iX+c_i\quad (i\in\{1,2,3\}) $ admits at least a real solution. [i]Nicolae Mușuroia[/i]

Evaluate the sum $\sqrt{1-\frac{1}{2}\cdot\sqrt{1\cdot3}}+\sqrt{2-\frac{1}{2}\cdot\sqrt{3\cdot5}}+\sqrt{3-\frac{1}{2}\cdot\sqrt{5\cdot7}}+\dots+\sqrt{40-\frac{1}{2}\cdot\sqrt{79\cdot81}}$.