Difference between revisions of "Euler's Polyhedral Formula"
| Line 1: | Line 1: | ||
| − | Let <math>P</math> be any [[convex]] [[polyhedron]], and let <math>V</math>, <math>E</math> and <math>F</math> denote the number of [[vertex|vertices]], [[edge]]s, and [[face]]s, respectively. Then <math>V-E+F=2</math> | + | Let <math>P</math> be any [[convex]] [[polyhedron]], and let <math>V</math>, <math>E</math> and <math>F</math> denote the number of [[vertex|vertices]], [[edge]]s, and [[face]]s, respectively. Then <math>V-E+F=2</math>. |
==Observe!== | ==Observe!== | ||
Revision as of 14:53, 24 April 2020
Let 
be any convex polyhedron, and let 
, 
and 
denote the number of vertices, edges, and faces, respectively. Then 
.
Observe!
Apply Euler's Polyhedral Formula on the following polyhedra:
Problem
A convex polyhedron has for its faces 12 squares, 8 regular hexagons, and 6 regular octagons. At each vertex of the polyhedron one square, one hexagon, and one octagon meet. How many segments joining vertices of the polyhedron lie in the interior of the polyhedron rather than along an edge or a face? (1988 AIME #10)
See Also
This article is a stub. Help us out by expanding it.
