Prove that a convex polyhedron all of whose faces are equilateral triangles has at most $30$ edges.

(a) A point $A$ is marked inside a sphere. Three perpendicular lines drawn through $A$ intersect the sphere at six points. Prove that the centre of gravity of these six points does not depend on the choice of such three lines. (b) An icosahedron with the centre $A$ is placed inside a sphere (its centre does not necessarily coincide with the centre of the sphere). The rays going from $A$ to the vertices of the icosahedron mark $12$ points on the sphere. Then the icosahedron is rotated about its centre. New rays mark new $12$ points on the sphere. Let $O$ and $N$ be the centres of mass of old and new points respectively. Prove that $O = N$.

The net of 20 triangles shown below can be folded to form a regular icosahedron. Inside each of the triangular faces, write a number from 1 to 20 with each number used exactly once. Any pair of numbers that are consecutive must be written on faces sharing an edge in the folded icosahedron, and additionally, 1 and 20 must also be on faces sharing an edge. Some numbers have been given to you. (No proof is necessary.) [asy] unitsize(1cm); pair c(int a, int b){return (a-b/2,sqrt(3)*b/2);} draw(c(0,0)--c(0,1)--c(-1,1)--c(1,3)--c(1,1)--c(2,2)--c(3,2)--c(4,3)--c(4,2)--c(3,1)--c(2,1)--c(2,-1)--c(1,-1)--c(1,-2)--c(0,-3)--c(0,-2)--c(-1,-2)--c(1,0)--cycle); draw(c(0,0)--c(1,1)--c(0,1)--c(1,2)--c(0,2)--c(0,1),linetype("4 4")); draw(c(4,2)--c(3,2)--c(3,1),linetype("4 4")); draw(c(3,2)--c(1,0)--c(1,1)--c(2,1)--c(2,2),linetype("4 4")); draw(c(1,-2)--c(0,-2)--c(0,-1)--c(1,-1)--c(1,0)--c(2,0)--c(0,-2),linetype("4 4")); label("2",(c(0,2)+c(1,2))/2,S); label("15",(c(1,1)+c(2,1))/2,S); label("6",(c(0,1)+c(1,1))/2,N); label("14",(c(0,0)+c(1,0))/2,N);[/asy]

Recall that a regular icosahedron is a convex polyhedron having 12 vertices and 20 faces; the faces are congruent equilateral triangles. On each face of a regular icosahedron is written a nonnegative integer such that the sum of all $20$ integers is $39.$ Show that there are two faces that share a vertex and have the same integer written on them.

Given three congruent rectangles in the space. Their centers coincide, but the planes they lie in are mutually perpendicular. For any two of the three rectangles, the line of intersection of the planes of these two rectangles contains one midparallel of one rectangle and one midparallel of the other rectangle, and these two midparallels have different lengths. Consider the convex polyhedron whose vertices are the vertices of the rectangles. [b]a.)[/b] What is the volume of this polyhedron ? [b]b.)[/b] Can this polyhedron turn out to be a regular polyhedron ? If yes, what is the condition for this polyhedron to be regular ?

A [i]regular icosahedron[/i] is a $20$-faced solid where each face is an equilateral triangle and five triangles meet at every vertex. The regular icosahedron shown below has one vertex at the top, one vertex at the bottom, an upper pentagon of five vertices all adjacent to the top vertex and all in the same horizontal plane, and a lower pentagon of five vertices all adjacent to the bottom vertex and all in another horizontal plane. Find the number of paths from the top vertex to the bottom vertex such that each part of a path goes downward or horizontally along an edge of the icosahedron, and no vertex is repeated.[asy] size(3cm); pair A=(0.05,0),B=(-.9,-0.6),C=(0,-0.45),D=(.9,-0.6),E=(.55,-0.85),F=(-0.55,-0.85),G=B-(0,1.1),H=F-(0,0.6),I=E-(0,0.6),J=D-(0,1.1),K=C-(0,1.4),L=C+K-A; draw(A--B--F--E--D--A--E--A--F--A^^B--G--F--K--G--L--J--K--E--J--D--J--L--K); draw(B--C--D--C--A--C--H--I--C--H--G--H--L--I--J--I--D^^H--B,dashed); dot(A^^B^^C^^D^^E^^F^^G^^H^^I^^J^^K^^L); [/asy]

Some edges are painted in red. We say that a coloring of this kind is [i]good[/i], if for each vertex of the polyhedron, there exists an edge which concurs in that vertex and is not painted red. Moreover, we say that a coloring where some of the edges of a regular polyhedron is [i]completely good[/i], if in addition to being [i]good[/i], no face of the polyhedron has all its edges painted red. What regular polyhedrons is equal the maximum number of edges that can be painted in a [i]good[/i] color and a [i]completely good[/i]? Explain your answer.

Let $D$ be a dodecahedron which can be inscribed in a sphere with radius $R$. Let $I$ be an icosahedron which can also be inscribed in a sphere of radius $R$. Which has the greater volume, and why? Note: A regular [i]polyhedron [/i] is a geometric solid, all of whose faces are congruent regular polygons, in which the same number of polygons meet at each vertex. A regular dodecahedron is a polyhedron with $12$ faces which are regular pentagons and a regular icosahedron is a polyhedron with $20$ faces which are equilateral triangles. A polyhedron is inscribed in a sphere if all of its vertices lie on the surface of the sphere. The illustration below shows a dodecahdron and an icosahedron, not necessarily to scale. [img]https://cdn.artofproblemsolving.com/attachments/7/5/9873b42aacf04bb5daa0fe70d4da3bf0b7be38.png[/img]

What fraction of a $5$-dimensional cube is the volume of the inscribed sphere? What fraction is it of a $10$-dimensional cube?

Given three congruent rectangles in the space. Their centers coincide, but the planes they lie in are mutually perpendicular. For any two of the three rectangles, the line of intersection of the planes of these two rectangles contains one midparallel of one rectangle and one midparallel of the other rectangle, and these two midparallels have different lengths. Consider the convex polyhedron whose vertices are the vertices of the rectangles. [b]a.)[/b] What is the volume of this polyhedron ? [b]b.)[/b] Can this polyhedron turn out to be a regular polyhedron ? If yes, what is the condition for this polyhedron to be regular ?

Twenty ants live on the faces of an icosahedron, one ant on each side, where the icosahedron have each side with length 1. Each ant moves in a counterclockwise direction on each face, along the side/edges. The speed of each ant must be no less than 1 always. Also, if two ants meet, they should meet at the vertex of the icosahedron. If five ants meet at the same time at a vertex, we call that a [i]collision[/i]. Can the ants move forever, in a way that no [i]collision[/i] occurs?

Given that $O$ is a regular octahedron, that $C$ is the cube whose vertices are the centers of the faces of $O$, and that the ratio of the volume of $O$ to that of $C$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime integers, find $m+n$.

(a) Some vertices of a dodecahedron are to be marked so that each face contains a marked vertex. What is the smallest number of marked vertices for which this is possible? (b) Answer the same question, but for an icosahedron. (G. Galperin, Moscow) (Recall that a dodecahedron has $12$ pentagonal faces which meet in threes at each vertex, while an icosahedron has $20$ triangular faces which meet in fives at each vertex.)

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.

The icosahedron is a convex, regular polyhedron consisting of $20$ equilateral triangle for faces. A particular icosahedron given to you has labels on each of its vertices, edges, and faces. Each minute, you uniformly at random pick one of the labels on the icosahedron. If the label is on a vertex, you remove it. If the label is on an edge, you delete the label on the edge along with any labels still on the vertices of that edge. If the label is on a face, you delete the label on the face along with any labels on the edges and vertices which make up that face. What is the expected number of minutes that pass before you have removed all labels from the icosahedron?

For two different regular icosahedrons it is known that some six of their vertices are vertices of a regular octahedron. Find the ratio of the edges of these icosahedrons.

Through the centre of a cube (tetrahedron, icosahedron) draw a straight line in such a way that the sum of the squares of its distances from the vertices is a) minimal, b) maximal.