Positive integers $a$, $b$ an $n$ satisfy \[ \frac{a}{b}=\frac{a^2+n^2}{b^2+n^2}. \] Prove that $\sqrt{ab}$ is an integer.

Let $(f_i)$ be a sequence of functions defined by: $f_1(x)=x, f_n(x) = \sqrt{f_{n-1}(x)}-\dfrac14$. ($n\in \mathbb{N}, n\ge2$) (a) Prove that $f_n(x) \le f_{n-1}(x)$ for all x where both functions are defined. (b) Find for each $n$ the points of $x$ inside the domain for which $f_n(x)=x$.

If $ a_0,a_1,\dots,a_{50}$ are the coefficients of the polynomial \[ \left(1\plus{}x\plus{}x^2\right)^{25}\] show that $ a_0\plus{}a_2\plus{}a_4\plus{}\cdots\plus{}a_{50}$ is even.

Find the largest $c > 0$ such that for all $n \ge 1$ and $a_1,\dots,a_n, b_1,\dots, b_n > 0$ we have $$\sum_{j=1}^n a_j^4 \ge c\sum_{k = 1}^n \frac{\left(\sum_{j=1}^k a_jb_{k+1-j}\right)^4}{\left(\sum_{j=1}^k b_j^2j!\right)^2}$$ [i]Proposed by Grant Yu[/i]

Prove that there is no function $f:\mathbb{R}_{\ge0}\rightarrow\mathbb{R}$ satisfying: $f(x+y^2)\ge f(x)+y$ for all two nonnegative real numbers $x,y$.

Let $ a_i,b_i$ $ (i\equal{}1,2,...,n)$ be real numbers such that the $ a_i$ are distinct, and suppose that there is a real number $ \alpha$ such that the product $ (a_i\plus{}b_1)(a_i\plus{}b_2)...(a_i\plus{}b_n)$ is equal to $ \alpha$ for each $ i$. Prove that there is a real number $ \beta$ such that $ (a_1\plus{}b_j)(a_2\plus{}b_j)...(a_n\plus{}b_j)$ is equal to $ \beta$ for each $ j$.

In a game, Andi and a computer take turns. At the beginning, the computer shows a polynomial $x^2 + mx + n$ where $m,n \in \mathbb{Z}$, such that it doesn't have real roots. Andi then begins the game. On his turn, Andi may change a polynomial in the form $x^2 + ax + b$ into either $x^2 + (a+b)x + b$ or $x^2 + ax + (a+b)$. However, Andi may only choose a polynomial that has real roots. On the computer's turn, it simply switches the coefficient of $x$ and the constant of the polynomial. Andi loses if he can't continue to play. Find all $(m,n)$ such that Andi always loses (in finitely many turns).

It is known that $1$ and $2$ are roots of a polynomial with integer coefficients. Prove that the polynomial has a coefficient with value less than $-1$ .

$f(x)=\sum\limits_{i=1}^{2013}\left[\dfrac{x}{i!}\right]$. A integer $n$ is called [i]good[/i] if $f(x)=n$ has real root. How many good numbers are in $\{1,3,5,\dotsc,2013\}$?

Prove that for every positive integers $a$ and $b$ there exist positive integers $x$ and $y$ such that $\dfrac{x}{y+a}+\dfrac{y}{x+b}=\dfrac{3}{2}.$

Let $x,y,z>0$ Prove that $$\frac{x^2+2}{\sqrt{z^2+xy}}+\dfrac{y^2+2}{\sqrt{x ^2+yz}}+\dfrac{z^2+2}{\sqrt{y^2+zx}}\geq 6$$. [i](nooonuii)[/i]

Let $ u_1, u_2, \ldots, u_m$ be $ m$ vectors in the plane, each of length $ \leq 1,$ with zero sum. Show that one can arrange $ u_1, u_2, \ldots, u_m$ as a sequence $ v_1, v_2, \ldots, v_m$ such that each partial sum $ v_1, v_1 \plus{} v_2, v_1 \plus{} v_2 \plus{} v_3, \ldots, v_1, v_2, \ldots, v_m$ has length less than or equal to $ \sqrt {5}.$

Let $n\geq 2$ be an integer and $a_1,a_2,\cdots,a_n>1$ be real numbers. Prove that the inequality below holds. $$\prod_{i=1}^n\left(a_ia_{i+1}-\frac{1}{a_ia_{i+1}}\right)\geq 2^n\prod_{i=1}^n\left(a_i-\frac{1}{a_i}\right)$$

[u]Round 1[/u] [b]p1.[/b] Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale. [b]p2.[/b] Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed $10$ of the rounds, each rat eating an equal portion. Some were satisfied, but $7$ greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry? [b]p3.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [b]p4.[/b] There are two lemonade stands along the $4$-mile-long circular road that surrounds Sour Lake. $100$ children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's [u]advantage [/u] is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)? [b]p5.[/b] Merlin uses several spells to move around his $64$-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room $A$ back to room $A$, then from any other room $B$ in the castle, that same sequence brings Merlin back to room $B$. Prove that there are two different rooms $X$ and $Y$ and a sequence of spells that both takes Merlin from $X$ to $Y$ and from $Y$ to $X$. [u]Round 2[/u] [b]p6.[/b] Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the $X$ in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? [img]https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png[/img] [b]p7.[/b] Homer went on a Donut Diet for the month of May ($31$ days). He ate at least one donut every day of the month. However, over any stretch of $7$ consecutive days, he did not eat more than $13$ donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly $30$ donuts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two players alternately replace the stars in the expression \[*x^{2000}+*x^{1999}+...+*x+1 \] by real numbers. The player who makes the last move loses if the resulting polynomial has a real root $t$ with $|t| < 1$, and wins otherwise. Give a winning strategy for one of the players.

Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.

For each natural number $n\ge3$, let $m(n)$ be the maximum number of points inside or on the sides of a regular $n$-agon of side $1$ such that the distance between any two points is greater than $1$. Prove that $m(n)\ge n$ for $n>6$.

Given is the equation: \[x^2+mx+2022=0\] a) Find all the values of the parameter $m$, such that the two solutions of the equation $x_1, x_2$ are $\textbf{natural}$ numbers b)Find all the values of the parameter $m$, such that the two solutions of the equation $x_1, x_2$ are $\textbf{integer}$ numbers

An infinite increasing sequence $a_1 < a_2 < a_3 < \cdots$ of positive integers is called [i]central[/i] if for every positive integer $n$ , the arithmetic mean of the first $a_n$ terms of the sequence is equal to $a_n$. \\Show that there exists an infinite sequence $b_1, b_2, b_3, \dots$ of positive integers such that for every central sequence $a_1, a_2, a_3, \dots, $ there are infinitely many positive integers $n$ with $a_n = b_n$.

Find all triples $(x,y, z)$ of real (but not necessarily positive) numbers satisfying $3(x^2 + y^2 + z^2) = 1$ , $x^2y^2 + y^2z^2 + z^2x^2 = xyz(x + y + z)^3$.

Find all functions $f :\Bbb{ R}\to \Bbb{Z}$ such that $$\left( f(f(y) - x) \right)^2+ f(x)^2 + f(y)^2 = f(y) \cdot \left( 1 + 2f(f(y)) \right),$$ for all $x, y \in \Bbb{R}.$

Determine all polynomials $f$ with integer coefficients such that $f(p)$ is a divisor of $2^p-2$ for every odd prime $p$. [I]Proposed by Italy[/i]

Determine positive integers $n\geq 3$ such that there exists a set $M$ of $n$ complex numbers and a positive integer $m$ such that $(1+z_1z_2z_3)^m=1$ for all pairwise distinct $z_1,z_2,z_3\in M$. [i]Vlad Matei[/i]

What is the sum of the infinite series $\frac{20}{3} +\frac{17}{9} + \frac{20}{27} + \frac{17}{81} + \frac{20}{243} + \frac{17}{729} + ...$ ?

A tortoise challenges a hare to a race. The hare eagerly agrees and quickly runs ahead, leaving the slow-moving tortoise behind. Confident that he will win, the hare stops to take a nap. Meanwhile, the tortoise walks at a slow steady pace for the entire race. The hare awakes and runs to the finish line, only to find the tortoise already there. Which of the following graphs matches the description of the race, showing the distance $d$ traveled by the two animals over time $t$ from start to finish?$\phantom{h}$ [asy] unitsize(0.4 cm); pair transx, transy; int i, j; int x, y; transx = (13,0); transy = (0,-9); for (i = 0; i <= 2; ++i) { for (j = 0; j <= 1; ++j) { if (i <= 1 || j <= 0) { for (x = 1; x <= 10; ++x) { draw(shift(i*transx + j*transy)*((x,0)--(x,5)),gray(0.7) + dashed); } for (y = 1; y <= 5; ++y) { draw(shift(i*transx + j*transy)*((0,y)--(10,y)),gray(0.7) + dashed); } draw(shift(i*transx + j*transy)*((0,0)--(11,0)),Arrow(6)); draw(shift(i*transx + j*transy)*((0,0)--(0,6)),Arrow(6)); label("time", (5,-0.5) + i*transx + j*transy); label(rotate(90)*"distance", (-0.5,2.5) + i*transx + j*transy); } }} draw((0,0)--(1.5,2.5)--(7.5,2.5)--(9,5),linewidth(1.5*bp)); draw((0,0)--(10,5),linewidth(1.5*bp)); draw(shift(transx)*((0,0)--(2.5,2.5)--(7.5,2.5)--(10,5)),linewidth(1.5*bp)); draw(shift(transx)*((0,0)--(9,5)),linewidth(1.5*bp)); draw(shift(2*transx)*((0,0)--(2.5,3)--(7,2)--(10,5)),linewidth(1.5*bp)); draw(shift(2*transx)*((0,0)--(9,5)),linewidth(1.5*bp)); draw(shift(transy)*((0,0)--(2.5,2.5)--(6.5,2.5)--(9,5)),linewidth(1.5*bp)); draw(shift(transy)*((0,0)--(7.5,2)--(10,5)),linewidth(1.5*bp)); draw(shift(transx + transy)*((0,0)--(2.5,2)--(7.5,3)--(10,5)),linewidth(1.5*bp)); draw(shift(transx + transy)*((0,0)--(9,5)),linewidth(1.5*bp)); label("(A)", (-1,6)); label("(B)", (-1,6) + transx); label("(C)", (-1,6) + 2*transx); label("(D)", (-1,6) + transy); label("(E)", (-1,6) + transx + transy); [/asy]