The four bottom corners of a cube are colored red, green, blue, and purple. How many ways are there to color the top four corners of the cube so that every face has four different colored corners? Prove that your answer is correct.

Prove that every cube's cross-section, containing its centre, has the area not less then its face's area.

An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.

A cube of edge length $3$ consists of $27$ unit cubes. Find the number of lines passing through exactly three centers of these $27$ cubes, as well as the number of those passing through exactly two such centers.

In a cube $ABCDA'B'C'D' $two points are considered, $M \in (CD')$ and $N \in (DA')$. Show that the $MN$ is common perpendicular to the lines $CD'$ and $DA'$ if and only if $$\frac{D'M}{D'C}=\frac{DN}{DA'} =\frac{1}{3}.$$

The centers of the faces of a cube form a regular octahedron of volume $V$. Through each vertex of the cube we may take the plane perpendicular to the long diagonal from the vertex. These planes also form a regular octahedron. Show that its volume is $27V$.

Which regular polygon can be obtained (and how) by cutting a cube with a plane ?

Can one place positive integers at all vertices of a cube in such a way that for every pair of numbers connected by an edge, one will be divisible by the other , and there are no other pairs of numbers with this property? (A Shapovalov)

Consider the $8\times 8\times 8$ Rubik’s cube below. Each face is painted with a different color, and it is possible to turn any layer, as you can with smaller Rubik’s cubes. Let $X$ denote the move that turns the shaded layer shown (indicated by arrows going from the top to the right of the cube) clockwise by $90$ degrees, about the axis labeled $X$. When move $X$ is performed, the only layer that moves is the shaded layer. Likewise, define move $Y$ to be a clockwise $90$-degree turn about the axis labeled Y, of just the shaded layer shown (indicated by the arrows going from the front to the top, where the front is the side pierced by the $X$ rotation axis). Let $M$ denote the move “perform $X$, then perform $Y$.” [img]https://cdn.artofproblemsolving.com/attachments/e/f/951ea75a3dbbf0ca23c45cd8da372595c2de48.png[/img] Imagine that the cube starts out in “solved” form (so each face has just one color), and we start doing move $M$ repeatedly. What is the least number of repeats of $M$ in order for the cube to be restored to its original colors?

Segment $AB$ on the surface of the cube is the shortest polyline on the surface that connects $A$ and $B$. Triangle $ABC$ consisted of such segments $AB, BC,CA$. What may be the sum of angles of such triangle if none of the vertex is on the edge of the cube ?

Consider the cube $ABCDA'B'C'D'$ (with face $ABCD$ directly above face $A'B'C'D'$). a) Find the locus of the midpoints of the segments $XY$, where $X$ is any point of $AC$ and $Y$ is any piont of $B'D'$; b) Find the locus of points $Z$ which lie on the segment $XY$ of part a) with $ZY=2XZ$.

A polygonal line connects two opposite vertices of a cube with side $2$. Each segment of the line has length $3$ and each vertex lies on the faces (or edges) of the cube. What is the smallest number of segments the line can have?

Prove that we can put in any arbitrary triangle with sidelengths $a,b,c$ such that $0\le a,b,c \le \sqrt2$ into a unit cube.

The planet Caramelo is a cube with a $1$ km edge. This planet is going to be wrapped with foam anti-gluttons in order to prevent the presence of greedy ships less than $500$ meters from the planet. What the minimum volume of foam that must surround the planet?

Given a rectangular strip of measure $12 \times 1$. Paste this strip in two layers over the cube with edge $1$ (the strip can be bent, but cannot be cut). (V. Shevyakov)