Let $ a_1$, $ a_2$, $ a_3$, $ a_4$, $ a_5$ be real numbers satisfying the following equations: $ \frac{a_1}{k^2\plus{}1}\plus{}\frac{a_2}{k^2\plus{}2}\plus{}\frac{a_3}{k^2\plus{}3}\plus{}\frac{a_4}{k^2\plus{}4}\plus{}\frac{a_5}{k^2\plus{}5} \equal{} \frac{1}{k^2}$ for $ k \equal{} 1, 2, 3, 4, 5$ Find the value of $ \frac{a_1}{37}\plus{}\frac{a_2}{38}\plus{}\frac{a_3}{39}\plus{}\frac{a_4}{40}\plus{}\frac{a_5}{41}$ (Express the value in a single fraction.)

Given two finite collections of pairs of real numbers It turned out that for any three pairs $(a_1, b_1)$, $(a_2, b_2)$ and $(a_3, b_3)$ from the first collection there is a pair $(c, d)$ from the second collection, such that the following three inequalities hold: \[ a_1c + b_1d \geq 0,a_2c + b_2c \geq 0 \text{ and } a_3c + b_3d \geq 0 \] Prove that there is a pair $(\gamma, \delta)$ in the second collection, such that for any pair $(\alpha, \beta)$ from the first collection inequality $\alpha \gamma + \beta \delta \geq 0$ holds.

Let $a_0,a_1,a_2,\ldots $ be a sequence of positive real numbers satisfying $i\cdot a_2\ge (i + 1)\cdot a_{i_1}a_{i+1}$ for $i=1, 2, \ldots $ Furthermore, let $x$ and $y$ be positive reals, and let $b_i=xa_i+ya_{i-1}$ for $i=1, 2, \ldots $ Prove that the inequality $i\cdot b_2\ge (i + 1)\cdot b_{i-1}b_{i+1}$ holds for all integers $i\ge 2$.

Determine all functions $f:\Bbb{R}\to\Bbb{R}$ such that \[ f^2(x+y)=f^2(x)+2f(xy)+f^2(y), \] for all $x,y\in \Bbb{R}.$

[b]p9.[/b] The frozen yogurt machine outputs yogurt at a rate of $5$ froyo$^3$/second. If the bowl is described by $z = x^2+y^2$ and has height $5$ froyos, how long does it take to fill the bowl with frozen yogurt? [b]p10.[/b] Prankster Pete and Good Neighbor George visit a street of $2021$ houses (each with individual mailboxes) on alternate nights, such that Prankster Pete visits on night $1$ and Good Neighbor George visits on night $2$, and so on. On each night $n$ that Prankster Pete visits, he drops a packet of glitter in the mailbox of every $n^{th}$ house. On each night $m$ that Good Neighbor George visits, he checks the mailbox of every $m^{th}$ house, and if there is a packet of glitter there, he takes it home and uses it to complete his art project. After the $2021^{th}$ night, Prankster Pete becomes enraged that none of the houses have yet checked their mail. He then picks three mailboxes at random and takes out a single packet of glitter to dump on George’s head, but notices that all of the mailboxes he visited had an odd number of glitter packets before he took one. In how many ways could he have picked these three glitter packets? Assume that each of these three was from a different house, and that he can only visit houses in increasing numerical order. [b]p11. [/b]The taxi-cab length of a line segment with endpoints $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1- y_2|$. Given a series of straight line segments connected head-to-tail, the taxi-cab length of this path is the sum of the taxi-cab lengths of its line segments. A goat is on a rope of taxi-cab length $\frac72$ tied to the origin, and it can’t enter the house, which is the three unit squares enclosed by $(-2, 0)$,$(0, 0)$,$(0, -2)$,$(-1, -2)$,$(-1, -1)$,$(-2, -1)$. What is the area of the region the goat can reach? (Note: the rope can’t ”curve smoothly”-it must bend into several straight line segments.) [b]p12.[/b] Parabola $P$, $y = ax^2 + c$ has $a > 0$ and $c < 0$. Circle $C$, which is centered at the origin and lies tangent to $P$ at $P$’s vertex, intersects $P$ at only the vertex. What is the maximum value of a, possibly in terms of $c$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two real sequence $ \{x_{n}\}$ and $ \{y_{n}\}$ satisfies following recurrence formula; $ x_{0}\equal{} 1$, $ y_{0}\equal{} 2007$ $ x_{n\plus{}1}\equal{} x_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(y_{n}\plus{}y_{n\plus{}1})$, $ y_{n\plus{}1}\equal{} y_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(x_{n}\plus{}x_{n\plus{}1})$ Then show that for all nonnegative integer $ n$, $ {x_{n}}^{2}\leq 2007$.

Consider the sequence of numbers $(a_n)$ ($n = 1, 2, \ldots$) defined as follows: $ a_1\in (1, 2)$, $ a_{k + 1} = a_k + \frac{k}{a_k}$ ($k = 1, 2, \ldots$). Prove that there exists at most one pair of distinct positive integers $(i, j)$ such that $a_i + a_j$ is an integer.

Let $\{x_n\}$ be a sequence of natural numbers such that \[(a) 1 = x_1 < x_2 < x_3 < \ldots; \quad (b) x_{2n+1} \leq 2n \quad \forall n.\] Prove that, for every natural number $k$, there exist terms $x_r$ and $x_s$ such that $x_r - x_s = k.$

A function $f$ defined on integers such that $f (n) =n + 3$ if $n$ is odd $f (n) = \frac{n}{2}$ if $n$ is even If $k$ is an odd integer, determine the values for which $f (f (f (k))) = k$.

(a)Given any natural number N, prove that there exists a strictly increasing sequence of N positive integers in harmonic progression. (b)Prove that there cannot exist a strictly increasing infinite sequence of positive integers which is in harmonic progression.

Given $n\in\mathbb N_+,n\ge 3,a_1,a_2,\cdots ,a_n\in\mathbb R_+.$ Let $b_1,b_2,\cdots ,b_n\in\mathbb R_+$ satisfy that for $\forall k\in\{1,2,\cdots ,n\},$ $$\sum_{\substack{i,j\in\{1,2,\cdots ,n\}\backslash \{k\}\\i\neq j}}a_ib_j=0.$$ Prove that $b_1=b_2=\cdots =b_n=0.$

Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.

[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two. (b) Can you arrange these numbers so it works both clockwise and counterclockwise. [b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$. [b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ z_{1},z_{2},z_{3}$ be three complex numbers of moduli less than or equal to $ 1$. $ w_{1},w_{2}$ are two roots of the equation $ (z \minus{} z_{1})(z \minus{} z_{2}) \plus{} (z \minus{} z_{2})(z \minus{} z_{3}) \plus{} (z \minus{} z_{3})(z \minus{} z_{1}) \equal{} 0$. Prove that, for $ j \equal{} 1,2,3$, $\min\{|z_{j} \minus{} w_{1}|,|z_{j} \minus{} w_{2}|\}\leq 1$ holds.

$10$ numbers are placed on a circle. Their sum is equal to $100$. A sum of any three neighbouring numbers is no less than $29$. Find the minimal number $A$ such that for any such set of 10 numbers none of them is greater than $A$. Prove that this value for $A$ is really minimal. (A. Tolpygo, Kiev)

Determine which of the following numbers is greater $$10^{10^{10^{10}}}, (10^{10})!$$

Let $a, b, c$ be reals such that some two of them have difference greater than $\frac{1}{2 \sqrt{2}}$. Prove that there exists an integer $x$, such that $$x^2-4(a+b+c)x+12(ab+bc+ca)<0.$$

Find a polynomial $Q(x)$ such that $(2x^2 - 6x + 5)Q(x)$ is a polynomial with all positive coefficients.

Let $(x,y,z)$ be an ordered triplet of real numbers that satisfies the following system of equations: \begin{align*}x+y^2+z^4&=0,\\y+z^2+x^4&=0,\\z+x^2+y^4&=0.\end{align*} If $m$ is the minimum possible value of $\lfloor x^3+y^3+z^3\rfloor$, find the modulo $2007$ residue of $m$.

Let $a,b,c$ be non-zero real numbers.Prove that if function $f,g:\mathbb{R}\to\mathbb{R}$ satisfy $af(x+y)+bf(x-y)=cf(x)+g(y)$ for all real number $x,y$ that $y>2018$ then there exists a function $h:\mathbb{R}\to\mathbb{R}$ such that $f(x+y)+f(x-y)=2f(x)+h(y)$ for all real number $x,y$.

[u]Round 1[/u] [b]p1.[/b] How many distinct ways are there to scramble the letters in $EXETER$? [b]p2.[/b] Given that $\frac{x - y}{x - z}= 3$, find $\frac{x - z}{y - z}$. [b]p3.[/b] When written in base $10$, $9^9 =\overline{ABC420DEF}.$ Find the remainder when $A + B + C + D + E + F$ is divided by $9$. [u]Round 2[/u] [b]p4.[/b] How many positive integers, when expressed in base $7$, have exactly $3$ digits, but don't contain the digit $3$? [b]p5.[/b] Pentagon $JAMES$ is such that its internal angles satisfy $\angle J = \angle A = \angle M = 90^o$ and $\angle E = \angle S$. If $JA = AM = 4$ and $ME = 2$, what is the area of $JAMES$? [b]p6.[/b] Let $x$ be a real number such that $x = \frac{1+\sqrt{x}}{2}$ . What is the sum of all possible values of $x$? [u]Round 3[/u] [b]p7.[/b] Farmer James sends his favorite chickens, Hen Hao and PEAcock, to compete at the Fermi Estimation All Star Tournament (FEAST). The first problem at the FEAST requires the chickens to estimate the number of boarding students at Eggs-Eater Academy given the number of dorms $D$ and the average number of students per dorm $A$. Hen Hao rounds both $D$ and $A$ down to the nearest multiple of $10$ and multiplies them, getting an estimate of $1200$ students. PEAcock rounds both $D$ and $A$ up to the nearest multiple of $10$ and multiplies them, getting an estimate of $N$ students. What is the maximum possible value of $N$? [b]p8.[/b] Farmer James has decided to prepare a large bowl of egg drop soup for the Festival of Eggs-Eater Annual Soup Tasting (FEAST). To flavor the soup, Hen Hao drops eggs into it. Hen Hao drops $1$ egg into the soup in the first hour, $2$ eggs into the soup in the second hour, and so on, dropping $k$ eggs into the soup in the $k$th hour. Find the smallest positive integer $n$ so that after exactly n hours, Farmer James finds that the number of eggs dropped in his egg drop soup is a multiple of $200$. [b]p9.[/b] Farmer James decides to FEAST on Hen Hao. First, he cuts Hen Hao into $2018$ pieces. Then, he eats $1346$ pieces every day, and then splits each of the remaining pieces into three smaller pieces. How many days will it take Farmer James to eat Hen Hao? (If there are fewer than $1346$ pieces remaining, then Farmer James will just eat all of the pieces.) [u]Round 4[/u] [b]p10.[/b] Farmer James has three baskets, and each basket has one magical egg. Every minute, each magical egg disappears from its basket, and reappears with probability $\frac12$ in each of the other two baskets. Find the probability that after three minutes, Farmer James has all his eggs in one basket. [b]p11.[/b] Find the value of $\frac{4 \cdot 7}{\sqrt{4 +\sqrt7} +\sqrt{4 -\sqrt7}}$. [b]p12.[/b] Two circles, with radius $6$ and radius $8$, are externally tangent to each other. Two more circles, of radius $7$, are placed on either side of this configuration, so that they are both externally tangent to both of the original two circles. Out of these $4$ circles, what is the maximum distance between any two centers? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949222p26406222]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let be three nonzero rational numbers $ a,b,c $ under the relation $ (a+b)(b+c)(c+a)=a^2b^2c^2. $ Show that the expression $ \sqrt[3]{3+1/a^3+1/b^3+1/c^3} $ is rational. [i]Ion Bursuc[/i]

Solve the system of equations $$\begin{cases} \dfrac{x+y}{xy}+\dfrac{xy}{x+y}= a+ \dfrac{1}{a}\\ \\\dfrac{x-y}{xy}+\dfrac{xy}{x-y}= c+ \dfrac{1}{c}\end{cases}$$

A midpoint plotter is an instrument which draws the exact mid point of two point previously drawn. Starting off two points $1$ unit of distance apart and using only the midpoint plotter, you have to get two point which are strictly at a distance between $\frac{1}{2017}$ and $\frac{1}{2016}$ units, drawing the minimum amount of points. ¿Which is the minimum number of times you will need to use the midpoint plotter and what strategy should you follow to achieve it?

Consider two geometric sequences $16$, $a_1$, $a_2$, $ . . .$ and $56$, $b_1$, $b_2$, $. . . $ with the same common nonzero ratio. Given that $a_{2023} = b_{2020}$, compute $b_6 - a_6$.