I found this inequality in "Topics in Inequalities" (I 85) For all positive reals $x,y,z$ with $xyz=1$ prove: \[ \frac{x^9+y^9}{x^6+x^3y^3+y^6}+\frac{y^9+z^9}{y^6+y^3z^3+z^6}+\frac{z^9+x^9}{z^6+z^3x^3+x^6}\geq 2 \]

[u]Set 4[/u] [b]G10.[/b] Let $ABCD$ be a square with side length $1$. It is folded along a line $\ell$ that divides the square into two pieces with equal area. The minimum possible area of the resulting shape is $A$. Find the integer closest to $100A$. [b]G11.[/b] The $10$-digit number $\underline{1A2B3C5D6E}$ is a multiple of $99$. Find $A + B + C + D + E$. [b]G12.[/b] Let $A, B, C, D$ be four points satisfying $AB = 10$ and $AC = BC = AD = BD = CD = 6$. If $V$ is the volume of tetrahedron $ABCD$, then find $V^2$. [u]Set 5[/u] [b]G13.[/b] Nate the giant is running a $5000$ meter long race. His first step is $4$ meters, his next step is $6$ meters, and in general, each step is $2$ meters longer than the previous one. Given that his $n$th step will get him across the finish line, find $n$. [b]G14.[/b] In square $ABCD$ with side length $2$, there exists a point $E$ such that $DA = DE$. Let line $BE$ intersect side $AD$ at $F$ such that $BE = EF$. The area of $ABE$ can be expressed in the form $a -\sqrt{b}$ where $a$ is a positive integer and $b$ is a square-free integer. Find $a + b$. [b]G15.[/b] Patrick the Beetle is located at $1$ on the number line. He then makes an infinite sequence of moves where each move is either moving $1$, $2$, or $3$ units to the right. The probability that he does reach $6$ at some point in his sequence of moves is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [u]Set 6[/u] [b]G16.[/b] Find the smallest positive integer $c$ greater than $1$ for which there do not exist integers $0 \le x, y \le9$ that satisfy $2x + 3y = c$. [b]G17.[/b] Jaeyong is on the point $(0, 0)$ on the coordinate plane. If Jaeyong is on point $(x, y)$, he can either walk to $(x + 2, y)$, $(x + 1, y + 1)$, or $(x, y + 2)$. Call a walk to $(x + 1, y + 1)$ an Brilliant walk. If Jaeyong cannot have two Brilliant walks in a row, how many ways can he walk to the point $(10, 10)$? [b]G18.[/b] Deja vu? Let $ABCD$ be a square with side length $1$. It is folded along a line $\ell$ that divides the square into two pieces with equal area. The maximum possible area of the resulting shape is $B$. Find the integer closest to $100B$. PS. You should use hide for answers. Sets 1-3 have been posted [url=https://artofproblemsolving.com/community/c3h3131303p28367061]here [/url] and 7-9 [url=https://artofproblemsolving.com/community/c3h3131308p28367095]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

One integer was removed from the set $S=\left \{ 1,2,3,...,n \right \}$ of the integers from $1$ to $n$. The arithmetic mean of the other integers of $S$ is equal to $\frac{163}{4}$. What integer was removed ?

Angle $A$ of the acute-angled triangle $ABC$ equals $60^o$ . Prove that the bisector of one of the angles formed by the altitudes drawn from $B$ and $C$, passes through the circumcircle 's centre. (V . Pogrebnyak , year 12 student , Vinnitsa,)

We are given $8$ different weights and a balance without a scale. (a) Find the smallest number of weighings necessary to find the heaviest weight. (b) How many weighting is further necessary to find the second heaviest weight?

Find, with proof, the point $P$ in the interior of an acute-angled triangle $ABC$ for which $BL^2+CM^2+AN^2$ is a minimum, where $L,M,N$ are the feet of the perpendiculars from $P$ to $BC,CA,AB$ respectively. [i]Proposed by United Kingdom.[/i]

Let $ABC$ be a triangle, the circle having $BC$ as diameter cuts $AB,AC$ at $F,E$ respectively. Let $P$ a point on this circle. Let $C',B$' be the projections of $P$ upon the sides $AB,AC$ respectively. Let $H$ be the orthocenter of the triangle $AB'C'$. Show that $\angle EHF = 90^o$.

For any positive integer $n$, we define $$S_n=\sum_{k=1}^n \frac{2^k}{k^2}.$$ Prove that there are no polynomials $P,Q$ with real coefficients such that for any positive integer $n$, we have $\frac{S_{n+1}}{S_n}=\frac{P(n)}{Q(n)}$.

Determine the number of ways to partition the $n^2$ squares of an $n\times n$ grid into $n$ connected pieces of sizes $1$, $3$, $5$, $\dots$, $2n-1$ so that each piece is symmetric across the diagonal connecting the bottom right to the top left corner of the grid. A connected piece is a set of squares that any two of them are connected by a sequence of adjacent squares in the set. Two squares are adjacent if and only if they share an edge.

Find all positive integers $x$ and $y$ such that $x^{x+y}=y^{3x}$.

There are $n$ integers $a$ such that $0\leq a<91$ and $a$ is a solution to $x^3+8x^2-x+83\equiv0\pmod{91}$. What is $n$?

Let $ x,y$ are real numbers such that $x^2+2cosy=1$. Find the ranges of $x-cosy$.

Determine all functions $f:\mathbb{N}\to \mathbb{N}$ such that for all $a, b \in \mathbb{N}$ the following conditions hold: $(i)$ $f(f(a)+b) \mid b^a-1$; $(ii)$ $f(f(a))\geq f(a)-1$.

Jeffrey writes the numbers $1$ and $100000000 = 10^8$ on the blackboard. Every minute, if $x, y$ are on the board, Jeffery replaces them with \[\frac{x + y}{2} \quad \text{and} \quad 2 \left(\frac{1}{x} + \frac{1}{y}\right)^{-1}.\] After $2017$ minutes the two numbers are $a$ and $b$. Find $\min(a, b)$ to the nearest integer.

Consider the isosceles right triangle$ ABC, \angle A = 90^o$, and point $D \in (AB)$ such that $AD = \frac13 AB$. In the half-plane determined by the line $AB$ and point $C$ , consider a point $E$ such that $\angle BDE = 60^o$ and $\angle DBE = 75^o$. Lines $BC$ and $DE$ intersect at point $G$, and the line passing through point $G$ parallel to the line $AC$ intersects the line $BE$ at point $H$. Prove that the triangle $CEH$ is equilateral.

If $a, b, c$ and $d$ are complex non-zero numbers such that $$2|a-b|\leq |b|, 2|b-c|\leq |c|, 2|c-d| \leq |d| , 2|d-a|\leq |a|.$$ Prove that $$\frac{7}{2} <\left| \frac{b}{a} + \frac{c}{b} + \frac{d}{c} + \frac{a}{d} \right| .$$

Show that for $n>1$ and any positive real numbers $k,x_{1},x_{2},...,x_{n}$ then \[\frac{f(x_{1}-x_{2})}{x_{1}+x_{2}}+\frac{f(x_{2}-x_{3})}{x_{2}+x_{3}}+...+\frac{f(x_{n}-x_{1})}{x_{n}+x_{1}}\geq \frac{n^2}{2(x_{1}+x_{2}+...+x_{n})}\] Where $f(x)=k^x$. When does equality hold.

Let ${n \choose k}$ be the number of ways that $k$ objects can be chosen (regardless of order) from a set of $n$ objects. Prove that if positive integers k and l are greater than $1$ and less than $n$, then integers ${n \choose k}$ and ${n \choose l}$ have a common divisor greater than $1$.

Solve the inequality $$\sqrt{(x-2)^2(x-x^2)}<\sqrt{4x-1-(x^2-3x)^2}$$

Find the maximum number of different integers that can be selected from the set $ \{1,2,...,2013\}$ so that no two exist that their difference equals to $17$.

Let $T_k = k - 1$ for $k = 1, 2, 3,4$ and \[T_{2k-1} = T_{2k-2} + 2^{k-2}, T_{2k} = T_{2k-5} + 2^k \qquad (k \geq 3).\] Show that for all $k$, \[1 + T_{2n-1} = \left[ \frac{12}{7}2^{n-1} \right] \quad \text{and} \quad 1 + T_{2n} = \left[ \frac{17}{7}2^{n-1} \right],\] where $[x]$ denotes the greatest integer not exceeding $x.$

A teacher wishes to separate her $12$ students into groups. Yesterday, the teacher put the students into $4$ groups of $3$. Today, the teacher decides to put the students into $4$ groups of $3$ again. However, she doesn’t want any pair of students to be in the same group on both days. Find how many ways she could formthe groups today.

Determine $$\lim_{x\to\infty}\frac{\sqrt{x+2014}}{\sqrt x+\sqrt{x+2014}}$$

If $x-y>x$ and $x+y<y$, then $\text{(A)} \ y<x \qquad \text{(B)} \ x<y \qquad \text{(C)} \ x<y<0 \qquad \text{(D)} \ x<0,y<0$ $\text{(E)} \ x<0,y>0$

Two circles $k_1$ and $k_2$ with centers $O_1$ and $O_2$ are tangent to each other externally at point $O$. Points $X$ and $Y$ on $k_1$ and $k_2$ respectively are such that rays $O_1X$ and $O_2Y$ are parallel and codirectional. Prove that two tangents from $X$ to $k_2$ and two tangents from $Y$ to $k_1$ touch the same circle passing through $O$. (V. Yasinsky)