Does there exist an integer such that its cube is equal to $3n^2 +3n+7$, where $n$ is integer?

Let be given a tetrahedron whose circumcenter is $O$. Draw diameters $AA_{1},BB_{1},CC_{1},DD_{1}$ of the circumsphere of $ABCD$. Let $A_{0},B_{0},C_{0},D_{0}$ be the centroids of triangle $BCD,CDA,DAB,ABC$. Prove that $A_{0}A_{1},B_{0}B_{1},C_{0}C_{1},D_{0}D_{1}$ are concurrent at a point, say, $F$. Prove that the line through $F$ and a midpoint of a side of $ABCD$ is perpendicular to the opposite side.

Let a right cone of the base radius $r=3$ and height greater than $6$ be inscribed in a sphere of radius $R=6$. The volume of the cone can be expressed as $\pi(a\sqrt{b}+c)$, where $b$ is square free. Find $a+b+c$.

A regular icosahedron is a regular solid of $20$ faces, each in the form of an equilateral triangle, with $12$ vertices, so that each vertex is in $5$ edges. Twelve indistinguishable candies are glued to the vertices of a regular icosahedron (one at each vertex), and four of these twelve candies are special. André and Lucas want to together create a strategy for the following game: • First, André is told which are the four special sweets and he must remove exactly four sweets that are not special from the icosahedron and leave the solid on a table, leaving afterwards without communicating with Lucas. • Later, Sponchi, who wants to prevent Lucas from discovering the special sweets, can pick up the icosahedron from the table and rotate it however he wants. • After Sponchi makes his move, he leaves the room, Lucas enters and he must determine the four special candies out of the eight that remain in the icosahedron. Determine if there is a strategy for which Lucas can always properly discover the four special sweets.

We glue together $990$ one inch cubes into a $9$ by $10$ by $11$ inch rectangular solid. Then we paint the outside of the solid. How many of the original $990$ cubes have just one of their sides painted?

A square piece of paper has sides of length $ 100$. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at distance $ \sqrt {17}$ from the corner, and they meet on the diagonal at an angle of $ 60^\circ$ (see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upper edges, can be written in the form $ \sqrt [n]{m}$, where $ m$ and $ n$ are positive integers, $ m < 1000$, and $ m$ is not divisible by the $ n$th power of any prime. Find $ m \plus{} n$. [asy]import math; unitsize(5mm); defaultpen(fontsize(9pt)+Helvetica()+linewidth(0.7)); pair O=(0,0); pair A=(0,sqrt(17)); pair B=(sqrt(17),0); pair C=shift(sqrt(17),0)*(sqrt(34)*dir(75)); pair D=(xpart(C),8); pair E=(8,ypart(C)); draw(O--(0,8)); draw(O--(8,0)); draw(O--C); draw(A--C--B); draw(D--C--E); label("$\sqrt{17}$",(0,2),W); label("$\sqrt{17}$",(2,0),S); label("cut",midpoint(A--C),NNW); label("cut",midpoint(B--C),ESE); label("fold",midpoint(C--D),W); label("fold",midpoint(C--E),S); label("$30^\circ$",shift(-0.6,-0.6)*C,WSW); label("$30^\circ$",shift(-1.2,-1.2)*C,SSE);[/asy]

$8$ ants are placed on the edges of the unit cube. Prove that there exists a pair of ants at a distance not exceeding $1$.

Three cubes of volume $1, 8$ and $27$ are glued together at their faces. The smallest possible surface area of the resulting configuration is $ \textbf{(A)}\ 36 \qquad\textbf{(B)}\ 56 \qquad\textbf{(C)}\ 70 \qquad\textbf{(D)}\ 72 \qquad\textbf{(E)}\ 74 $

Let $L$ be the line of intersection of the planes $~x+y=0~$ and $~y+z=0$. [b](a)[/b] Write the vector equation of $L$, i.e. find $(a,b,c)$ and $(p,q,r)$ such that $$L=\{(a,b,c)+\lambda(p,q,r)~~\vert~\lambda\in\mathbb{R}\}$$ [b](b)[/b] Find the equation of a plane obtained by $x+y=0$ about $L$ by $45^{\circ}$.

The permutohedron of order $3$ is the hexagon determined by points $(1, 2, 3)$, $(1, 3, 2)$, $(2, 1, 3)$, $(2, 3, 1)$, $(3, 1, 2)$, and $(3, 2, 1)$. The pyramid determined by these six points and the origin has a unique inscribed sphere of maximal volume. Determine its radius.

In regular tetrahedron $ABCD$, $E,F,G$ are midpoints of $AB,BC,CD$. Dihedral angle $C-FG-E$ is equal to $\text{(A)}\arcsin\frac{\sqrt6}{3}\qquad\text{(B)}\frac{\pi}{2}+\arccos\frac{\sqrt3}{3}\qquad\text{(C)}\frac{\pi}{2}-\arctan{\sqrt2}\qquad\text{(D)}\pi-\text{arccot}\frac{\sqrt2}{2}$

Could the four centers of the circles inscribed into the faces of a tetrahedron be coplanar? (vertexes of tetrahedron not coplanar)

Determine the upper limit of the volume of spheres contained in tetrahedra of all heights not longer than $ 1 $.

(I.Bogdanov) A section of a regular tetragonal pyramid is a regular pentagon. Find the ratio of its side to the side of the base of the pyramid.

Let $ABCDE$ be a right quadrangular pyramid with vertex $E$ and height $EO$. Point $S$ divides this height in the ratio $ES: SO=m$. In which ratio does the plane $(ABC)$ divide the lateral area of the pyramid.

Let $ABCD$ be a tetrahedron and let $E,F,G,H,K,L$ be points lying on the edges $AB,BC,CD$ $,DA,DB,DC$ respectively, in such a way that \[AE \cdot BE = BF \cdot CF = CG \cdot AG= DH \cdot AH=DK \cdot BK=DL \cdot CL.\] Prove that the points $E,F,G,H,K,L$ all lie on a sphere.

$S_{1},S_{2},S_{3}$ are three spheres in $\mathbb R^{3}$ that their centers are not collinear. $k\leq8$ is the number of planes that touch three spheres. $A_{i},B_{i},C_{i}$ is the point that $i$-th plane touch the spheres $S_{1},S_{2},S_{3}$. Let $O_{i}$ be circumcenter of $A_{i}B_{i}C_{i}$. Prove that $O_{i}$ are collinear.

A truncated trigonal pyramid is circumscribed around a sphere touching its bases at points $T_1, T_2$. Let $h$ be the altitude of the pyramid, $R_1, R_2$ be the circumradii of its bases, and $O_1, O_2$ be the circumcenters of the bases. Prove that $$R_1R_2h^2 = (R_1^2-O_1T_1^2)(R_2^2-O_2T_2^2).$$

Find all non-negative real numbers $a$ such that the equation \[ \sqrt[3]{1+x}+\sqrt[3]{1-x}=a \] has at least one real solution $x$ with $0 \leq x \leq 1$. For all such $a$, what is $x$?

Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.

The base of a pyramid is a regular triangle having side of size $1$. Two of three angles at the vertex of the pyramid are right. Find the maximum value of the volume of the pyramid.

An insect lives on the surface of a regular tetrahedron with edges of length 1. It wishes to travel on the surface of the tetrahedron from the midpoint of one edge to the midpoint of the opposite edge. What is the length of the shortest such trip? (Note: Two edges of a tetrahedron are opposite if they have no common endpoint.) $ \displaystyle \textbf{(A)} \ \frac {1}{2} \sqrt {3} \qquad \textbf{(B)} \ 1 \qquad \textbf{(C)} \ \sqrt {2} \qquad \textbf{(D)} \ \frac {3}{2} \qquad \textbf{(E)} \ 2$

Consider a container of a hollow cube $ABGCDEPF$ (where $ABGC$, $DEPF$ are squares and $AD\parallel BE\parallel GP\parallel CF$). The cube is placed on a table in a way that the space diagonal $AP=1$ is perpendicular to the table. Then, water is poured into the cube. Denote $x$ the length of part of $AP$ submerged in water. Determine the volume of water $y$ in terms of $x$ when a) $0 < x \leq\frac13$, b) $\frac13 < x \leq\frac12$.

An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions: [list=] [*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.) [*]No two beams have intersecting interiors. [*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam. [/list] What is the smallest positive number of beams that can be placed to satisfy these conditions? [i]Proposed by Alex Zhai[/i]

The diagram below shows a $1\times2\times10$ duct with $2\times2\times2$ cubes attached to each end. The resulting object is empty, but the entire surface is solid sheet metal. A spider walks along the inside of the duct between the two marked corners. There are positive integers $m$ and $n$ so that the shortest path the spider could take has length $\sqrt{m}+\sqrt{n}$. Find $m + n$. [asy] size(150); defaultpen(linewidth(1)); draw(origin--(43,0)--(61,20)--(18,20)--cycle--(0,-43)--(43,-43)--(43,0)^^(43,-43)--(61,-23)--(61,20)); draw((43,-43)--(133,57)--(90,57)--extension((90,57),(0,-43),(61,20),(18,20))); draw((0,-43)--(0,-65)--(43,-65)--(43,-43)^^(43,-65)--(133,35)--(133,57)); draw((133,35)--(133,5)--(119.5,-10)--(119.5,20)^^(119.5,-10)--extension((119.5,-10),(100,-10),(43,-65),(133,35))); dot(origin^^(133,5)); [/asy]