# Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Save this PDF as:

Size: px
Start display at page:

Download "Topological Treatment of Platonic, Archimedean, and Related Polyhedra"

## Transcription

1 Forum Geometricorum Volume 15 (015) FORUM GEOM ISSN Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic and Archimedean polyhedra and generalizations are treated in a unified manner by a method that focuses on topological properties of networks on a sphere rather than metric properties regarding lengths of edges or measurement of angles. This approach reveals new insights into the structure of these polyhedra. 1. Introduction and terminology A Google search reveals that a large literature exists on five Platonic and thirteen Archimedean polyhedra. They are usually studied with the aid of Euler s classical formula V + F = E +, (1) relating the number E of edges, the number F of faces, and the number V of vertices of any convex polyhedron, together with metric properties of regular polygonal planar faces. We treat Platonic and Archimedean polyhedra and their generalizations by a method that focuses on topological properties of networks rather than metric properties regarding lengths of edges or measurement of angles General networks. Consider V distinct points on the surface of a topological sphere, where V. These are called vertices. Anedge is any simple curve on the sphere joining two distinct vertices as end points and having no other vertices on it. A V -network is any configuration of nonintersecting edges joining V vertices. A face is a region on the sphere bounded by edges and vertices that contains no edges or vertices in its interior. We denote by E the number of edges, and by F the number of faces in the network. When V =, a network can be formed by joining the two vertices by one curve, in which case E = F =1. But the two vertices can also be joined by any number E of nonintersecting curves to form arbitrarily many networks with E = F. 1.. Triangular networks. When each face is topologically equivalent to a triangle, as in the examples in Figure 1, the network is called a triangular network. Figure 1a shows a triangular network with 3 vertices, 3 edges, and faces. The examples in Figures 1b and 1c have 4 vertices, 6 edges, and 4 faces. Publication Date: October 8, 015. Communicating Editor: Paul Yiu.

2 44 T. M. Apostol and M. A. Mnatsakanian (a) (b) (c) Figure 1. Triangular network with V =3in (a) and with V =4in (b) and (c).. Basic counting lemma for triangular networks In a general network with V =, Euler s formula (1) implies that the number F of faces is always equal to the number E of edges, which can be arbitrary. Our first principal result is a Counting Lemma that gives explicit formulas expressing E and F in terms of V in any triangular network. The Counting Lemma can also be used to prove Euler s formula in a general network, and yields information for triangular networks not obtainable from Euler s formula alone. Therefore the Counting Lemma is a deeper result than Euler s formula. Lemma 1 (Counting Lemma). In any triangular network with V 3, the number of edges is E =3V 6, and the number of faces is F =V 4. Proof. We shall prove both formulas by induction on V. When V =3, we label the vertices as 1,, 3 as in Figure 1a. The number of edges joining them is 3, and the number of faces is, so 3V 6 =3and V 4 =when V =3, which agrees with the lemma. Now consider four vertices 1,, 3, 4. The first 3 are vertices of a triangle. Vertex 4 is either inside this triangle, as in Figure 1b, or outside as in Figure 1c, because it cannot be on one of its edges. Three edges are required to join vertex 4 to the other three vertices, giving a total of 6 edges and 4 faces, so 3V 6=6and V 4=4when V =4, which agrees with the lemma. Now assume the lemma is true for some fixed number of vertices k 3 and consider a (k +1)-triangular network joining vertices labeled 1,,..., k +1.Ifwe remove vertex k +1we are left with a new k-network that is no longer triangular. In the original (k +1)-network, vertex k +1was connected to a certain number of vertices, say p, where p 3, so the new k-network has p fewer edges than the (k +1)-triangular network. However, this new network can be triangulated by adding p 3 diagonal edges from one vertex to p 3 vertices. This new triangulated network has k vertices so, by the induction hypothesis it has 3k 6 edges and k 4 faces, which gives three less than the number of edges and two less than the number of faces in the original (k +1)-triangular network. So these latter numbers are (3k 6) + 3 = 3(k +1) 6, and (k 4) + = (k +1) 4, as required. This completes the proof by induction. For any triangular network, the Counting Lemma gives V +F =3V 4 =E+, which is Euler s theorem in (1). But it is well known (see [1, p. 39]) that if Euler s

3 Topological treatment of Platonic, Archimedean, and related polyhedra 45 formula holds for a triangular network then it also holds for a general network. Therefore, the Counting Lemma implies Euler s theorem for a general network. The formula E =3V 6 is known (see [3, p. 40], where it is deduced from Euler s formula and the handshake lemma ). Our analysis yields both E =3V 6 and the companion result F =V 4 without invoking Euler s formula..1. Triangulated networks realized as polyhedra inscribed in a convex sphere. Given a triangulated network with V 3, we can replace each edge by a line segment to form a configuration in 3-space that we call a triangulated polyhedron, inscribed in a convex sphere. When V =3the configuration consists of a triangle with its vertices on the sphere. The Counting Lemma gives E =3and F =, and we regard this as a degenerate triangular prism of altitude zero, with two overlapping triangular faces. When V =4, the Counting Lemma gives F =4and E =6; the triangulated polyhedron becomes a tetrahedron (inscribed in a sphere) with four triangular faces and six edges, as suggested by Figures 1b and 1c. When V =6, the Counting Lemma gives F =8and E =1; the polyhedron can be realized as an octahedron, with eight triangular faces and twelve edges. When V =1, the Counting Lemma gives F =0and E =30; the polyhedron can be realized as an icosahedron, with twenty triangular faces and thirty edges. The tetrahedron, octahedron and icosahedron are three of the classical Platonic solids. The degenerate prism is not counted among the Platonic solids... Application to triangulated Platonic networks. In any network, each edge connects two vertices. We divide each edge into two pieces, that we call branches, with one endpoint of each branch being a vertex of the network. By the Counting Lemma, every V -triangular network contains 6V 1 branches. We define a triangulated Platonic network to be any triangulated network having the same number of branches at each vertex. Let s find those values of V for which triangulated Platonic networks exist. In such a network, the total number of branches is 6V 1, so the number of branches at each vertex is(6v 1)/V = 6 1/V. Hence a triangulated Platonic network exists if, and only if, the ratio 1/V is an integer less than 6. Thus V must be a divisor of 1, so the possible values of V 3 are 3, 4, 6, and 1. In other words, there are exactly four triangulated Platonic networks. They can be realized as polyhedra inscribed in a convex sphere. These are the degenerate triangular prism with faces, and the three Platonic solids mentioned earlier: tetrahedron, octahedron, and icosahedron, with respective number of faces 4, 8, and 0. The cube, with 8 vertices, 1 edges, and 6 faces is also called a Platonic polyhedron, but it is not triangulated because its faces are squares. Another Platonic polyhedron, not triangulated, is the dodecahedron, with 1 pentagonal faces, 30 edges, and 0 vertices. The cube and dodecahedron will be treated in the next section.

4 46 T. M. Apostol and M. A. Mnatsakanian 3. General uniform networks A general uniform network is one in which there may be two or more different types of polygonal faces around each vertex, say n 3 triangles, n 4 quadrilaterals, n 5 pentagons, etc. The term uniform means that the same configuration occurs at each vertex. The number of polygonal faces around each vertex is n 3 + n 4 + n 5 +. Thus if there are e branches meeting at each vertex we have e = n 3 + n 4 + n 5 +. () Because e branches meet at each vertex, the number E of edges is given by E = e V. (3) Solve for F in Euler s theorem (1) and use (3) to obtain F = e V +. (4) This basic relation holds in every general uniform network. We call the network Platonic if only one of the n k is nonzero. For example, if n 3 is the only nonzero n k the network is a triangulated Platonic network, all of which we have found earlier. Next we determine all general uniform Platonic networks. Note that our definition of Platonic makes no reference to lengths of edges or regularity of faces k-gonal Platonic networks. Assume that each face in a Platonic network is a k-gon, where k 3. Each face has k edges, and each edge belongs to two faces, hence the total number of edges E is k/ times F, the number of faces, so using (3) we have: F = k E = e V. (5) k Using this in (4) and solving for V we obtain 4k V = k + e( k). (6) This is an explicit formula for the number V of vertices in a k-gonal Platonic network in which e branches meet at each vertex. By letting k take successive values 3, 4, 5,... we can determine all uniform Platonic networks. For example, when k =3, (6) becomes V =1/(6 e), hence 6 e must be a divisor of 1. The possible values of e are 3, 4, and 5, which yield, respectively, V =4, V =6, and V =1. The corresponding regular polyhedra are the tetrahedron, octahedron, and icosahedron, found earlier as triangulated polyhedra. When k =4, (6) gives V =8/(4 e), which becomes V =8when e =3. The corresponding regular polyhedron is the cube. When k =5, (6) gives V =0/(10 3e), which becomes V =0when e =3. The corresponding polyhedron is the dodecahedron. When k =6, (6) gives V =6/(3 e). The smallest value of e is 3, which gives an infinite number of vertices. This is not a network, but is equivalent to a hexagonal tiling of the plane.

5 Topological treatment of Platonic, Archimedean, and related polyhedra Heptagonal networks and beyond. For a heptagonal network we have k =7, and (6) becomes V = 8/(14 5e), a negative number if e 3, so no such network exists. Generally, no network exists in which every face is k-gonal with k 7. Thus, without using metric properties regarding lengths of edges or measurement of angles, we have shown that there are exactly five nondegenerate Platonic polyhedra: three triangulated, the tetrahedron, octahedron, and icosahedron, illustrated in Figure as networks in (a), (c), and (e), and two nontriangulated, the cube and dodecahedron, shown as networks in (b)and (d). (a) tetrahedron (b) cube (c) octahedron (d) dodecahedron (e) icosahedron Figure. Five Platonic networks, corresponding to tetrahedron (V =4), cube (V =8), octahedron (V =6), dodecahedron (V =0), and icosahedron (V =1) Archimedean networks. We shall define an Archimedean network to be a uniform network in which two or more types of polygons meet at each vertex with the same orientation. In other words, all vertices have topologically equivalent configurations of edges and faces. We shall list various examples of such networks by referring to the basic relation (4) Prismatic Archimedean networks and their antiprisms. These are special configurations that can be realized as prismatic polyhedrons as shown in the top row of Figure 3. Below them are solids called antiprisms. In the first example, e =at Figure 3. Examples of solids formed from prismatic Archimedean networks. Directly below them are antiprisms with V +faces. each vertex of the (degenerate) prism, while e =3at each vertex of its antiprism (a tetrahedron). In the remaining examples, e =3, with one k-gon and two quadrilaterals meeting at each vertex. This can be realized as a prismatic polyhedron inscribed in a convex sphere, with two k-gonal bases and k lateral quadrilateral

6 48 T. M. Apostol and M. A. Mnatsakanian faces. So F =+k and (4) becomes V =k, an even number. Since k can take any positive integer value, there are infinitely many such polyhedra. In these examples, each prismatic solid has V/ lateral quadrilateral faces; the antiprism below it has V lateral triangular faces, making a total of V +faces for the antiprism, with e =4at each vertex. Thus, each prismatic Archimedean network can be realized as a solid with an even number V of vertices and V/ lateral quadrilateral faces. For such a prismatic solid, there is always an antiprism with V vertices, V lateral triangular faces and two congruent polygonal bases, for a total of V +faces Duals to triangulated networks. Given a general network with V vertices, E edges, and F faces, we can form a dual network by choosing a point interior to each face of the given network and using it as a vertex of the dual network. The dual network now contains F vertices. For example, the network in Figure 1a has faces, so its dual has two vertices that can be connected by three edges to form a nontriangular network with 3 faces. The dual of that network, in turn, has 3 vertices and is topologically equivalent to the original triangular network in Figure 1a. The triangular networks in Figures 1b and 1c are duals of one another. The duals of Archimedean solids are called Catalan solids. When we take e =3in (4) we find V =F 4. (7) Comparing this with the formula F =V 4 in the fundamental counting lemma for triangular networks, we see that F and V have been interchanged, so the network obtained by taking e =3in (4) is the dual of a triangulated network. In particular, the dual of a prismatic Archimedean network is a triangular network. For example, the dual of a prismatic polyhedron with two k-gonal bases and k rectangular faces is formed by taking a pyramid with a k-gonal base and k triangular faces and joining it to its mirror image along the common base. The dual has k triangular faces and +k vertices. When k =3this is a hexahedron formed by joining two tetrahedra along their common base. When k =4this is an octahedron formed by joining two square-based pyramids along their common base. Thus, we have determined all Archimedean networks with e =3. They are duals of triangular networks. They correspond to the following values in (): n k =1,n 4 =, k =3, 4,... (A family of prismatic networks not considered by Archimedes.) The following networks yield 7 of the polyhedra considered by Archimedes. n 3 =1,n 6 =, n 3 =1,n 8 =, n 3 =1,n 10 =, n 4 =1,n 6 =, n 5 =1,n 6 =, n 4 =1,n 6 =1,n 8 =1, n 4 =1,n 6 =1,n 10 =1.

7 Topological treatment of Platonic, Archimedean, and related polyhedra Archimedean networks with e =4. When e =4, (3) and (4) become E =V and F = V +. The smallest V that yields a network is V =6with E =1and F =8. The corresponding polyhedra are the octahedron with 8 triangular faces, and the antiprism with two triangular bases. The Archimedean networks with e =4correspond to the following values in (), which include 4 of the polyhedra considered by Archimedes: n 3 =1,n 4 =3; n 3 =,n 4 =; n 3 =,n 5 =; n 3 =1,n 4 =,n 5 =1; There are actually two polyhedra corresponding to n 3 =1,n 4 =3, only one of which was considered by Archimedes. This Archimedean solid, shown in Figure 4a, consists of three parts: two congruent caps shown in Figure 4b, together with (a) (b) (c) (d) Figure 4. (a) Archimedean solid consisting of three parts. (b) Top and bottom caps of (a). (c) Top cap rotated 45 degrees. (d) Fourteenth Archimedean solid. an intermediate zone consisting of eight adjacent squares joining the outer edges of the two caps. If one cap, say the top, is rotated by 45 degrees as indicated in Figure 4c, we obtain a new solid with n 3 =1,n 4 =3, shown in Figure 4d. This new solid, sometimes called the fourteenth Archimedean solid, was apparently known to Kepler, and independently rediscovered by Sommerfeld, Miller, and Ashkinuze. Specific references are given in []. Figure 5 shows the networks corresponding to the two solids in Figure 4a and 4d. (a) (b) Figure 5. Networks: (a) Archimedean solid in Figure 4a; (b) Modified solid in Figure 4d.

8 50 T. M. Apostol and M. A. Mnatsakanian We also have a family of antiprisms (not considered by Archimedes) corresponding to the following values in (): n 3 =,n k =,k =3, 4, Archimedean networks with e =5. When e =5, (3) and (4) becomes E = 5V/ and F =3V/+. Networks exist when V =4with E =60and F =38, and when V =60with E = 150 and F =9. It can be shown that there are no Archimedean networks with e>5, so those listed above form a complete list. They include the 13 solids considered by Archimedes, the additional one in Figure 4d, and two infinite families of prisms and antiprisms not treated by Archimedes. 4. Summary of results 4.1. Triangular networks. A triangular network is one in which each face is topologically equivalent to a triangle. Counting Lemma. In any triangular network with V 3, the number of edges is E =3V 6, and the number of faces is F =V 4. A triangulated Platonic network is any triangulated network having the same number of branches at each vertex. There are exactly four triangulated Platonic networks. When realized as polyhedra, they are the degenerate triangular prism with faces, and the three Platonic solids, tetrahedron, octahedron, and icosahedron. 4.. General uniform networks. In a general uniform network there are at least two types of faces around each vertex, say n 3 triangles, n 4 quadrilaterals, n 5 pentagons, etc. If e branches meet at each vertex, then e = n 3 + n 4 + n 5 +, and F is related to V by Equation (4): F = e V +. We call the network Platonic if only one of the n k is nonzero k-gonal Platonic networks. When each face in a Platonic network is a k-gon, where k 3, the number of vertices is given by Eq. (6): V = 4k, k =3, 4, 5,... k + e( k) When k =3, the possible values of e are 3, 4, 5, and the corresponding regular polyhedra are the tetrahedron, octahedron, and icosahedron, found earlier as triangulated polyhedra. When e =3, the corresponding regular polyhedron is the cube if k =4, and the dodecahedron if k =5.Ifk =6, the value e =3gives an infinite number of vertices. This is not a network, but is equivalent to a hexagonal tiling of the plane.

9 Topological treatment of Platonic, Archimedean, and related polyhedra Archimedean networks. We define an Archimedean network to be a uniform network in which two or more types of polygons meet at each vertex with the same orientation. Various examples of such networks are obtained from relation (4). When e =3, (4) becomes V =F Prismatic Archimedean networks and their antiprisms. The special configuration in which e =3, with one k-gon and two quadrilaterals meeting at each vertex can be realized as a prismatic polyhedron inscribed in a convex sphere, with two k- gonal bases and k rectangular faces. So F =+k and (4) becomes V =k, giving infinitely many such polyhedra. When k =4and the rectangular faces are squares, the corresponding prismatic polyhedron is a cube. Each prismatic Archimedean polyhedron has an even number V of vertices and V/ rectangular faces. For each such solid, there is an antiprism with V vertices, V lateral triangular faces and two congruent polygonal bases, for a total of V +faces Dual networks. Given a general network with V vertices, E edges, and F faces, the dual network has F and V interchanged. The dual of a prismatic Archimedean network is a triangular network. We have determined all Archimedean networks with e =3. Relation (4) shows they are duals of triangular networks. References [1] R. Courant and H. Robbins, What is Mathematics?, nd Edition, revised by I. Stewart, Oxford University Press, New York, Oxford, [] B. Grunbaum, An enduring error, Elemente der Mathematik, 64 (009) [3] R. A. Wilson, Graphs, Colouring and the Four-Color Theorem, Oxford University Press, New York,Oxford, 00. Tom M. Apostol: California Institute of Technology, Caltech, Pasadena, California 9115 USA address: Mamikon A. Mnatsakanian: California Institute of Technology, Caltech, Pasadena, California 9115 USA address:

### CK-12 Geometry: Exploring Solids

CK-12 Geometry: Exploring Solids Learning Objectives Identify different types of solids and their parts. Use Euler s formula to solve problems. Draw and identify different views of solids. Draw and identify

### Undergraduate Research Opportunity Programme in Science

Undergraduate Research Opportunity Programme in Science Polyhedra Name: Kavitha d/o Krishnan Supervisor: Associate Professor Helmer Aslaksen Department of Mathematics National University of Singapore 2001/2002

### Polyhedra: Plato, Archimedes, Euler

Polyhedra: Plato, Archimedes, Euler Robert L. Benedetto Amherst College MathPath at Mount Holyoke College Tuesday, July 15, 2014 Regular Polygons Definition A polygon is a planar region R bounded by a

### 3D shapes. Level A. 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite. 2. What is another name for 3-D shapes?

Level A 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite 2. What is another name for 3-D shapes? A) Polygon B) Polyhedron C) Point 3. A 3-D shape has four sides and a triangular

### Construction and Properties of the Icosahedron

Course Project (Introduction to Reflection Groups) Construction and Properties of the Icosahedron Shreejit Bandyopadhyay April 19, 2013 Abstract The icosahedron is one of the most important platonic solids

### Nets of a cube puzzle

Nets of a cube puzzle Here are all eleven different nets for a cube, together with four that cannot be folded to make a cube. Can you find the four impostors? Pyramids Here is a square-based pyramid. A

### Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?

### Notes on polyhedra and 3-dimensional geometry

Notes on polyhedra and 3-dimensional geometry Judith Roitman / Jeremy Martin April 23, 2013 1 Polyhedra Three-dimensional geometry is a very rich field; this is just a little taste of it. Our main protagonist

### 11. A polyhedron is said to be concave if at least one angle between any of its two edges is a reflex angle.

BOOK 8 ( CBSE / Chap10 /Visualizing Solid Shapes Chapter Facts. 1. A plane figure has two dimensions (2 D and a solid figure has three dimensions ( 3 D. 2. Some solid shapes consist of one figure embedded

### Shape Dictionary YR to Y6

Shape Dictionary YR to Y6 Guidance Notes The terms in this dictionary are taken from the booklet Mathematical Vocabulary produced by the National Numeracy Strategy. Children need to understand and use

### of Nebraska - Lincoln

University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-2008 Archimedean Solids Anna Anderson University

### Star and convex regular polyhedra by Origami.

Star and convex regular polyhedra by Origami. Build polyhedra by Origami.] Marcel Morales Alice Morales 2009 E D I T I O N M O R A L E S Polyhedron by Origami I) Table of convex regular Polyhedra... 4

### SOLIDS, NETS, AND CROSS SECTIONS

SOLIDS, NETS, AND CROSS SECTIONS Polyhedra In this section, we will examine various three-dimensional figures, known as solids. We begin with a discussion of polyhedra. Polyhedron A polyhedron is a three-dimensional

### 56 questions (multiple choice, check all that apply, and fill in the blank) The exam is worth 224 points.

6.1.1 Review: Semester Review Study Sheet Geometry Core Sem 2 (S2495808) Semester Exam Preparation Look back at the unit quizzes and diagnostics. Use the unit quizzes and diagnostics to determine which

### Geometry Vocabulary Booklet

Geometry Vocabulary Booklet Geometry Vocabulary Word Everyday Expression Example Acute An angle less than 90 degrees. Adjacent Lying next to each other. Array Numbers, letter or shapes arranged in a rectangular

### Junior Math Circles March 10, D Geometry II

1 University of Waterloo Faculty of Mathematics Junior Math Circles March 10, 2010 3D Geometry II Centre for Education in Mathematics and Computing Opening Problem Three tennis ball are packed in a cylinder.

### Session 9 Solids. congruent regular polygon vertex. cross section edge face net Platonic solid polyhedron

Key Terms for This Session Session 9 Solids Previously Introduced congruent regular polygon vertex New in This Session cross section edge face net Platonic solid polyhedron Introduction In this session,

### 7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

### Name Date Period. 3D Geometry Project

Name 3D Geometry Project Part I: Exploring Three-Dimensional Shapes In the first part of this WebQuest, you will be exploring what three-dimensional (3D) objects are, how to classify them, and several

### Teaching and Learning 3-D Geometry

This publication is designed to support and enthuse primary trainees in Initial Teacher Training. It will provide them with the mathematical subject and pedagogic knowledge required to teach 3-D geometry

### Angles that are between parallel lines, but on opposite sides of a transversal.

GLOSSARY Appendix A Appendix A: Glossary Acute Angle An angle that measures less than 90. Acute Triangle Alternate Angles A triangle that has three acute angles. Angles that are between parallel lines,

### Euler s Theorem. Tom Davis July 14, 2009

Euler s Theorem Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles July 14, 2009 Abstract Euler s theorem is a nice result that is easy to investigate with simple models from Euclidean

### Written by Bob Ansell

Written by Bob Ansell Contact Details Polydron Site E, Lakeside Business Park Broadway Lane South Cerney Cirencester Gloucestershire GL7 5XL Tel: +44 (0)1285 863980 Email: headoffice@polydron.com This

### Begin recognition in EYFS Age related expectation at Y1 (secure use of language)

For more information - http://www.mathsisfun.com/geometry Begin recognition in EYFS Age related expectation at Y1 (secure use of language) shape, flat, curved, straight, round, hollow, solid, vertexvertices

### Geometry Chapter 1 Vocabulary. coordinate - The real number that corresponds to a point on a line.

Chapter 1 Vocabulary coordinate - The real number that corresponds to a point on a line. point - Has no dimension. It is usually represented by a small dot. bisect - To divide into two congruent parts.

### ON POLYGONS AND POLYHEDRA. 1. Introduction

THE TEACHING OF MATHEMATICS 2005, Vol. VIII, 1, pp. 1 14 ON POLYGONS AND POLYHEDRA Siniša T. Vrećica Abstract. This paper is written for those Gymnasium students with an intensive interest in mathematics

### HOMEWORK #3 SOLUTIONS - MATH 3260

HOMEWORK #3 SOLUTIONS - MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not

### BASIC GEOMETRY GLOSSARY

BASIC GEOMETRY GLOSSARY Acute angle An angle that measures between 0 and 90. Examples: Acute triangle A triangle in which each angle is an acute angle. Adjacent angles Two angles next to each other that

### Angle - a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees

Angle - a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees Apex in a pyramid or cone, the vertex opposite the base; in

### Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 20, no. 1, pp. 101 114 (2016) DOI: 10.7155/jgaa.0086 Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid Yoshiaki Araki

### Solutions to Problems for Mathematics 2.5 DV Date: April 14,

Solutions to Problems for Mathematics 25 DV Date: April 14, 2010 1 Solution to Problem 1 The equation is 75 = 12 6 + 3 Solution to Problem 2 The remainder is 1 This is because 11 evenly divides the first

### (a) 5 square units. (b) 12 square units. (c) 5 3 square units. 3 square units. (d) 6. (e) 16 square units

1. Find the area of parallelogram ACD shown below if the measures of segments A, C, and DE are 6 units, 2 units, and 1 unit respectively and AED is a right angle. (a) 5 square units (b) 12 square units

### Su.a Supported: Identify Determine if polygons. polygons with all sides have all sides and. and angles equal angles equal (regular)

MA.912.G.2 Geometry: Standard 2: Polygons - Students identify and describe polygons (triangles, quadrilaterals, pentagons, hexagons, etc.), using terms such as regular, convex, and concave. They find measures

### Actually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.

1: 1. Compute a random 4-dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3-dimensional polytopes do you see? How many

### Most classrooms are built in the shape of a rectangular prism. You will probably find yourself inside a polyhedron at school!

3 D OBJECTS Properties of 3 D Objects A 3 Dimensional object (3 D) is a solid object that has 3 dimensions, i.e. length, width and height. They take up space. For example, a box has three dimensions, i.e.

### Geometrical symmetry and the fine structure of regular polyhedra

Geometrical symmetry and the fine structure of regular polyhedra Bill Casselman Department of Mathematics University of B.C. cass@math.ubc.ca We shall be concerned with geometrical figures with a high

### 10.4 Surface Area of Prisms, Cylinders, Pyramids, Cones, and Spheres. 10.4 Day 1 Warm-up

10.4 Surface Area of Prisms, Cylinders, Pyramids, Cones, and Spheres 10.4 Day 1 Warm-up 1. Which identifies the figure? A rectangular pyramid B rectangular prism C cube D square pyramid 3. A polyhedron

### Teachers should read through the following activity ideas and make their own risk assessment for them before proceeding with them in the classroom.

Platonic solids investigation Teacher notes Teachers should read through the following activity ideas and make their own risk assessment for them before proceeding with them in the classroom. Platonic

### UNIT PLAN. Big Idea/Theme: Shapes can be analyzed, described, and related to our physical world.

UNIT PLAN Grade Level: 2 Unit #: 5 Unit Name: Geometry Big Idea/Theme: Shapes can be analyzed, described, and related to our physical world. Culminating Assessment: Use real world objects from home, create

### Surface Area and Volume Nets to Prisms

Surface Area and Volume Nets to Prisms Michael Fauteux Rosamaria Zapata CK12 Editor Say Thanks to the Authors Click http://www.ck12.org/saythanks (No sign in required) To access a customizable version

### Activity Set 4. Trainer Guide

Geometry and Measurement of Solid Figures Activity Set 4 Trainer Guide Mid_SGe_04_TG Copyright by the McGraw-Hill Companies McGraw-Hill Professional Development GEOMETRY AND MEASUREMENT OF SOLID FIGURES

### 3D shapes quiz. Level: A. 1. A 3-D shape can also be called... A) A flat shape B) A solid shape C) A polygon. 2. Vertices are also called...

Level: A 1. A 3-D shape can also be called... A) A flat shape B) A solid shape C) A polygon 2. Vertices are also called... A) Edges B) Corners C) Faces D) Sides 3. A solid object has six faces which are

### Grade 7/8 Math Circles Winter D Geometry

1 University of Waterloo Faculty of Mathematics Grade 7/8 Math Circles Winter 2013 3D Geometry Introductory Problem Mary s mom bought a box of 60 cookies for Mary to bring to school. Mary decides to bring

### Centroid: The point of intersection of the three medians of a triangle. Centroid

Vocabulary Words Acute Triangles: A triangle with all acute angles. Examples 80 50 50 Angle: A figure formed by two noncollinear rays that have a common endpoint and are not opposite rays. Angle Bisector:

### DISCOVERING 3D SHAPES

. DISCOVERING 3D SHAPES WORKSHEETS OCTOBER-DECEMBER 2009 1 . Worksheet 1. Cut out and stick the shapes. SHAPES WHICH ROLL SHAPES WHICH SLIDE 2 . Worksheet 2: COMPLETE THE CHARTS Sphere, triangle, prism,

### SA B 1 p where is the slant height of the pyramid. V 1 3 Bh. 3D Solids Pyramids and Cones. Surface Area and Volume of a Pyramid

Accelerated AAG 3D Solids Pyramids and Cones Name & Date Surface Area and Volume of a Pyramid The surface area of a regular pyramid is given by the formula SA B 1 p where is the slant height of the pyramid.

### Grade 7/8 Math Circles Winter D Geometry

1 University of Waterloo Faculty of Mathematics Grade 7/8 Math Circles Winter 2013 3D Geometry Introductory Problem Mary s mom bought a box of 60 cookies for Mary to bring to school. Mary decides to bring

### A convex polygon is a polygon such that no line containing a side of the polygon will contain a point in the interior of the polygon.

hapter 7 Polygons A polygon can be described by two conditions: 1. No two segments with a common endpoint are collinear. 2. Each segment intersects exactly two other segments, but only on the endpoints.

### Geometry. Unit 6. Quadrilaterals. Unit 6

Geometry Quadrilaterals Properties of Polygons Formed by three or more consecutive segments. The segments form the sides of the polygon. Each side intersects two other sides at its endpoints. The intersections

### Surface Area and Volume Learn it, Live it, and Apply it! Elizabeth Denenberg

Surface Area and Volume Learn it, Live it, and Apply it! Elizabeth Denenberg Objectives My unit for the Delaware Teacher s Institute is a 10 th grade mathematics unit that focuses on teaching students

### 15. PRISMS AND CYLINDERS

15. PRISMS AND CYLINDERS 15-1 Drawing prisms 2 15-2 Modelling prisms 4 15-3 Cross-sections of prisms 6 15-4 Nets of prisms 7 15-5 Euler's formula 8 15-6 Stacking prisms 9 15-7 Cylinders 10 15-8 Why is

### PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES NCERT

UNIT 12 PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES (A) Main Concepts and Results Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines,

### 6. Planarity. Fig Fig. 6.2

6. Planarity Let G(V, E) be a graph with V = {v 1, v 2,..., v n } and E = {e 1, e 2,..., e m }. Let S be any surface (like the plane, sphere) and P = {p 1, p 2,..., p n } be a set of n distinct points

### 2.9 3-D Solids and Nets

2.9 3-D Solids and Nets You need to decide whether or not to use the words shape (2-d) and solid (3-d) interchangeably. It can be helpful to avoid saying shape when referring to a 3-d object. Pupils will

### Florida Geometry EOC Assessment Study Guide

Florida Geometry EOC Assessment Study Guide The Florida Geometry End of Course Assessment is computer-based. During testing students will have access to the Algebra I/Geometry EOC Assessments Reference

### Constructing Geometric Solids

Constructing Geometric Solids www.everydaymathonline.com Objectives To provide practice identifying geometric solids given their properties; and to guide the construction of polyhedrons. epresentations

### BC Exam Solutions Texas A&M High School Math Contest November 8, 2014

Exam Solutions Texas &M High School Math ontest November 8, 014 If units are involved, include them in your answer, which needs to be simplified. 1. If an arc of 60 on circle I has the same length as an

### 12 Surface Area and Volume

12 Surface Area and Volume 12.1 Three-Dimensional Figures 12.2 Surface Areas of Prisms and Cylinders 12.3 Surface Areas of Pyramids and Cones 12.4 Volumes of Prisms and Cylinders 12.5 Volumes of Pyramids

### Planar Graphs and Graph Coloring

Planar Graphs and Graph Coloring Margaret M. Fleck 1 December 2010 These notes cover facts about graph colorings and planar graphs (sections 9.7 and 9.8 of Rosen) 1 Introduction So far, we ve been looking

### Polygons are figures created from segments that do not intersect at any points other than their endpoints.

Unit #5 Lesson #1: Polygons and Their Angles. Polygons are figures created from segments that do not intersect at any points other than their endpoints. A polygon is convex if all of the interior angles

### ENGINEERING DRAWING. UNIT I - Part A

ENGINEERING DRAWING UNIT I - Part A 1. Solid Geometry is the study of graphic representation of solids of --------- dimensions on plane surfaces of ------- dimensions. 2. In the orthographic projection,

### INDEX. Arc Addition Postulate,

# 30-60 right triangle, 441-442, 684 A Absolute value, 59 Acute angle, 77, 669 Acute triangle, 178 Addition Property of Equality, 86 Addition Property of Inequality, 258 Adjacent angle, 109, 669 Adjacent

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### Algebra 1 EOC Appendix D MATHEMATICS GLOSSARY ALGEBRA 1 EOC AND GEOMETRY EOC

Algebra 1 EOC Appendix D MATHEMATICS GLOSSARY ALGEBRA 1 EOC AND GEOMETRY EOC The terms defined in this glossary pertain to the NGSSS in mathematics for EOC assessments in Algebra 1 and Geometry. Included

### VISUALISING SOLID SHAPES (A) Main Concepts and Results

UNIT 6 VISUALISING SOLID SHAPES (A) Main Concepts and Results 3D shapes/objects are those which do not lie completely in a plane. 3D objects have different views from different positions. A solid is a

### SOLID SHAPES M.K. HOME TUITION. Mathematics Revision Guides Level: GCSE Higher Tier

Mathematics Revision Guides Solid Shapes Page 1 of 19 M.K. HOME TUITION Mathematics Revision Guides Level: GCSE Higher Tier SOLID SHAPES Version: 2.1 Date: 10-11-2015 Mathematics Revision Guides Solid

### Running head: A GEOMETRIC INTRODUCTION 1

Running head: A GEOMETRIC INTRODUCTION A Geometric Introduction to Mathematical Induction Problems using the Sums of Consecutive Natural Numbers, the Sums of Squares, and the Sums of Cubes of Natural Numbers

### Glossary. angles, adjacent Two angles with a common side that do not otherwise overlap. In the diagram, angles 1 and 2

Glossary 998 Everyday Learning Corporation absolute value The absolute value of a positive number is the number itself. For example, the absolute value of 3 is 3. The absolute value of a negative number

### 19. [Shapes] less than. The angle appears greater than 90. Check by placing the corner of a Maths Mate page inside the angle.

19. [Shapes] Skill 19.1 Comparing angles to a right angle. Place the corner of a page (which is a right angle) at the corner (vertex) of the angle. Align the base of the page with one line of the angle.

### 1 Symmetries of regular polyhedra

1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an

### alternate interior angles

alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate

### Colouring maps on impossible surfaces. Chris Wetherell Radford College / ANU Secondary College CMA Conference 2014

Colouring maps on impossible surfaces Chris Wetherell Radford College / ANU Secondary College CMA Conference 2014 Colouring rules To colour a map means assigning a colour to each region (country, state,

### Every 3-dimensional shape has three measurements to describe it: height, length and width.

Every 3-dimensional shape has three measurements to describe it: height, length and width. Height Width Length Faces A face is one of the flat sides of a three-dimensional shape. Faces A cuboid has 6 flat

### GeneticsOfPolygons.org. Lattice Polygons

GeneticsOfPolygons.org Lattice Polygons Definition: A lattice polygon is a polygon where the vertices are elements of d for some d 2 (where is the set of integers) Example1: Below are some lattice polygons

### CHROMATIC POLYNOMIALS OF PLANE TRIANGULATIONS

990, 2005 D. R. Woodall, School of Mathematical Sciences, University of Nottingham CHROMATIC POLYNOMIALS OF PLANE TRIANGULATIONS. Basic results. Throughout this survey, G will denote a multigraph with

### Platonic Solids. Some solids have curved surfaces or a mix of curved and flat surfaces (so they aren't polyhedra). Examples:

Solid Geometry Solid Geometry is the geometry of three-dimensional space, the kind of space we live in. Three Dimensions It is called three-dimensional or 3D because there are three dimensions: width,

### The 5 Platonic solids:

The 5 Platonic solids: The Tetrahedron (3 equilateral triangles at each vertex) The Hexahedron (3 squares at each vertex, cube) The Octahedron (4 equilateral triangles at each vertex) The Dodecahedron

### Mathematical Induction

Mathematical S 0 S 1 S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! Mathematical S 0 S 1 S 2 S 3 S4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! S 4 Mathematical S 0 S 1 S 2 S 3 S5 S 6 S 7 S 8 S 9 S 10

### Teaching Mathematics Vocabulary Using Hands-On Activities From an MSP Grant Summer Institute

Teaching Mathematics Vocabulary Using Hands-On Activities From an MSP Grant Summer Institute Dr. Carroll G. Wells (Co-authors: Dr. Randy Bouldin, Dr. Ben Hutchinson, Dr. Candice McQueen) Department of

### angle Definition and illustration (if applicable): a figure formed by two rays called sides having a common endpoint called the vertex

angle a figure formed by two rays called sides having a common endpoint called the vertex area the number of square units needed to cover a surface array a set of objects or numbers arranged in rows and

### Tiling with Regular Star Polygons

20 Joseph Myers Tiling with Regular Star Polygons Joseph Myers The Archimedean tilings (Figure 1) and polyhedra will be familiar to many readers. They have the property that the tiles of the tiling, or

### 2. If C is the midpoint of AB and B is the midpoint of AE, can you say that the measure of AC is 1/4 the measure of AE?

MATH 206 - Midterm Exam 2 Practice Exam Solutions 1. Show two rays in the same plane that intersect at more than one point. Rays AB and BA intersect at all points from A to B. 2. If C is the midpoint of

### Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn

### 6. GRAPH AND MAP COLOURING

6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following

### Norman Do. Art Gallery Theorems. 1 Guarding an Art Gallery

Norman Do Art Gallery Theorems 1 Guarding an Art Gallery Imagine that you are the owner of several art galleries and that you are in the process of hiring people to guard one of them. Unfortunately, with

### II. Geometry and Measurement

II. Geometry and Measurement The Praxis II Middle School Content Examination emphasizes your ability to apply mathematical procedures and algorithms to solve a variety of problems that span multiple mathematics

### 13 Solutions for Section 6

13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution

### Geometry Course Summary Department: Math. Semester 1

Geometry Course Summary Department: Math Semester 1 Learning Objective #1 Geometry Basics Targets to Meet Learning Objective #1 Use inductive reasoning to make conclusions about mathematical patterns Give

### SHAPE, SPACE AND MEASURES

SHAPE, SPACE AND MEASURES Pupils should be taught to: Use accurately the vocabulary, notation and labelling conventions for lines, angles and shapes; distinguish between conventions, facts, definitions

### Glossary. 134 GLOSSARY Discovering Geometry Teaching and Worksheet Masters 2003 Key Curriculum Press

Glossary acute angle An angle whose measure is less than 90. (Lesson 1.3) acute triangle A triangle with three acute angles. (Lesson 1.5) adjacent angles Two non-overlapping angles with a common vertex

### 1 of 69 Boardworks Ltd 2004

1 of 69 2 of 69 Intersecting lines 3 of 69 Vertically opposite angles When two lines intersect, two pairs of vertically opposite angles are formed. a d b c a = c and b = d Vertically opposite angles are

### State whether the figure appears to have line symmetry. Write yes or no. If so, copy the figure, draw all lines of symmetry, and state their number.

State whether the figure appears to have line symmetry. Write yes or no. If so, copy the figure, draw all lines of symmetry, and state their number. esolutions Manual - Powered by Cognero Page 1 1. A figure

### Chapter 1 Symmetry of Molecules p. 1 - Symmetry operation: Operation that transforms a molecule to an equivalent position

Chapter 1 Symmetry of Molecules p. 1-1. Symmetry of Molecules 1.1 Symmetry Elements Symmetry operation: Operation that transforms a molecule to an equivalent position and orientation, i.e. after the operation

### COURSE OVERVIEW. PearsonSchool.com Copyright 2009 Pearson Education, Inc. or its affiliate(s). All rights reserved

COURSE OVERVIEW The geometry course is centered on the beliefs that The ability to construct a valid argument is the basis of logical communication, in both mathematics and the real-world. There is a need

### Number Sense and Operations

Number Sense and Operations representing as they: 6.N.1 6.N.2 6.N.3 6.N.4 6.N.5 6.N.6 6.N.7 6.N.8 6.N.9 6.N.10 6.N.11 6.N.12 6.N.13. 6.N.14 6.N.15 Demonstrate an understanding of positive integer exponents

### Chapter 5. Molecular Symmetry

Chapter 5. Molecular Symmetry Symmetry is present in nature and in human culture An introduction to symmetry analysis Symmetry perations and Elements Definitions Symmetry peration = a movement of a body

### SCISSORS CONGRUENCE EFTON PARK

SCISSORS CONGRUENCE EFTON PARK 1. Scissors Congruence in the Plane Definition 1.1. A polygonal decomposition of a polygon P in the plane is a finite set {P 1, P,..., P k } of polygons whose union is P

### Homework Exam 1, Geometric Algorithms, 2016

Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3-dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the