Difference between revisions of "Diagonal"

Latest revision as of 23:37, 24 January 2015

Polygons

A diagonal of a polygon is any segment joining two vertices other than an edge.

Triangles have no diagonals, while convex quadrilaterals have two interior diagonals, and concave quadrilaterals have one interior and one exterior diagonal.

Number of diagonals

The number of diagonals of a polygon with $n$ vertices is given by $\frac{n(n-3)}{2}$ .

Proofs

Proof 1: By direct counting.

Pick any vertex $P$ of the $n$ -gon. There are $n-3$ diagonals with this point as an endpoint, one for every vertex except $P$ itself and the two vertices adjacent to $P$ (because the segments connecting $P$ to those two points give edges, not diagonals). There are $n$ vertices and for each vertex there are $n-3$ diagonals so there are $n(n-3)$ diagonals. However, when counting our diagonals, we counted each of them twice, once for each endpoint. So, we simply divide by 2 to get our final formula, $\frac{n(n-3)}{2}$ .

Proof 2: By minor trickery.

Every two vertices determine either an edge or a diagonal. Thus, there are a total of $n \choose 2$ edges and diagonals. Since there are exactly $n$ edges, this leaves ${n \choose 2} - n = \frac{n(n-1)}2 - n = \frac{n(n-3)}2$ diagonals.

Polyhedra

Polyhedra have two different kinds of diagonals, face diagonals and space diagonals. A face diagonal of a polyhedron is a diagonal of one of the faces of the polyhedron, while a space diagonal is any segment joining two vertices which is neither an edge nor a face diagonal.

For example, tetrahedra have no space or face diagonals. Octahedra have no face diagonals but have 3 space diagonals. Cubes have 12 face diagonals (2 on each face) and 4 space diagonals.

Following the same method as Proof 2 for polygons, we see that the number of edges plus the number of face diagonals plus the number of space diagonals of a polyhedron with $n$ vertices is equal to $n \choose 2$ .

2004 AIME I problem 3 is a problem related to polyhedral diagonals.

@@ Line 1: / Line 1: @@
-{{stub}}
 ==Polygons==
 A '''diagonal''' of a [[polygon]] is any segment joining two [[vertex|vertices]] other than an [[edge]].
 [[Triangle]]s have no diagonals, while [[convex polygon|convex]] [[quadrilateral]]s have two interior diagonals, and [[concave]] quadrilaterals have one interior and one exterior diagonal.
-The number of diagonals in a polygon can be determined by the formula <math>\frac{n(n-3)}{2}</math>.
-To prove this is quite simple. We have an n-gon and we choose one point. From this point, there are <math>(n-3)</math> diagonals we can make form this point; the ones we don't count are itself and the two vertices that form sides with it. There are n vertices, so for each of these there are <math>(n-3)</math> diagonals, thus, there are <math>n(n-3)</math> diagonals. However, we are not done. When counting our diagonals, we counted some twice; we used the same vertices, just backwards. (i.e. In quadrilateral ABCD, diagonals AC and CA are the same.) So, we simply divide by 2 to get our final formula, <math>\frac{n(n-3)}{2}</math>.
+=== Number of diagonals ===
+The number of diagonals of a polygon with <math>n</math> vertices is given by  <math>\frac{n(n-3)}{2}</math>.
+====Proofs====
+=====Proof 1: By direct counting.=====
+Pick any vertex <math>P</math> of the <math>n</math>-gon.  There are <math>n-3</math> diagonals with this point as an endpoint, one for every vertex except <math>P</math> itself and the two vertices adjacent to <math>P</math> (because the segments connecting <math>P</math> to those two points give edges, not diagonals).   There are <math>n</math> vertices and for each vertex there are <math>n-3</math> diagonals so there are <math>n(n-3)</math> diagonals. However, when counting our diagonals, we counted each of them twice, once for each endpoint.  So, we simply divide by 2 to get our final formula, <math>\frac{n(n-3)}{2}</math>.
+=====Proof 2: By minor trickery.=====
+Every two vertices determine either an edge or a diagonal.  Thus, there are a total of <math>n \choose 2</math> edges and diagonals.  Since there are exactly <math>n</math> edges, this leaves <math>{n \choose 2} - n = \frac{n(n-1)}2 - n = \frac{n(n-3)}2</math> diagonals.
-The number of edges plus the number of diagonals of a polygon with n vertices is equal to <math>n \choose 2</math>.
 ==Polyhedra==
 Polyhedra have two different kinds of diagonals, face diagonals and space diagonals.  A face diagonal of a [[polyhedron]] is a diagonal of one of the [[face]]s of the polyhedron, while a space diagonal is any segment joining two vertices which is neither an edge nor a face diagonal.
-[[Tetrahedron|Tetrahedra]] have no space or face diagonals.  [[Octahedron|Octahedra]] have no face diagonals but have 3 space diagonals.  [[Cube]]s have 12 face diagonals (2 on each face) and 4 space diagonals.
+For example, [[Tetrahedron|tetrahedra]] have no space or face diagonals.  [[Octahedron|Octahedra]] have no face diagonals but have 3 space diagonals.  [[Cube (geometry) | Cube]]s have 12 face diagonals (2 on each face) and 4 space diagonals.
-The number of edges plus the number of face diagonals plus the number of space diagonals of a polyhedron with n vertices is equal to <math>n \choose 2</math>.
+Following the same method as Proof 2 for polygons, we see that the number of edges plus the number of face diagonals plus the number of space diagonals of a polyhedron with <math>n</math> vertices is equal to <math>n \choose 2</math>.
+[[2004_AIME_I_Problems/Problem_3| 2004 AIME I problem 3]] is a problem related to polyhedral diagonals.
+[[Category:Geometry]]

Page

Toolbox

Search