Let $n$ be a positive integer. David has six $n\times n$ chessboards which he arranges in an $n\times n\times n$ cube. Two cells are "aligned" if they can be connected by a path of cells $a=c_1,\ c_2,\ \dots,\ c_m=b$ such that all consecutive cells in the path share a side, and the sides that the cell $c_i$ shares with its neighbors are on opposite sides of the square for $i=2,\ 3,\ \dots\ m-1$. Two towers attack each other if the cells they occupy are aligned. What is the maximum amount of towers he can place on the board such that no two towers attack each other?

A particle moves in $3$-space according to the equations: $$ \frac{dx}{dt} =yz,\; \frac{dy}{dt} =xz,\; \frac{dz}{dt}= xy.$$ Show that: (a) If two of $x(0), y(0), z(0)$ equal $0,$ then the particle never moves. (b) If $x(0)=y(0)=1, z(0)=0,$ then the solution is $$ x(t)= \sec t ,\; y(t) =\sec t ,\; z(t)= \tan t;$$ whereas if $x(0)=y(0)=1, z(0)=-1,$ then $$ x(t) =\frac{1}{t+1} ,\; y(t)=\frac{1}{t+1}, z(t)=- \frac{1}{t+1}.$$ (c) If at least two of the values $x(0), y(0), z(0)$ are different from zero, then either the particle moves to infinity at some finite time in the future, or it came from infinity at some finite time in the past (a point $(x, y, z)$ in $3$-space "moves to infinity" if its distance from the origin approaches infinity).

For which greatest $n$ there exists a convex polyhedron with $n$ faces having the following property: for each face there exists a point outside the polyhedron such that the remaining $n - 1$ faces are seen from this point?

Petya drew a pentagon $ABCDE$ on the plane. After that, Vasya marked all the points $S$ in a given half-space relative to the plane of the pentagon so that in the pyramid $SABCD$ exactly two side faces are perpendicular to the plane of the base $ABCD$, and the height is $1$. How many points could have Vasya?

A [i]tanned vector[/i] is a nonzero vector in $\mathbb R^3$ with integer entries. Prove that any tanned vector of length at most $2021$ is perpendicular to a tanned vector of length at most $100$. [i]Proposed by Ethan Tan[/i]