If ${a, b}$ and $c$ are positive real numbers, prove that \begin{align*} a ^ 3b ^ 6 + b ^ 3c ^ 6 + c ^ 3a ^ 6 + 3a ^ 3b ^ 3c ^ 3 &\ge{ abc \left (a ^ 3b ^ 3 + b ^ 3c ^ 3 + c ^ 3a ^ 3 \right) + a ^ 2b ^ 2c ^ 2 \left (a ^ 3 + b ^ 3 + c ^ 3 \right)}. \end{align*} [i](Montenegro).[/i]

Triangle $ABC$ has side-lengths $AB=12$, $BC=24$, and $AC=18$. The line through the incenter of $\triangle ABC$ parallel to $\overline{BC}$ intersects $\overline{AB}$ at $M$ and $\overline{AC}$ at $N$. What is the perimeter of $\triangle AMN$? $ \textbf{(A)}\ 27 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 33 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 42 $

Let $f$ be a map of the plane into itself with the property that if $d(A,B)=1$, then $d(f(A),f(B))=1$, where $d(X,Y)$ denotes the distance between points $X$ and $Y$. Prove that for any positive integer $n$, $d(A,B)=n$ implies $d(f(A),f(B))=n$.

You are given a rectangular sheet of paper and scissors. Can you cut it into a number of pieces all having the same size and shape of a polygon with five sides? What about polygon with seven sides?

Given a segment $AB$ of length $2003$ in a coordinate plane, determine the maximal number of unit squares with vertices in the lattice points whose intersection with the given segment is non-empty.

Let $a,b,$ and $c$ be real numbers such that \begin{align*} a+b+c &= 2, \text{ and} \\ a^2+b^2+c^2&= 12 \end{align*} What is the difference between the maximum and minimum possible values of $c$? $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ \frac{10}{3}\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ \frac{16}{3}\qquad\textbf{(E)}\ \frac{20}{3} $

Let $P$ be a polynomial with integer coefficients of degree $d$. For the set $A = \{ a_1, a_2, ..., a_k\}$ of positive integers we denote $S (A) = P (a_1) + P (a_2) + ... + P (a_k )$. The natural numbers $m, n$ are such that $m ^{d+ 1} | n$. Prove that the set $\{1, 2, ..., n\}$ can be subdivided into $m$ disjoint subsets $A_1, A_2, ..., A_m$ with the same number of elements such that $S (A_1) = S(A_2) = ... = S (A_m )$.

We consider two sequences of real numbers $x_{1} \geq x_{2} \geq \ldots \geq x_{n}$ and $\ y_{1} \geq y_{2} \geq \ldots \geq y_{n}.$ Let $z_{1}, z_{2}, .\ldots, z_{n}$ be a permutation of the numbers $y_{1}, y_{2}, \ldots, y_{n}.$ Prove that $\sum \limits_{i=1}^{n} ( x_{i} -\ y_{i} )^{2} \leq \sum \limits_{i=1}^{n}$ $( x_{i} - z_{i})^{2}.$

Let $P(x), Q(x)$ and $R(x)$ be polynomials satisfying the equation $2xP(x^3) + Q(-x -x^3) = (1 + x + x^2)R(x)$. Show that $x - 1$ divides $P(x) - Q(x)$.

For a positive integer n, let $w(n)$ denote the number of distinct prime divisors of n. Determine the least positive integer k such that $2^{w(n)} \leq k \sqrt[4]{n}$ for all positive integers n.

Let a binary operation $*$ on ordered pairs of integers be defined by $(a,b)*(c,d)=(a-c,b+d)$. Then, if $(3,2)*(0,0)$ and $(x,y)*(3,2)$ represent idential pairs, $x$ equals: $\textbf{(A) }-3\qquad \textbf{(B) }0\qquad \textbf{(C) }2\qquad \textbf{(D) }3\qquad \textbf{(E) }6$

Find the area of a convex octagon that is inscribed in a circle and has four consecutive sides of length $3$ and the remaining four sides of length $2$. Give the answer in the form $r+s\sqrt{t}$ with $r,s, t$ positive integers.

How many positive integers less than $2022$ contain at least one digit less than $5$ and also at least one digit greater than $4$?

Given three numbers $x, y, z$ denote the absolute values of the differences of each pair by $x_1,y_1, z_1$. From $x_1, y_1, z_1$ form in the same fashion the numbers $x_2, y_2, z_2$, etc. It is known that $x_n = x,y_n = y, z_n = z$ for some $n$. Find $y$ and $z$ if $x = 1$.

A game board consists of $64$ squares that alternate in color between black and white. The figure below shows square $P$ in the bottom and square $Q$ in the top row. A marker is placed at $P$. A [i]step[/i] consists of moving the marker onto one of the adjoining white squares in the row above. How many $7$-step paths are there from $P$ to $Q$? (The figure shows a sample path.) [asy]//diagram by SirCalcsALot size(200); int[] x = {6, 5, 4, 5, 6, 5, 6}; int[] y = {1, 2, 3, 4, 5, 6, 7}; int N = 7; for (int i = 0; i < 8; ++i) { for (int j = 0; j < 8; ++j) { draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)); if ((i+j) % 2 == 0) { filldraw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)--cycle,black); } } } for (int i = 0; i < N; ++i) { draw(circle((x[i],y[i])+(0.5,0.5),0.35)); } label("$P$", (5.5, 0.5)); label("$Q$", (6.5, 7.5)); [/asy] $\textbf{(A)}\ 28 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 35$

Let $a, b, c, d$ be fixed integers with $d$ not divisible by $5$. Assume that $m$ is an integer for which $$am3 +bm2 +cm+d$$ is divisible by $5$. Prove that there exists an integer $n$ for which $$dn3 +cn2 +bn+a$$ is also divisible by $5$.