Show how to construct a line segment length $(a^4 + b^4)^{1/4}$ given segments lengths $a$ and $b$.

[u]Round 1[/u] [b]p1.[/b] What is the smallest number equal to its cube? [b]p2.[/b] Fhomas has $5$ red spaghetti and $5$ blue spaghetti, where spaghetti are indistinguishable except for color. In how many different ways can Fhomas eat $6$ spaghetti, one after the other? (Two ways are considered the same if the sequence of colors are identical) [b]p3.[/b] Jocelyn labels the three corners of a triangle with three consecutive natural numbers. She then labels each edge with the sum of the two numbers on the vertices it touches, and labels the center with the sum of all three edges. If the total sum of all labels on her triangle is $120$, what is the value of the smallest label? [u]Round 2[/u] [b]p4.[/b] Adam cooks a pie in the shape of a regular hexagon with side length $12$, and wants to cut it into right triangular pieces with angles $30^o$, $60^o$, and $90^o$, each with shortest side $3$. What is the maximum number of such pieces he can make? [b]p5.[/b] If $f(x) =\frac{1}{2-x}$ and $g(x) = 1-\frac{1}{x}$ , what is the value of $f(g(f(g(... f(g(f(2019))) ...))))$, where there are $2019$ functions total, counting both $f$ and $g$? [b]p6.[/b] Fhomas is buying spaghetti again, which is only sold in two types of boxes: a $200$ gram box and a $500$ gram box, each with a fixed price. If Fhomas wants to buy exactly $800$ grams, he must spend $\$8:80$, but if he wants to buy exactly 900 grams, he only needs to spend $\$7:90$! In dollars, how much more does the $500$ gram box cost than the $200$ gram box? [u]Round 3[/u] [b]p7.[/b] Given that $$\begin{cases} a + 5b + 9c = 1 \\ 4a + 2b + 3c = 2 \\ 7a + 8b + 6c = 9\end{cases}$$ what is $741a + 825b + 639c$? [b]p8.[/b] Hexagon $JAMESU$ has line of symmetry $MU$ (i.e., quadrilaterals $JAMU$ and $SEMU$ are reflections of each other), and $JA = AM = ME = ES = 1$. If all angles of $JAMESU$ are $135$ degrees except for right angles at $A$ and $E$, find the length of side $US$. [b]p9.[/b] Max is parked at the $11$ mile mark on a highway, when his pet cheetah, Min, leaps out of the car and starts running up the highway at its maximum speed. At the same time, Max starts his car and starts driving down the highway at $\frac12$ his maximum speed, driving all the way to the $10$ mile mark before realizing that his cheetah is gone! Max then immediately reverses directions and starts driving back up the highway at his maximum speed, nally catching up to Min at the $20$ mile mark. What is the ratio between Max's max speed and Min's max speed? [u]Round 4[/u] [b]p10.[/b] Kevin owns three non-adjacent square plots of land, each with side length an integer number of meters, whose total area is $2019$ m$^2$. What is the minimum sum of the perimeters of his three plots, in meters? [b]p11.[/b] Given a $5\times 5$ array of lattice points, how many squares are there with vertices all lying on these points? [b]p12.[/b] Let right triangle $ABC$ have $\angle A = 90^o$, $AB = 6$, and $AC = 8$. Let points $D,E$ be on side $AC$ such that $AD = EC = 2$, and let points $F,G$ be on side $BC$ such that $BF = FG = 3$. Find the area of quadrilateral $FGED$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949413p26408203]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for every positive integer $n \geq 3$ there exist two sets $A =\{ x_1, x_2,\ldots, x_n\}$ and $B =\{ y_1, y_2,\ldots, y_n\}$ for which [b]i)[/b] $A \cap B = \varnothing.$ [b]ii)[/b] $x_1+ x_2+\cdots+ x_n= y_1+ y_2+\cdots+ y_n.$ [b]ii)[/b] $x_1^2+ x_2^2+\cdots+ x_n^2= y_1^2+ y_2^2+\cdots+ y_n^2.$

If $ x^{ \minus{} 1} \minus{} 1$ is divided by $ x \minus{} 1$ the quotient is: $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac {1}{x \minus{} 1} \qquad\textbf{(C)}\ \frac { \minus{} 1}{x \minus{} 1} \qquad\textbf{(D)}\ \frac {1}{x} \qquad\textbf{(E)}\ \minus{} \frac {1}{x}$

Let \(\mathcal E\) be an ellipse with foci \(F_1\) and \(F_2\), and let \(P\) be a point on \(\mathcal E\). Suppose lines \(PF_1\) and \(PF_2\) intersect \(\mathcal E\) again at distinct points \(A\) and \(B\), and the tangents to \(\mathcal E\) at \(A\) and \(B\) intersect at point \(Q\). Show that the midpoint of \(\overline{PQ}\) lies on the circumcircle of \(\triangle PF_1F_2\). [i]Proposed by Karthik Vedula[/i]

Let $T$ be the smallest positive integers which, when divided by $11,13,15$ leaves remainders in the sets {$7,8,9$}, {$1,2,3$}, {$4,5,6$} respectively. What is the sum of the squares of the digits of $T$ ?

Given a circle and a quadrilateral $ABCD$ whose vertices all lie on the circle. Let $R$ be the midpoint of arc $AB$. The line $RC$ meets line $AB$ at point $S$, and the line $RD$ meets line $AB$ at point $T$. Prove that $CDTS$ is a cyclic quadrilateral.

There are $n$ MOPpers $p_1,...,p_n$ designing a carpool system to attend their morning class. Each $p_i$'s car fits $\chi (p_i)$ people ($\chi : \{p_1,...,p_n\} \to \{1,2,...,n\}$). A $c$-fair carpool system is an assignment of one or more drivers on each of several days, such that each MOPper drives $c$ times, and all cars are full on each day. (More precisely, it is a sequence of sets $(S_1, ...,S_m)$ such that $|\{k: p_i\in S_k\}|=c$ and $\sum_{x\in S_j} \chi(x) = n$ for all $i,j$. ) Suppose it turns out that a $2$-fair carpool system is possible but not a $1$-fair carpool system. Must $n$ be even? [i]Proposed by Nathan Ramesh and Palmer Mebane

A circle is divided into $2n$ equal arcs by $2n$ points. Find all $n>1$ such that these points can be joined in pairs using $n$ segments, all of different lengths and such that each point is the endpoint of exactly one segment.

Find all integers $n\geq 3$ for which every convex equilateral $n$-gon of side length $1$ contains an equilateral triangle of side length $1$. (Here, polygons contain their boundaries.)

The $7$-gon $A_1A_2A_3A_4A_5A_6A_7$ is inscribed in a circle. Prove that if the centre of the circle is inside the $7$-gon , than $$\angle A_1+ \angle A_2 + \angle A_3 < 450^o$$

Consider the $5$ by $5$ by $5$ equilateral triangular grid as shown: [asy] size(5cm); real n = 5; for (int i = 0; i < n; ++i) { draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i)); } for (int i = 0; i < n; ++i) { draw((n-i,0)--((n-i)/2,(n-i)*0.866)); } for (int i = 0; i < n; ++i) { draw((i,0)--((n+i)/2,(n-i)*0.866)); } [/asy] Ethan chooses two distinct upward-oriented equilateral triangles bounded by the gridlines. The probability that Ethan chooses two triangles that share exactly one vertex can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Andrew Wen[/i]

Given $n\ge 2$ a natural number, $(K,+,\cdot )$ a body with commutative property that $\underbrace{1+...+}_{m}1\ne 0,m=2,...,n,f\in K[X]$ a polynomial of degree $n$ and $G$ a subgroup of the additive group $(K,+,\cdot )$, $G\ne K.$Show that there is $a\in K$ so$f(a)\notin G$.

Let $x,y>0$ be real numbers.Prove that: $$\frac{1}{x^2+y^2} +\frac{1}{x^2}+\frac{1}{y^2}\ge\frac{10}{(x+y)^2}$$ I tried CBS, but it doesn't work... Can you give an idea, please?

Let $ABCD$ be a tetrahedron. Let $a$ be the length of $AB$ and let $S$ be the area of the projection of the tetrahedron onto a plane perpendicular to $AB$. Determine the volume of the tetrahedron in terms of $a$ and $S$.

Find all pairs of integers $ (x,y)$, such that \[ x^2 \minus{} 2009y \plus{} 2y^2 \equal{} 0 \]

Each integer has been colored in one of three colors. Prove that exist two different numbers of the same color, whose difference is a perfect square.

On a twenty-question test, each correct answer is worth 5 points, each unanswered question is worth 1 point and each incorrect answer is worth 0 points. Which of the following scores is NOT possible? $ \text{(A)}\ 90\qquad\text{(B)}\ 91\qquad\text{(C)}\ 92\qquad\text{(D)}\ 95\qquad\text{(E)}\ 97 $

In a triangle $ ABC $ with $ AB\neq AC, $ let $ D $ be the midpoint of the side $ BC $ and denote with $ E $ the feet of the bisector of $ \angle BAC. $ Also, let $ M,N $ be two points situated in the exterior of $ ABC $ such that $ AMB\sim ANC. $ Prove the following propositions: $ \text{(a)} MN\perp AD\iff MA\perp AB $ $ \text{(b)} MN\perp AE \iff\angle MAN=180^{\circ } $

Suppose that a parabola has vertex $\left(\tfrac{1}{4},-\tfrac{9}{8}\right)$, and equation $y=ax^2+bx+c$, where $a>0$ and $a+b+c$ is an integer. The minimum possible value of $a$ can be written as $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Let $f$ and $g$ be two continuous, distinct functions from $[0,1] \rightarrow (0,+\infty)$ such that $\int_{0}^{1}f(x)dx = \int_{0}^{1}g(x)dx$ Let $y_n=\int_{0}^{1}{\frac{f^{n+1}(x)}{g^{n}(x)}dx}$, for $n\geq 0$, natural. Prove that $(y_n)$ is an increasing and divergent sequence.

If $x_0=x_1=1$, and for $n\geq1$ $x_{n+1}=\frac{x_n^2}{x_{n-1}+2x_n}$, find a formula for $x_n$ as a function of $n$.

Let $S$ be the set of [b]discs[/b] $D$ contained completely in the set $\{ (x,y) : y<0\}$ (the region below the $x$-axis) and centered (at some point) on the curve $y=x^2-\frac{3}{4}$. What is the area of the union of the elements of $S$?

Given a permutation of $1,2,3,\dots,n$, with consecutive elements $a,b,c$ (in that order), we may perform either of the [i]moves[/i]: [list] [*] If $a$ is the median of $a$, $b$, and $c$, we may replace $a,b,c$ with $b,c,a$ (in that order) [*] If $c$ is the median of $a$, $b$, and $c$, we may replace $a,b,c$ with $c,a,b$ (in that order) [/list] What is the least number of sets in a partition of all $n!$ permutations, such that any two permutations in the same set are obtainable from each other by a sequence of moves? [i]Proposed by Milan Haiman[/i]

i) Show there exist (not necessarily distinct) non-negative real numbers $a_1,a_2,\ldots,a_{10}$; $b_1,b_2,\ldots,b_{10}$, with $a_k+b_k \leq 4$ for all $1\leq k \leq 10$, such that $\max\{|a_i-a_j|, |b_i-b_j|\} \geq \dfrac{4}{3} > 1$ for all $1\leq i < j \leq 10$. ii) Prove for any (not necessarily distinct) non-negative real numbers $a_1,a_2,\ldots,a_{11}$; $b_1,b_2,\ldots,b_{11}$, with $a_k+b_k \leq 4$ for all $1\leq k \leq 11$, there exist $1\leq i < j \leq 11$ such that $\max\{|a_i-a_j|, |b_i-b_j|\} \leq 1$. ([i]Dan Schwarz[/i])