Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

Let $f : \mathbb{N} \to \mathbb{N}$ be a function such that the following conditions hold: $\qquad\ (1) \; f(1) = 1.$ $\qquad\ (2) \; \dfrac{(x + y)}{2} < f(x + y) \le f(x) + f(y) \; \forall \; x, y \in \mathbb{N}.$ $\qquad\ (3) \; f(4n + 1) < 2f(2n + 1) \; \forall \; n \ge 0.$ $\qquad\ (4) \; f(4n + 3) \le 2f(2n + 1) \; \forall \; n \ge 0.$ Find the sum of all possible values of $f(2023)$.

Find the smallest positive integer $n$ such that the equation $\sqrt3 z^{n+1} - z^n - 1 = 0$ has a root on the unit circle.

Given an infinite sequence $ \{a_n\} $. Prove that if $$ a_n + a_{n+2} > 2a_{n+1} \ \ for \ \ n = 1, 2 ... $$ then $$ \frac{a_1+a_3+\ldots a_{2n+1}}{n+1} \geq \frac{a_2+a_4+\ldots a_{2n}}{n} $$ for $ n = 1, 2, \ldots $.

Find all $ f:\mathbb{Z}\rightarrow\mathbb{Z} $ such that \[ f(2m+f(m)+f(m)f(n))=nf(m)+m \] $ \forall m,n\in\mathbb{Z} $

Let ⋆ be a binary operation on a nonempty set $M$. That is, every pair $(a,b) \in M$ is assigned an element $a$ ⋆$ b$ in $M$. Suppose that ⋆ has the additional property that $(a $ ⋆ $b) $ ⋆$ b= a$ and $a$ ⋆ $(a$ ⋆$ b)= b$ for all $a,b \in M$. (a) Show that $a$ ⋆ $b = b$ ⋆ $a$ for all $a,b \in M$. (b) On which finite sets $M$ does such a binary operation exist?

Find the number of quadruples $(a,b,c,d)$ of integers which satisfy both \begin{align*}\frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} &= \frac{1}{2}\qquad\text{and}\\\\2(a+b+c+d) &= ab + cd + (a+b)(c+d) + 1.\end{align*}

Omkar, Krit1, Krit2, and Krit3 are sharing $x > 0$ pints of soup for dinner. Omkar always takes $1$ pint of soup (unless the amount left is less than one pint, in which case he simply takes all the remaining soup). Krit1 always takes $\frac16$ of what is left, Krit2 always takes $\frac15$ of what is left, and Krit3 always takes $\frac14$ of what is left. They take soup in the order of Omkar, Krit1, Krit2, Krit3, and then cycle through this order until no soup remains. Find all $x$ for which everyone gets the same amount of soup.

The numbers $a^2, b^2, c^2$ form an arithmetic progression. Show that the numbers $\frac{1}{b+c},\frac{1}{c+a},\frac{1}{a+b}$ also form arithmetic progression.

Find all values of $n$ for which all solutions of the equation $x^3-3x+n=0$ are integers.

By placing parentheses in the expression $1:2:3$ we can get two different number values: $(1 : 2) : 3 = \frac16$ and $1 : (2 : 3) = \frac32$. Now brackets are placed in the expression $1:2:3:4:5:6:7:8$. Multiple bracket pairs are allowed, whether or not in nest form. (a) What is the largest numerical value we can get, and what is the smallest? (b) How many different number values can be obtained?

Consider a system of inequalities \begin{align*}y-x&\ge|x+1|-|x-1|, \\ |y&-x|-y+x\ge2.\end{align*} Draw solutions of each inequality in the plane separately and highlight solution of the system.

Kiana has two older twin brothers. The product of their ages is $ 128$. What is the sum of their three ages? $ \textbf{(A)}\ 10\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 18\qquad \textbf{(E)}\ 24$

For all natural numbers $n$, consider the polynomial $P_n(x) = x^{n+2}-2x+1$. (a) Show that the equation $P_n(x)=0$ has exactly one root $c_n$ in the open interval $(0,1)$. (b) Find $lim_{n \to \infty}c_n$.

[u]Set 6[/u] [b]p16.[/b] Let $n! = n \times (n - 1) \times ... \times 2 \times 1$. Find the maximum positive integer value of $x$ such that the quotient $\frac{160!}{160^x}$ is an integer. [b]p17.[/b] Let $\vartriangle OAB$ be a triangle with $\angle OAB = 90^o$ . Draw points $C, D, E, F, G$ in its plane so that $$\vartriangle OAB \sim \vartriangle OBC \sim \vartriangle OCD \sim \vartriangle ODE \sim \vartriangle OEF \sim \vartriangle OFG,$$ and none of these triangles overlap. If points $O, A, G$ lie on the same line, then let $x$ be the sum of all possible values of $\frac{OG}{OA }$. Then, $x$ can be expressed in the form $m/n$ for relatively prime positive integers $m, n$. Compute $m + n$. [b]p18.[/b] Let $f(x)$ denote the least integer greater than or equal to $x^{\sqrt{x}}$. Compute $f(1)+f(2)+f(3)+f(4)$. [u]Set 7[/u] The Fibonacci sequence $\{F_n\}$ is defined as $F_0 = 0$, $F_1 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all integers $n \ge 0$. [b]p19.[/b] Find the least odd prime factor of $(F_3)^{20} + (F_4)^{20} + (F_5)^{20}$. [b]p20.[/b] Let $$S = \frac{1}{F_3F_5}+\frac{1}{F_4F_6}+\frac{1}{F_5F_7}+\frac{1}{F_6F_8}+...$$ Compute $420S$. [b]p21.[/b] Consider the number $$Q = 0.000101020305080130210340550890144... ,$$ the decimal created by concatenating every Fibonacci number and placing a 0 right after the decimal point and between each Fibonacci number. Find the greatest integer less than or equal to $\frac{1}{Q}$. [u]Set 8[/u] [b]p22.[/b] In five dimensional hyperspace, consider a hypercube $C_0$ of side length $2$. Around it, circumscribe a hypersphere $S_0$, so all $32$ vertices of $C_0$ are on the surface of $S_0$. Around $S_0$, circumscribe a hypercube $C_1$, so that $S_0$ is tangent to all hyperfaces of $C_1$. Continue in this same fashion for $S_1$, $C_2$, $S_2$, and so on. Find the side length of $C_4$. [b]p23.[/b] Suppose $\vartriangle ABC$ satisfies $AC = 10\sqrt2$, $BC = 15$, $\angle C = 45^o$. Let $D, E, F$ be the feet of the altitudes in $\vartriangle ABC$, and let $U, V , W$ be the points where the incircle of $\vartriangle DEF$ is tangent to the sides of $\vartriangle DEF$. Find the area of $\vartriangle UVW$. [b]p24.[/b] A polynomial $P(x)$ is called spicy if all of its coefficients are nonnegative integers less than $9$. How many spicy polynomials satisfy $P(3) = 2019$? [i]The next set will consist of three estimation problems.[/i] [u]Set 9[/u] Points will be awarded based on the formulae below. Answers are nonnegative integers that may exceed $1,000,000$. [b]p25.[/b] Suppose a circle of radius $20192019$ has area $A$. Let s be the side length of a square with area $A$. Compute the greatest integer less than or equal to $s$. If $n$ is the correct answer, an estimate of $e$ gives $\max \{ 0, \left\lfloor 1030 ( min \{ \frac{n}{e},\frac{e}{n}\}^{18}\right\rfloor -1000 \}$ points. [b]p26.[/b] Given a $50 \times 50$ grid of squares, initially all white, define an operation as picking a square and coloring it and the four squares horizontally or vertically adjacent to it blue, if they exist. If a square is already colored blue, it will remain blue if colored again. What is the minimum number of operations necessary to color the entire grid blue? If $n$ is the correct answer, an estimate of $e$ gives $\left\lfloor \frac{180}{5|n-e|+6}\right\rfloor$ points. [b]p27.[/b] The sphere packing problem asks what percent of space can be filled with equally sized spheres without overlap. In three dimensions, the answer is $\frac{\pi}{3\sqrt2} \approx 74.05\%$ of space (confirmed as recently as $2017!$), so we say that the packing density of spheres in three dimensions is about $0.74$. In fact, mathematicians have found optimal packing densities for certain other dimensions as well, one being eight-dimensional space. Let d be the packing density of eight-dimensional hyperspheres in eightdimensional hyperspace. Compute the greatest integer less than $10^8 \times d$. If $n$ is the correct answer, an estimate of e gives $\max \left\{ \lfloor 30-10^{-5}|n - e|\rfloor, 0 \right\}$ points. PS. You had better use hide for answers. First sets have be posted [url=https://artofproblemsolving.com/community/c4h2777330p24370124]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The natural numbers $x_1$ and $x_2$ are less than $1000$. We construct a sequence: $$x_3 = |x_1 - x_2|$$ $$x_4 = min \{ |x_1 - x_2|, |x_1 - x_3|, |x_2 - x_3|\}$$ $$...$$ $$x_k = min \{ |x_i - x_j|, 0 <i < j < k\}$$ $$...$$ Prove that $x_{21} = 0$.

In the set $ S_n \equal{} \{1, 2,\ldots ,n\}$ a new multiplication $ a*b$ is defined with the following properties: [b](i)[/b] $ c \equal{} a * b$ is in $ S_n$ for any $ a \in S_n, b \in S_n.$ [b](ii)[/b] If the ordinary product $ a \cdot b$ is less than or equal to $ n,$ then $ a*b \equal{} a \cdot b.$ [b](iii)[/b] The ordinary rules of multiplication hold for $ *,$ i.e.: [b](1)[/b] $ a * b \equal{} b * a$ (commutativity) [b](2)[/b] $ (a * b) * c \equal{} a * (b * c)$ (associativity) [b](3)[/b] If $ a * b \equal{} a * c$ then $ b \equal{} c$ (cancellation law). Find a suitable multiplication table for the new product for $ n \equal{} 11$ and $ n \equal{} 12.$

Let $S$ be a finite set of integers. Suppose that for every two different elements of $S$, $p$ and $q$, there exist not necessarily distinct integers $a \neq 0$, $b$, $c$ belonging to $S$, such that $p$ and $q$ are the roots of the polynomial $ax^{2}+bx+c$. Determine the maximum number of elements that $S$ can have.

Given a function $f(x)=x^{2}+ax+b$ with $a,b \in R$, if there exists a real number $m$ such that $\left| f(m) \right| \leq \frac{1}{4}$ and $\left| f(m+1) \right| \leq \frac{1}{4}$, then find the maximum and minimum of the value of $\Delta=a^{2}-4b$.

Find all polynomials \(P(x)\) with real coefficients such that for all nonzero real numbers \(x\), \[P(x)+P\left(\frac1x\right) =\frac{P\left(x+\frac1x\right) +P\left(x-\frac1x\right)}2.\] [i]Proposed by Holden Mui[/i]

Let $ f(x)$ be a function defined on $ [0,\ 1]$. For $ n=1,\ 2,\ 3,\ \cdots$, a polynomial $ P_n(x)$ is defined by $ P_n(x)=\sum_{k=0}^n {}_nC{}_k f\left(\frac{k}{n}\right)x^k(1-x)^{n-k}$. Prove that $ \lim_{n\to\infty} \int_0^1 P_n(x)dx=\int_0^1 f(x)dx$.

Prove that the equation $$\frac{m^2}{a-x} + \frac{n^2}{b-x} = 1,$$ where $ m \ne 0 $, $ n \ne 0 $, $ a \ne b $, has real roots ($ m $, $ n $, $ a $, $ b $ denote real numbers).

[b]p1.[/b] Cities A, B, C, D and E are located next to each other along the highway at a distance of $5$ km from each other. The bus runs along the highway from city A to city E and back. The bus consumes $20$ liters of gasoline for every $100$ kilometers. In which city will a bus run out of gas if it initially had $150$ liters of gasoline in its tank? [b]p2.[/b] Find the minimum four-digit number whose product of all digits is $729$. Explain your answer. [b]p3.[/b] At the parade, soldiers are lined up in two lines of equal length, and in the first line the distance between adjacent soldiers is $ 20\%$ greater than in the second (there is the same distance between adjacent soldiers in the same line). How many soldiers are in the first rank if there are $85$ soldiers in the second rank? [b]p4.[/b] It is known about three numbers that the sum of any two of them is not less than twice the third number, and the sum of all three is equal to $300$. Find all triplets of such (not necessarily integer) numbers. [b]p5.[/b] The tourist fills two tanks of water using two hoses. $2.9$ liters of water flow out per minute from the first hose, $8.7$ liters from the second. At that moment, when the smaller tank was half full, the tourist swapped the hoses, after which both tanks filled at the same time. What is the capacity of the larger tank if the capacity of the smaller one is $12.5$ liters? [b]p6.[/b] Is it possible to mark 6 points on a plane and connect them with non-intersecting segments (with ends at these points) so that exactly four segments come out of each point? [b]p7.[/b] Petya wrote all the natural numbers from $1$ to $1000$ and circled those that are represented as the difference of the squares of two integers. Among the circled numbers, which numbers are more even or odd? [b]p8.[/b] On a sheet of checkered paper, draw a circle of maximum radius that intersects the grid lines only at the nodes. Explain your answer. [b]p9.[/b] Along the railway there are kilometer posts at a distance of $1$ km from each other. One of them was painted yellow and six were painted red. The sum of the distances from the yellow pillar to all the red ones is $14$ km. What is the maximum distance between the red pillars? [b]p10.[/b] The island nation is located on $100$ islands connected by bridges, with some islands also connected to the mainland by a bridge. It is known that from each island you can travel to each (possibly through other islands). In order to improve traffic safety, one-way traffic was introduced on all bridges. It turned out that from each island you can leave only one bridge and that from at least one of the islands you can go to the mainland. Prove that from each island you can get to the mainland, and along a single route. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2 \cdot n$ real numbers. Prove that the following two statements are equivalent: [b]i)[/b] For any $ n$ real numbers $ x_1$, $ x_2$, ..., $ x_n$ satisfying $ x_1 \leq x_2 \leq \ldots \leq x_ n$, we have $ \sum^{n}_{k \equal{} 1} a_k \cdot x_k \leq \sum^{n}_{k \equal{} 1} b_k \cdot x_k,$ [b]ii)[/b] We have $ \sum^{s}_{k \equal{} 1} a_k \leq \sum^{s}_{k \equal{} 1} b_k$ for every $ s\in\left\{1,2,...,n\minus{}1\right\}$ and $ \sum^{n}_{k \equal{} 1} a_k \equal{} \sum^{n}_{k \equal{} 1} b_k$.

Let $S$ be the unit circle in the complex plane (i.e. the set of all complex numbers with their moduli equal to $1$). We define function $f:S\rightarrow S$ as follow: $\forall z\in S$, $ f^{(1)}(z)=f(z), f^{(2)}(z)=f(f(z)), \dots,$ $f^{(k)}(z)=f(f^{(k-1)}(z)) (k>1,k\in \mathbb{N}), \dots$ We call $c$ an $n$-[i]period-point[/i] of $f$ if $c$ ($c\in S$) and $n$ ($n\in\mathbb{N}$) satisfy: $f^{(1)}(c) \not=c, f^{(2)}(c) \not=c, f^{(3)}(c) \not=c, \dots, f^{(n-1)}(c) \not=c, f^{(n)}(c)=c$. Suppose that $f(z)=z^m$ ($z\in S; m>1, m\in \mathbb{N}$), find the number of $1989$-[i]period-point[/i] of $f$.