Let $n \ge 2$ and let $x_1, x_2, ..., x_n$ be real numbers satisfying $x_1 +x_2 +...+x_n \ge 0$ and $x_1^2+x_2^2+...+x_n^2=1$. Let $M = max \{x_1, x_2,... , x_n\}$. Show that $M \ge \frac{1}{\sqrt{n(n-1)}}$ (1) .When does equality hold in (1)?

In $\vartriangle ABC$, $\angle ABC = 75^o$ and $\angle BAC$ is obtuse. Points $D$ and $E$ are on $AC$ and $BC$, respectively, such that $\frac{AB}{BC} = \frac{DE}{EC}$ and $\angle DEC = \angle EDC$. Compute $\angle DEC$ in degrees.

Let $f:[0,1]\to\mathbb{R}$ be a continuous function and let $\{a_n\}_n$, $\{b_n\}_n$ be sequences of reals such that \[ \lim_{n\to\infty} \int^1_0 | f(x) - a_nx - b_n | dx = 0 . \] Prove that: a) The sequences $\{a_n\}_n$, $\{b_n\}_n$ are convergent; b) The function $f$ is linear.

Let $ABCD$ be a convex quadrilateral such that the circle with diameter $AB$ is tangent to the line $CD$, and the circle with diameter $CD$ is tangent to the line $AB$. Prove that the two intersection points of these circles and the point $AC \cap BD$ are collinear.

Let $x\geq 5, y\geq 6, z\geq 7$ such that $x^2+y^2+z^2\geq 125$. Find the minimum value of $x+y+z$.

Two concentric circles are divided by $n$ radii into $2n$ parts. Two parts are called neighbors (of each other) if they share either a common side or a common arc. Initially, there are $4n + 1$ frogs inside the parts. At each second, if there are three or more frogs inside one part, then three of the frogs in the part will jump to its neighbors, with one to each neighbor. Prove that in a finite amount of time, for any part either there are frogs in the part or there are frogs in each of its neighbors

Evaluate ${ \int_0^{\frac{\pi}{8}}\frac{\cos x}{\cos (x-\frac{\pi}{8}})}\ dx$.

Sofia ran 5 laps around the 400-meter track at her school. For each lap, she ran the first 100 meters at an average speed of 4 meters per second and the remaining 300 meters at an average speed of 5 meters per second. How much time did Sofia take running the 5 laps? $\textbf{(A) } \text{5 minutes and 35 seconds} $ $\textbf{(B) } \text{6 minutes and 40 seconds} $ $\textbf{(C) } \text{7 minutes and 5 seconds} $ $\textbf{(D) } \text{7 minutes and 25 seconds} $ $\textbf{(E) } \text{8 minutes and 10 seconds} $

Find all positive integers $a$, $b$, $c$, and $p$, where $p$ is a prime number, such that $73p^2 + 6 = 9a^2 + 17b^2 + 17c^2$.

For every natural number $x{}$, let $P(x)$ be the product of the digits of the number $x{}$. Is there a natural number $n{}$ such that the numbers $P(n)$ and $P(n^2)$ are non-zero squares of natural numbers, where the number of digits of the number $n{}$ is equal to (a) 2021 and (b) 2022?

On sides $CB$ and $CD$ of square $ABCD$ are chosen points $M$ and $K$ so that the perimeter of triangle $CMK$ equals double the side of the square. Find angle $\angle MAK$.

Let $X$ be a set and let $\mathcal{P}(X)$ be the set of all subsets of $X$. Let $\mu: \mathcal{P}(X) \to \mathcal{P}(X)$ be a map with the property that $\mu(A \cup B) = \mu(A) \cup \mu(B)$ whenever $A$ and $B$ are disjoint subsets of $X$. Prove that there exists $F \subset X$ such that $\mu(F) = F$.

Two real numbers $ x $ and $ y $ are both chosen at random from the closed interval $ [-10, 10] $. Find the probability that $ x^2 + y^2 < 10 $. Express your answer as a common fraction in terms of $ \pi $.

(J.-L.Ayme, France) Points $ P$, $ Q$ lie on the circumcircle $ \omega$ of triangle $ ABC$. The perpendicular bisector $ l$ to $ PQ$ intersects $ BC$, $ CA$, $ AB$ in points $ A'$, $ B'$, $ C'$. Let $ A"$, $ B"$, $ C"$ be the second common points of $ l$ with the circles $ A'PQ$, $ B'PQ$, $ C'PQ$. Prove that $ AA"$, $ BB"$, $ CC"$ concur.

Karlsson-on-the-Roof has $1000$ jars of jam. The jars are not necessarily identical; each contains no more than $\dfrac{1}{100}$-th of the total amount of the jam. Every morning, Karlsson chooses any $100$ jars and eats the same amount of the jam from each of them. Prove that Karlsson can eat all the jam. [i](8 points)[/i]

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

[u]Fermi Questions[/u] [b]p1.[/b] What is $\sin (1000)$? (note: that's $1000$ radians, not degrees) [b]p2.[/b] In liters, what is the volume of $10$ million US dollars' worth of gold? [b]p3.[/b] How many trees are there on Earth? [b]p4.[/b] How many prime numbers are there between $10^8$ and $10^9$? [b]p5.[/b] What is the total amount of time spent by humans in spaceflight? [b]p6.[/b] What is the global domestic product (total monetary value of all goods and services produced in a country's borders in a year) of Bangladesh in US dollars? [b]p7.[/b] How much time does the average American spend eating during their lifetime, in hours? [b]p8.[/b] How many CHMMC-related emails did the directors receive or send in the last month? [u]Suspiciously Familiar. . .[/u] [b]p9.[/b] Suppose a farmer learns that he will die at the end of the year (day $365$, where today is day $0$) and that he has $100$ sheep. He decides to sell all his sheep on one day, and that his utility is given by $ab$ where $a$ is the money he makes by selling the sheep (which always have a fixed price) and $b$ is the number of days he has left to enjoy the profit; i.e., $365 - k$ where $k$ is the day number. If every day his sheep breed and multiply their numbers by $(421 + b)/421$ (yes, there are small, fractional sheep), on which day should he sell out? [b]p10.[/b] Suppose in your sock drawer of $14$ socks there are $5$ different colors and $3$ different lengths present. One day, you decide you want to wear two socks that have either different colors or different lengths but not both. Given only this information, what is the maximum number of choices you might have? [u]I'm So Meta Even This Acronym[/u] [b]p11.[/b] Let $\frac{s}{t}$ be the answer of problem $13$, written in lowest terms. Let $\frac{p}{q}$ be the answer of problem $12$, written in lowest terms. If player $1$ wins in problem $11$, let $n = q$. Otherwise, let $n = p$. Two players play a game on a connected graph with $n$ vertices and $t$ edges. On each player's turn, they remove one edge of the graph, and lose if this causes the graph to become disconnected. Which player (first or second) wins? [b]p12.[/b] Let $\frac{s}{t}$ be the answer of problem $13$, written in lowest terms. If player $1$ wins in problem $11$, let $n = t$. Otherwise, let $n = s$. Find the maximum value of $$\frac{x^n}{1 + \frac12 x + \frac14 x^2 + ...+ \frac{1}{2^{2n}} x^{2n}}$$ for $x > 0$. [b]p13.[/b] Let $\frac{p}{q}$ be the answer of problem $12$, written in lowest terms. Let $y$ be the largest integer such that $2^y$ divides $p$. If player $1$ wins in problem $11$, let $z = q$. Otherwise, let $z = p$. Suppose that $a_1 = 1$ and $$a_{n+1} = a_n -\frac{z}{n + 2}+\frac{2z}{n + 1}-\frac{z}{n}$$ What is $a_y$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of positive integer solutions of $(x^2 + 2)(y^2 + 3)(z^2 + 4) = 60xyz$.

i) $ABCD$ is a rhombus. A tangent to the inscribed circle meets $AB, DA, BC, CD$ at $M, N, P, Q$ respectively. Find a relationship between $BM$ and $DN$. ii) $ABCD$ is a rhombus and $P$ a point inside. The circles through $P$ with centers $A, B, C, D$ meet the four sides $AB, BC, CD, DA$ in eight points. Find a property of the resulting octagon. Use it to construct a regular octagon. iii) Rotate the figure about the line $AC$ to form a solid. State a similar result.

$p$ is a prime. Find all relatively prime positive integers $m$, $n$ such that \[ \frac{m}{n}+\frac{1}{p^2}=\frac{m+p}{n+p} \]

In chess, a king threatens another king if, and only if, they are on neighboring squares, whether horizontally, vertically, or diagonally . Find the greatest amount of kings that can be placed on a $12 \times 12$ board such that each king threatens just another king. Here, we are not considering part colors, that is, consider that the king are all, say, white, and that kings of the same color can threaten each other.

The center of circle $\omega_1$ of radius $6$ lies on circle $\omega_2$ of radius $6$. The circles intersect at points $K$ and $W$. Let point $U$ lie on the major arc $\overarc{KW}$ of $\omega_2$, and point $I$ be the center of the largest circle that can be inscribed in $\triangle KWU$. If $KI+WI=11$, find $KI\cdot WI$. [i]Proposed by Bradley Guo[/i]

Find all $ 3$-digit numbers such that placing to the right side of the number its successor we get a $ 6$-digit number which is a perfect square.

Justine has two fair dice, one with sides labeled $1,2,\ldots, m$ and one with sides labeled $1,2,\ldots, n.$ She rolls both dice once. If $\tfrac{3}{20}$ is the probability that at least one of the numbers showing is at most 3, find the sum of all distinct possible values of $m+n$. [i]Proposed by Justin Stevens[/i]

A positive real number $a$ and two rays wich intersect at point $A$ are given. Show that all the circles which pass through $A$ and intersect these rays at points $B$ and $C$ where $|AB|+|AC|=a$ have a common point other than $A$.