Maths Olympiad Prep

Track / Stage 6 / 141 of 400 #1141 of 1964

Problem 1141

National Olympiad, first round
Geometry Difficulty 6.1 Prove it Serbian Mathematical Olympiad · Serbia

A convex polyhedron with at least 5 vertices is given, in each of whose vertices exactly three edges meet. Prove that it is possible to assign to each vertex of that polyhedron some rational number so that the following conditions are satisfied:
(i) at least one of the assigned numbers is equal to 2020;
(ii) for every face of the polyhedron, the product of the numbers at all vertices of that face is equal to 1.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

Let us denote c=2020c = 2020. First consider the case when there exists a face F\mathcal{F} with an even number of vertices. Then it suffices to assign to the vertices of the face F\mathcal{F} alternately the numbers cc and 1c\frac{1}{c}, and to all other vertices of the polyhedron the number 11. Indeed, the product of the numbers on the face F\mathcal{F} is equal to 11, and every other face either shares an edge with the face F\mathcal{F} (and on it the product is 11) or has

Figure 1

no common vertex with F\mathcal{F} (in that case all the numbers on it are ones).

From now on we assume that all faces have an odd number of vertices. Consider two disjoint faces of the polyhedron FA\mathcal{F}_A and FB\mathcal{F}_B and vertices AA and BB on them, respectively, such that ABAB is an edge of the polyhedron. To the vertices of these two faces, except AA and BB, we will assign alternately the numbers cc and 1c\frac{1}{c} as in the figure, and to all other vertices of the polyhedron the number 11. In this case too it is easy to see that the condition of the problem is satisfied.

Finally, let us verify that such faces FA\mathcal{F}_A and FB\mathcal{F}_B can always be found. There exists a face F\mathcal{F} that is not a triangle (otherwise the given polyhedron would be a tetrahedron). Consider four

Figure 2

consecutive faces adjacent to it F1,F2,F3\mathcal{F}_1, \mathcal{F}_2, \mathcal{F}_3 and F4\mathcal{F}_4. If the faces F1\mathcal{F}_1 and F3\mathcal{F}_3 are disjoint, take these two, and if they are not, then they have a whole common edge, so the three faces F1,F3\mathcal{F}_1, \mathcal{F}_3 and F\mathcal{F} form a belt that separates F2\mathcal{F}_2 from F4\mathcal{F}_4, and in that case we can take F2\mathcal{F}_2 and F4\mathcal{F}_4.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from sr; metadata (topic, difficulty, ordering) added by this project.