Maths Olympiad Prep

Library / /158 of 520

Geometry Difficulty 5.3 AIME, harder Prove it

Prove that there is no polyhedron with exactly seven edges.

#

Solution

From each vertex of a polyhedron, at least three edges emerge.

## Solution

If a polyhedron has four vertices, then it is a tetrahedron, which has six edges. Let the number nn of vertices of the polyhedron be no less than five. At each vertex of the polyhedron, at least three faces meet, meaning that at least three edges emerge from each vertex. Therefore, the total number of edges is no less than 3n/2>73n / 2 > 7

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.