Let $ a_1 \geq a_2 \geq \ldots \geq a_n$ be real numbers such that for all integers $ k > 0,$ \[ a^k_1 \plus{} a^k_2 \plus{} \ldots \plus{} a^k_n \geq 0.\] Let $ p \equal{}\max\{|a_1|, \ldots, |a_n|\}.$ Prove that $ p \equal{} a_1$ and that \[ (x \minus{} a_1) \cdot (x \minus{} a_2) \cdots (x \minus{} a_n) \leq x^n \minus{} a^n_1\] for all $ x > a_1.$

Find all functions $f:\mathbb {R}^{+} \rightarrow \mathbb {R}^{+} $ such that for all positive real numbers $x,y:$ $$f(y)f(x+f(y))=f(x)f(xy)$$

$(MON 3)$ Let $A_k (1 \le k \le h)$ be $n-$element sets such that each two of them have a nonempty intersection. Let $A$ be the union of all the sets $A_k,$ and let $B$ be a subset of $A$ such that for each $k (1\le k \le h)$ the intersection of $A_k$ and $B$ consists of exactly two different elements $a_k$ and $b_k$. Find all subsets $X$ of the set $A$ with $r$ elements satisfying the condition that for at least one index $k,$ both elements $a_k$ and $b_k$ belong to $X$.

Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$. [i]Victor Wang.[/i]

Complex numbers ${x_i},{y_i}$ satisfy $\left| {{x_i}} \right| = \left| {{y_i}} \right| = 1$ for $i=1,2,\ldots ,n$. Let $x=\frac{1}{n}\sum\limits_{i=1}^n{{x_i}}$, $y=\frac{1}{n}\sum\limits_{i=1}^n{{y_i}}$ and $z_i=x{y_i}+y{x_i}-{x_i}{y_i}$. Prove that $\sum\limits_{i=1}^n{\left| {{z_i}}\right|}\leqslant n$.

Let $r$ be the remainder when $2017^{2025!}-1$ is divided by $2025!.$ Compute $\tfrac{r}{2025!}.$ (Note that $2017$ is prime.)

The sequence $ \{x_n\}$ is defined by \[ \left\{ \begin{array}{l}x_1 \equal{} \frac{1}{2} \\x_n \equal{} \frac{{\sqrt {x_{n \minus{} 1} ^2 \plus{} 4x_{n \minus{} 1} } \plus{} x_{n \minus{} 1} }}{2} \\\end{array} \right.\] Prove that the sequence $ \{y_n\}$, where $ y_n\equal{}\sum_{i\equal{}1}^{n}\frac{1}{{{x}_{i}}^{2}}$, has a finite limit and find that limit.

Determine the largest natural number $k$ such that there exists a natural number $n$ satisfying: \[ \sin(n + 1) < \sin(n + 2) < \sin(n + 3) < \ldots < \sin(n + k). \]

Let $t_1 < t_2 < t_3 < \cdots < t_{99}$ be real numbers. Consider a function $f: \mathbb{R} \to \mathbb{R}$ given by $f(x)=|x-t_1|+|x-t_2|+...+|x-t_{99}|$ . Show that $f(x)$ will attain minimum value at $x=t_{50}$.

If $a_1, a_2, \ldots$ is a sequence of real numbers such that for all $n$, $$\sum_{k = 1}^n a_k \left( \frac{k}{n} \right)^2 = 1,$$ find the smallest $n$ such that $a_n < \frac{1}{2018}$.

Let $f(x, y) = \left\lfloor \frac{5x}{2y} \right\rfloor + \left\lceil \frac{5y}{2x} \right\rceil$. Suppose $x, y$ are chosen independently uniformly at random from the interval $(0, 1]$. Let $p$ be the probability that $f(x, y) < 6$. If $p$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$, compute $m + n$. (Note: $\lfloor x\rfloor $ is defined as the greatest integer less than or equal to $x$ and $\lceil x \rceil$ is defined as the least integer greater than or equal to$ x$.)

[hide=B stands for Bernoulli, G stands for Germain]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]B16 / G11[/b] Let triangle $ABC$ be an equilateral triangle with side length $6$. If point $D$ is on $AB$ and point $E$ is on $BC$, find the minimum possible value of $AD + DE + CE$. [b]B17 / G12[/b] Find the smallest positive integer $n$ with at least seven divisors. [b]B18 / G13[/b] Square $A$ is inscribed in a circle. The circle is inscribed in Square $B$. If the circle has a radius of $10$, what is the ratio between a side length of Square $A$ and a side length of Square $B$? [b]B19 / G14[/b] Billy Bob has $5$ distinguishable books that he wants to place on a shelf. How many ways can he order them if he does not want his two math books to be next to each other? [b]B20 / G15[/b] Six people make statements as follows: Person $1$ says “At least one of us is lying.” Person $2$ says “At least two of us are lying.” Person $3$ says “At least three of us are lying.” Person $4$ says “At least four of us are lying.” Person $5$ says “At least five of us are lying.” Person $6$ says “At least six of us are lying.” How many are lying? [u]Set 5[/u] [b]B21 / G16[/b] If $x$ and $y$ are between $0$ and $1$, find the ordered pair $(x, y)$ which maximizes $(xy)^2(x^2 - y^2)$. [b]B22 / G17[/b] If I take all my money and divide it into $12$ piles, I have $10$ dollars left. If I take all my money and divide it into $13$ piles, I have $11$ dollars left. If I take all my money and divide it into $14$ piles, I have $12$ dollars left. What’s the least amount of money I could have? [b]B23 / G18[/b] A quadratic equation has two distinct prime number solutions and its coefficients are integers that sum to a prime number. Find the sum of the solutions to this equation. [b]B24 / G20[/b] A regular $12$-sided polygon is inscribed in a circle. Gaz then chooses $3$ vertices of the polygon at random and connects them to form a triangle. What is the probability that this triangle is right? [b]B25 / G22[/b] A book has at most $7$ chapters, and each chapter is either $3$ pages long or has a length that is a power of $2$ (including $1$). What is the least positive integer $n$ for which the book cannot have $n$ pages? [u]Set 6[/u] [b]B26 / G26[/b] What percent of the problems on the individual, team, and guts rounds for both divisions have integer answers? [b]B27 / G27[/b] Estimate $12345^{\frac{1}{123}}$. [b]B28 / G28[/b] Let $O$ be the center of a circle $\omega$ with radius $3$. Let $A, B, C$ be randomly selected on $\omega$. Let $M$, $N$ be the midpoints of sides $BC$, $CA$, and let $AM$, $BN$ intersect at $G$. What is the probability that $OG \le 1$? [b]B29 / G29[/b] Let $r(a, b)$ be the remainder when $a$ is divided by $b$. What is $\sum^{100}_{i=1} r(2^i , i)$? [b]B30 / G30[/b] Bongo flips $2023$ coins. Call a run of heads a sequence of consecutive heads. Say a run is maximal if it isn’t contained in another run of heads. For example, if he gets $HHHT T HT T HHHHT H$, he’d have maximal runs of length $3, 1, 4, 1$. Bongo squares the lengths of all his maximal runs and adds them to get a number $M$. What is the expected value of $M$? - - - - - - [b]G19[/b] Let $ABCD$ be a square of side length $2$. Let $M$ be the midpoint of $AB$ and $N$ be the midpoint of $AD$. Let the intersection of $BN$ and $CM$ be $E$. Find the area of quadrilateral $NECD$. [b]G21[/b] Quadrilateral $ABCD$ has $\angle A = \angle D = 60^o$. If $AB = 8$, $CD = 10$, and $BC = 3$, what is length $AD$? [b]G23[/b] $\vartriangle ABC$ is an equilateral triangle of side length $x$. Three unit circles $\omega_A$, $\omega_B$, and $\omega_C$ lie in the plane such that $\omega_A$ passes through $A$ while $\omega_B$ and $\omega_C$ are centered at $B$ and $C$, respectively. Given that $\omega_A$ is externally tangent to both $\omega_B$ and $\omega_C$, and the center of $\omega_A$ is between point $A$ and line $\overline{BC}$, find $x$. [b]G24[/b] For some integers $n$, the quadratic function $f(x) = x^2 - (6n - 6)x - (n^2 - 12n + 12)$ has two distinct positive integer roots, exactly one out of which is a prime and at least one of which is in the form $2^k$ for some nonnegative integer $k$. What is the sum of all possible values of $n$? [b]G25[/b] In a triangle, let the altitudes concur at $H$. Given that $AH = 30$, $BH = 14$, and the circumradius is $25$, calculate $CH$ PS. You should use hide for answers. Rest problems have been posted [url=https://artofproblemsolving.com/community/c3h3132167p28376626]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_1,a_2,\cdots,a_{22}\in [1,2],$ find the maximum value of $$\dfrac{\sum\limits_{i=1}^{22}a_ia_{i+1}}{\left( \sum\limits_{i=1}^{22}a_i\right) ^2}$$where $a_{23}=a_1.$

$ \forall n > 0, n \in \mathbb{Z},$ there exists uniquely determined integers $ a_n, b_n, c_n \in \mathbb{Z}$ such \[ \left(1 \plus{} 4 \cdot \sqrt[3]{2} \minus{} 4 \cdot \sqrt[3]{4} \right)^n \equal{} a_n \plus{} b_n \cdot \sqrt[3]{2} \plus{} c_n \cdot \sqrt[3]{4}.\] Prove that $ c_n \equal{} 0$ implies $ n \equal{} 0.$

Determine the value of the parameter $m$ such that the equation $(m-2)x^2+(m^2-4m+3)x-(6m^2-2)=0$ has real solutions, and the sum of the third powers of these solutions is equal to zero.

Let $ S $ be the first quadrant and $ T:S\longrightarrow S $ be a transformation that takes the reciprocal of the coordinates of the points that belong to its domain. Define an [i]S-line[/i] to be the intersection of a line with $ S. $ [b]a)[/b] Show that the fixed points of $ T $ lie on any fixed S-line of $ T. $ [b]b)[/b] Find all fixed S-lines of $ T. $ [i]Gabriel Popa[/i]

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

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$.

Let $P(x)$ be a polynomial with integer coefficients that satisfies $P(17)=10$ and $P(24)=17$. Given that $P(n)=n+3$ has two distinct integer solutions $n_1$ and $n_2$, find the product $n_1\cdot n_2$.

The real numbers $a$ and $b$ satisfy the relation $a + b \ge 1$. Show that $8 (a^4 + b^4) \ge 1$.

Suppose $a$ and $b$ are real numbers such that the polynomial $x^3+ax^2+bx+15$ has a factor of $x^2-2$. Find the value of $a^2b^2$.

Given complex numbers $x,y,z$, with $|x|^2+|y|^2+|z|^2=1$. Prove that: $$|x^3+y^3+z^3-3xyz| \le 1$$

Find all strictly increasing sequences of positive integers $a_1, a_2, \ldots$ with $a_1=1$, satisfying $$3(a_1+a_2+\ldots+a_n)=a_{n+1}+\ldots+a_{2n}$$ for all positive integers $n$.

Find all pairs of prime numbers $p$ and $q$ such that: \[ p(p + q) = q^p+ 1. \]

Prove that if $ a_1 < a_2 < \ldots < a_n $ and $ b_1 < b_2 < \ldots < b_n $, where $ n \geq 2 $, then $$\qquad (a_1 + a_2 + \ldots + a_n)(b_1 + b_2 + \ldots + b_n) < n(a_1b_1 + a_2b_2 + \ldots + a_nb_n).$$