Let $x$, $y$, and $z$ be positive real numbers satisfying $x^2+y^2+z^2=1$. Prove that \[x^2yz+xy^2z+xyz^2\le\frac{1}{3}.\]

Triangle $ABC$ is inscribed in the circle $\Gamma$. Let $\Gamma_a$ denote the circle internally tangent to $\Gamma$ and also tangent to sides $AB$ and $AC$. Let $A'$ denote the point of tangency of $\Gamma$ and $\Gamma_a$. Define $B'$ and $C'$ similarly. Prove that $AA'$, $BB'$ and $CC'$ are concurrent.

An $8\times 8$ chessboard is to be tiled (i.e., completely covered without overlapping) with pieces of the following shapes: [asy][asy] unitsize(.6cm); draw(unitsquare,linewidth(1)); draw(shift(1,0)*unitsquare,linewidth(1)); draw(shift(2,0)*unitsquare,linewidth(1)); label("\footnotesize $1\times 3$ rectangle",(1.5,0),S); draw(shift(8,1)*unitsquare,linewidth(1)); draw(shift(9,1)*unitsquare,linewidth(1)); draw(shift(10,1)*unitsquare,linewidth(1)); draw(shift(9,0)*unitsquare,linewidth(1)); label("\footnotesize T-shaped tetromino",(9.5,0),S); [/asy][/asy] The $1\times 3$ rectangle covers exactly three squares of the chessboard, and the T-shaped tetromino covers exactly four squares of the chessboard. (a) What is the maximum number of pieces that can be used? (b) How many ways are there to tile the chessboard using this maximum number of pieces?

Inside right angle $XAY$, where $A$ is the vertex, is a semicircle $\Gamma$ whose center lies on $AX$ and that is tangent to $AY$ at the point $A$. Describe a ruler-and-compass construction for the tangent to $\Gamma$ such that the triangle enclosed by the tangent and angle $XAY$ has minimum area.

Let $n$ and $k$ be positive integers. Consider $n$ infinite arithmetic progressions of nonnegative integers with the property that among any $k$ consecutive nonnegative integers, at least one of $k$ integers belongs to one of the $n$ arithmetic progressions. Let $d_1,d_2,\ldots,d_n$ denote the differences of the arithmetic progressions, and let $d=\min\{d_1,d_2,\ldots,d_n\}$. In terms of $n$ and $k$, what is the maximum possible value of $d$?

Without overlapping, hexagonal tiles are placed inside an isosceles right triangle of area $1$ whose hypotenuse is horizontal. The tiles are similar to the figure below, but are not necessarily all the same size.[asy][asy] unitsize(.85cm); draw((0,0)--(1,0)--(1,1)--(2,2)--(-1,2)--(0,1)--(0,0),linewidth(1)); draw((0,2)--(0,1)--(1,1)--(1,2),dashed); label("\footnotesize $a$",(0.5,0),S); label("\footnotesize $a$",(0,0.5),W); label("\footnotesize $a$",(1,0.5),E); label("\footnotesize $a$",(0,1.5),E); label("\footnotesize $a$",(1,1.5),W); label("\footnotesize $a$",(-0.5,2),N); label("\footnotesize $a$",(0.5,2),N); label("\footnotesize $a$",(1.5,2),N); [/asy][/asy] The longest side of each tile is parallel to the hypotenuse of the triangle, and the horizontal side of length $a$ of each tile lies between this longest side of the tile and the hypotenuse of the triangle. Furthermore, if the longest side of a tile is farther from the hypotenuse than the longest side of another tile, then the size of the first tile is larger or equal to the size of the second tile. Find the smallest value of $\lambda$ such that every such configuration of tiles has a total area less than $\lambda$.