Investigating Geometric Figures

Total Page：16

File Type：pdf, Size：1020Kb

Chapter 2 Investigating Geometric Figures 2-2 POLYGONS Objective: Classify polygons; find the sum of the measures of the interior and exterior angles of polygons 1 POLYGON: A closed plane figure formed by three or more segments that intersect only at their endpoints. NO GAPS, NO CROSS OVERS Tell whether the figure is a polygon. 2 Each segment that forms a polygon is a side of the polygon. The common endpoint of two sides is a vertex of the polygon. A segment that connects any two nonconsecutive vertices is a diagonal. 3 You can name a polygon by the number of its sides. 4 A polygon is concave if any part of a diagonal contains points in the exterior of the polygon. If no diagonal contains points in the exterior, then the polygon is convex. A regular polygon is always convex. 5 All the sides are congruent in an equilateral polygon. All the angles are congruent in an equiangular polygon. A regular polygon is one that has all angles and sides are congruent. If a polygon is not regular, it is called irregular. 6 Draw a concave pentagon. Draw a convex irregular heptagon. 7 5 2 3 180 540 108 6 3 4 180 720 120 7 4 5 180 900 128.5 8 5 6 180 1080 135 10 7 8 180 1440 144 12 9 10 180 1800 150 8 Theorem 2-3 Polygon Interior Angle-Sum Theorem The sum of the interior angle measures of a convex polygon with n sides is (n - 2) 180°. http://www.mathopenref.com/polygoninteriorangles.html 9 1. Find the sum of the interior angle measures of a... convex heptagon. regular 16gon. 10 In a regular polygon with n sides the measure of one interior angle is (n - 2)180 n 11 2. What is each measure of the interior angle of a regular 18gon? What is each interior angle of a dodecogon? 12 3. Find the measure of the missing angle of the quadrilateral. 91° 79° x 125° 13 In the polygons below, an exterior angle has been measured at each vertex. Notice that in each case, the sum of the exterior angle measures is 360°. 14 Exterior Angles 15 Theorem 2-4 Polygon Exterior Angle-Sum Theorem The sum of the measures of the exterior angles of a polygon, one at each vertex, is 360°. 16 4. Find the measure of each exterior angle of a regular 20gon. NOTE: One exterior angle of a regular polygon with n sides = 360 n 17 5. Find the value of b in polygon FGHJKL. 18 6. Ann is making paper stars for party decorations. What is the measure of ∠1? 19 7. Find the measure of each interior angle of pentagon ABCDE. You will have to find the value of c. 20 8. The measure of an exterior angle of a regular polygon is 60°. Find the number of sides. 21 HW # 19 p. 7980 # 14,1017,1926 Quiz on Thursday !!!! 22.

Copy Link

Recommended publications

Lesson 3: Rectangles Inscribed in Circles
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 3 M5 GEOMETRY Lesson 3: Rectangles Inscribed in Circles Student Outcomes . Inscribe a rectangle in a circle. Understand the symmetries of inscribed rectangles across a diameter. Lesson Notes Have students use a compass and straightedge to locate the center of the circle provided. If necessary, remind students of their work in Module 1 on constructing a perpendicular to a segment and of their work in Lesson 1 in this module on Thales’ theorem. Standards addressed with this lesson are G-C.A.2 and G-C.A.3. Students should be made aware that figures are not drawn to scale. Classwork Scaffolding: Opening Exercise (9 minutes) Display steps to construct a perpendicular line at a point. Students follow the steps provided and use a compass and straightedge to find the center of a circle. This exercise reminds students about constructions previously . Draw a segment through the studied that are needed in this lesson and later in this module. point, and, using a compass, mark a point equidistant on Opening Exercise each side of the point. Using only a compass and straightedge, find the location of the center of the circle below. Label the endpoints of the Follow the steps provided. segment 퐴 and 퐵. Draw chord 푨푩̅̅̅̅. Draw circle 퐴 with center 퐴 . Construct a chord perpendicular to 푨푩̅̅̅̅ at and radius ̅퐴퐵̅̅̅. endpoint 푩. Draw circle 퐵 with center 퐵 . Mark the point of intersection of the perpendicular chord and the circle as point and radius ̅퐵퐴̅̅̅. 푪. Label the points of intersection .
[Show full text]
Chapter 6: Things to Know
MAT 222 Chapter 6: Things To Know Section 6.1 Polygons Objectives Vocabulary 1. Define and Name Polygons. • polygon 2. Find the Sum of the Measures of the Interior • vertex Angles of a Quadrilateral. • n-gon • concave polygon • convex polygon • quadrilateral • regular polygon • diagonal • equilateral polygon • equiangular polygon Polygon Definition A figure is a polygon if it meets the following three conditions: 1. 2. 3. The endpoints of the sides of a polygon are called the ________________________ (Singular form: _______________ ). Polygons must be named by listing all of the vertices in order. Write two different ways of naming the polygon to the right below: _______________________ , _______________________ Example Identifying Polygons Identify the polygons. If not a polygon, state why. a. b. c. d. e. MAT 222 Chapter 6 Things To Know Number of Sides Name of Polygon 3 4 5 6 7 8 9 10 12 n Definitions In general, a polygon with n sides is called an __________________________. A polygon is __________________________ if no line containing a side contains a point within the interior of the polygon. Otherwise, a polygon is _________________________________. Example Identifying Convex and Concave Polygons. Identify the polygons. If not a polygon, state why. a. b. c. Definition An ________________________________________ is a polygon with all sides congruent. An ________________________________________ is a polygon with all angles congruent. A _________________________________________ is a polygon that is both equilateral and equiangular. MAT 222 Chapter 6 Things To Know Example Identifying Regular Polygons Determine if each polygon is regular or not. Explain your reasoning. a. b. c. Definition A segment joining to nonconsecutive vertices of a convex polygon is called a _______________________________ of the polygon.
[Show full text]
The Geometry of Diagonal Groups
The geometry of diagonal groups R. A. Baileya, Peter J. Camerona, Cheryl E. Praegerb, Csaba Schneiderc aUniversity of St Andrews, St Andrews, UK bUniversity of Western Australia, Perth, Australia cUniversidade Federal de Minas Gerais, Belo Horizonte, Brazil Abstract Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan{Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combi- natorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied in general. The main purpose of this paper is to describe and characterise such struct- ures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan{Scott theorem, which are defined over finite characteristically simple groups, our construction works over arbitrary groups, finite or infinite. A diagonal semilattice depends on a dimension m and a group T . For m = 2, it is a Latin square, the Cayley table of T , though in fact any Latin square satisfies our combinatorial axioms. However, for m > 3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in great profusion but higher- dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set Ω, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions turn out to be equivalent for diagonal groups).
[Show full text]
Simple Polygons Scribe: Michael Goldwasser
CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons Scribe: Michael Goldwasser Algorithms for triangulating polygons are important tools throughout computa- tional geometry. Many problems involving polygons are simplified by partitioning the complex polygon into triangles, and then working with the individual triangles. The applications of such algorithms are well documented in papers involving visibility, motion planning, and computer graphics. The following notes give an introduction to triangulations and many related definitions and basic lemmas. Most of the definitions are based on a simple polygon, P, containing n edges, and hence n vertices. However, many of the definitions and results can be extended to a general arrangement of n line segments. 1 Diagonals Definition 1. Given a simple polygon, P, a diagonal is a line segment between two non-adjacent vertices that lies entirely within the interior of the polygon. Lemma 2. Every simple polygon with jPj > 3 contains a diagonal. Proof: Consider some vertex v. If v has a diagonal, it’s party time. If not then the only vertices visible from v are its neighbors. Therefore v must see some single edge beyond its neighbors that entirely spans the sector of visibility, and therefore v must be a convex vertex. Now consider the two neighbors of v. Since jPj > 3, these cannot be neighbors of each other, however they must be visible from each other because of the above situation, and thus the segment connecting them is indeed a diagonal.
[Show full text]
Unit 6 Visualising Solid Shapes(Final)
• 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 polyhedron if it is made up of only polygonal faces, the faces meet at edges which are line segments and the edges meet at a point called vertex. • Euler’s formula for any polyhedron is, F + V – E = 2 Where F stands for number of faces, V for number of vertices and E for number of edges. • Types of polyhedrons: (a) Convex polyhedron A convex polyhedron is one in which all faces make it convex. e.g. (1) (2) (3) (4) 12/04/18 (1) and (2) are convex polyhedrons whereas (3) and (4) are non convex polyhedron. (b) Regular polyhedra or platonic solids: A polyhedron is regular if its faces are congruent regular polygons and the same number of faces meet at each vertex. For example, a cube is a platonic solid because all six of its faces are congruent squares. There are five such solids– tetrahedron, cube, octahedron, dodecahedron and icosahedron. e.g. • A prism is a polyhedron whose bottom and top faces (known as bases) are congruent polygons and faces known as lateral faces are parallelograms (when the side faces are rectangles, the shape is known as right prism). • A pyramid is a polyhedron whose base is a polygon and lateral faces are triangles. • A map depicts the location of a particular object/place in relation to other objects/places. The front, top and side of a figure are shown. Use centimetre cubes to build the figure.
[Show full text]
Discovering Geometry an Investigative Approach
Discovering Geometry An Investigative Approach Condensed Lessons: A Tool for Parents and Tutors Teacher’s Materials Project Editor: Elizabeth DeCarli Project Administrator: Brady Golden Writers: David Rasmussen, Stacey Miceli Accuracy Checker: Dudley Brooks Production Editor: Holly Rudelitsch Copyeditor: Jill Pellarin Editorial Production Manager: Christine Osborne Production Supervisor: Ann Rothenbuhler Production Coordinator: Jennifer Young Text Designers: Jenny Somerville, Garry Harman Composition, Technical Art, Prepress: ICC Macmillan Inc. Cover Designers: Jill Kongabel, Marilyn Perry, Jensen Barnes Printer: Data Reproductions Textbook Product Manager: James Ryan Executive Editor: Casey FitzSimons Publisher: Steven Rasmussen ©2008 by Kendall Hunt Publishing. All rights reserved. Cover Photo Credits: Background image: Doug Wilson/Westlight/Corbis. Construction site image: Sonda Dawes/The Image Works. All other images: Ken Karp Photography. Limited Reproduction Permission The publisher grants the teacher whose school has adopted Discovering Geometry, and who has received Discovering Geometry: An Investigative Approach, Condensed Lessons: A Tool for Parents and Tutors as part of the Teaching Resources package for the book, the right to reproduce material for use in his or her own classroom. Unauthorized copying of Discovering Geometry: An Investigative Approach, Condensed Lessons: A Tool for Parents and Tutors constitutes copyright infringement and is a violation of federal law. All registered trademarks and trademarks in this book are the property of their respective holders. Kendall Hunt Publishing 4050 Westmark Drive PO Box 1840 Dubuque, IA 52004-1840 www.kendallhunt.com Printed in the United States of America 10 9 8 7 6 5 4 3 2 13 12 11 10 09 08 ISBN 978-1-55953-895-4 Contents Introduction .
[Show full text]
Curriculum Burst 31: Coloring a Pentagon by Dr
Curriculum Burst 31: Coloring a Pentagon By Dr. James Tanton, MAA Mathematician in Residence Each vertex of a convex pentagon ABCDE is to be assigned a color. There are 6 colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible? SOURCE: This is question # 22 from the 2010 MAA AMC 10a Competition. QUICK STATS: MAA AMC GRADE LEVEL This question is appropriate for the 10th grade level. MATHEMATICAL TOPICS Counting: Permutations and Combinations COMMON CORE STATE STANDARDS S-CP.9: Use permutations and combinations to compute probabilities of compound events and solve problems. MATHEMATICAL PRACTICE STANDARDS MP1 Make sense of problems and persevere in solving them. MP2 Reason abstractly and quantitatively. MP3 Construct viable arguments and critique the reasoning of others. MP7 Look for and make use of structure. PROBLEM SOLVING STRATEGY ESSAY 7: PERSEVERANCE IS KEY 1 THE PROBLEM-SOLVING PROCESS: Three consecutive vertices the same color is not allowed. As always … (It gives a bad diagonal!) How about two pairs of neighboring vertices, one pair one color, the other pair a STEP 1: Read the question, have an second color? The single remaining vertex would have to emotional reaction to it, take a deep be a third color. Call this SCHEME III. breath, and then reread the question. This question seems complicated! We have five points A , B , C , D and E making a (convex) pentagon. A little thought shows these are all the options. (But note, with rotations, there are 5 versions of scheme II and 5 versions of scheme III.) Now we need to count the number Each vertex is to be colored one of six colors, but in a way of possible colorings for each scheme.
[Show full text]
Polygons and Convexity
Geometry Week 4 Sec 2.5 to ch. 2 test section 2.5 Polygons and Convexity Definitions: convex set – has the property that any two of its points determine a segment contained in the set concave set – a set that is not convex concave concave convex convex concave Definitions: polygon – a simple closed curve that consists only of segments side of a polygon – one of the segments that defines the polygon vertex – the endpoint of the side of a polygon 1 angle of a polygon – an angle with two properties: 1) its vertex is a vertex of the polygon 2) each side of the angle contains a side of the polygon polygon not a not a polygon (called a polygonal curve) polygon Definitions: polygonal region – a polygon together with its interior equilateral polygon – all sides have the same length equiangular polygon – all angels have the same measure regular polygon – both equilateral and equiangular Example: A square is equilateral, equiangular, and regular. 2 diagonal – a segment that connects 2 vertices but is not a side of the polygon C B C B D A D A E AC is a diagonal AC is a diagonal AB is not a diagonal AD is a diagonal AB is not a diagonal Notation: It does not matter which vertex you start with, but the vertices must be listed in order. Above, we have square ABCD and pentagon ABCDE. interior of a convex polygon – the intersection of the interiors of is angles exterior of a convex polygon – union of the exteriors of its angles 3 Polygon Classification Number of sides Name of polygon 3 triangle 4 quadrilateral 5 pentagon 6 hexagon 7 heptagon 8 octagon
[Show full text]
Combinatorial Analysis of Diagonal, Box, and Greater-Than Polynomials As Packing Functions
Appl. Math. Inf. Sci. 9, No. 6, 2757-2766 (2015) 2757 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/090601 Combinatorial Analysis of Diagonal, Box, and Greater-Than Polynomials as Packing Functions 1,2, 3 2 4 Jose Torres-Jimenez ∗, Nelson Rangel-Valdez , Raghu N. Kacker and James F. Lawrence 1 CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Victoria-Soto La Marina, 87130 Victoria Tamps., Mexico 2 National Institute of Standards and Technology, Gaithersburg, MD 20899, USA 3 Universidad Polit´ecnica de Victoria, Av. Nuevas Tecnolog´ıas 5902, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M´exico 4 George Mason University, Fairfax, VA 22030, USA Received: 2 Feb. 2015, Revised: 2 Apr. 2015, Accepted: 3 Apr. 2015 Published online: 1 Nov. 2015 Abstract: A packing function is a bijection between a subset V Nm and N, where N denotes the set of non negative integers N. Packing functions have several applications, e.g. in partitioning schemes⊆ and in text compression. Two categories of packing functions are Diagonal Polynomials and Box Polynomials. The bijections for diagonal ad box polynomials have mostly been studied for small values of m. In addition to presenting bijections for box and diagonal polynomials for any value of m, we present a bijection using what we call Greater-Than Polynomial between restricted m dimensional vectors over Nm and N. We give details of two interesting applications of packing functions: (a) the application of greater-than− polynomials for the manipulation of Covering Arrays that are used in combinatorial interaction testing; and (b) the relationship between grater-than and diagonal polynomials with a special case of Diophantine equations.
[Show full text]
Chapter 1: Tools of Geometry
Tools of Geometry Then You graphed points on the coordinate plane and evaluated mathematical expressions. Now In Chapter 1, you will: Find distances between points and midpoints of line segments. Identify angle relationships. Find perimeters, areas, surface areas, and volumes. KY Program of Studies HS-G-S-SR6 Students will analyze and apply spatial relationships among points, lines and planes. HS-G-S-FS4 Students will perform constructions. Why? MAPS Geometric figures and terms can be used to represent and describe real-world situations. On a map, locations of cities can be represented by points, highways or streets by lines, and national parks by polygons that have both perimeter and area. The map itself is representative of a plane. Animation glencoe.com 2 Chapter 1 Tools of Geometry Get Ready for Chapter 1 Diagnose Readiness You have two options for checking Prerequisite Skills. Text Option Take the Quick Check below. Refer to the Quick Review for help. QuickCheck QuickReview Graph and label each point in the coordinate EXAMPLE 1 (Lesson 0-7) plane. Graph and label the point Q(−3, 4) in the 1. W(5, 2) 2. X(0, 6) coordinate plane. 3. Y(-3, -1) 4. Z(4, 2) Start at the origin. y Since the x-coordinate 2 -3, 4 abcdef g h 5. GAMES Carolina is is negative, move 3 using the diagram to 8 8 7 7 units to the left. Then record her chess 6 6 move 4 units up since moves. She moves 5 5 0 the y-coordinate is x her knight 2 spaces 4 4 3 3 positive.
[Show full text]
Diagonal Tuple Space Search in Two Dimensions
Diagonal Tuple Space Search in Two Dimensions Mikko Alutoin and Pertti Raatikainen VTT Information Technology P.O. Box 1202, FIN-02044 Finland {mikkocalutoin, pertti.raatikainen}@vtt.fi Abstract. Due to the evolution of the Internet and its services, the process of forwarding packets in routers is becoming more complex. In order to execute the sophisticated routing logic of modern firewalls, multidimensional packet classification is required. Unfortunately, the multidimensional packet classifi cation algorithms are known to be either time or storage hungry in the general case. It has been anticipated that more feasible algorithms could be obtained for conflict-free classifiers. This paper proposes a novel two-dimensional packet classification algorithrn applicable to the conflict-free classifiers. lt derives from the well-known tuple space paradigm and it has the search cost of O(log w) and storage complexity of O{n2w log w), where w is the width of the proto col fields given in bits and n is the number of rules in the classifier. This is re markable because without the conflict-free constraint the search cost in the two dimensional tup!e space is E>(w). 1 Introduction Traditional packet forwarding in the Internet is based on one-dimensional route Iook ups: destination IP address is used as the key when the Forwarding Information Base (FIB) is searched for matehing routes. The routes are stored in the FIB by using a network prefix as the key. A route matches a packet if its network prefix is a prefix of the packet's destination IP address. In the event that several routes match the packet, the one with the Iongest prefix prevails.
[Show full text]
Length and Circumference Assessment of Body Parts – the Creation of Easy-To-Use Predictions Formulas
49th International Conference on Environmental Systems ICES-2019-170 7-11 July 2019, Boston, Massachusetts Length and Circumference Assessment of Body Parts – The Creation of Easy-To-Use Predictions Formulas Jan P. Weber1 Technische Universität München, 85748 Garching b. München, Germany The Virtual Habitat project (V-HAB) at the Technical University of Munich (TUM) aims to develop a dynamic simulation environment for life support systems (LSS). Within V-HAB a dynamic human model interacts with the LSS by providing relevant metabolic inputs and outputs based on internal, environmental and operational factors. The human model is separated into five sub-models (called layers) representing metabolism, respiration, thermoregulation, water balance and digestion. The Wissler Thermal Model was converted in 2015/16 from Fortran to C#, introducing a more modularized structure and standalone graphical user interface (GUI). While previous effort was conducted in order to make the model in its current accepted version available in V-HAB, present work is focusing on the rework of the passive system. As part of this rework an extensive assessment of human body measurements and their dependency on a low number of influencing parameters was performed using the body measurements of 3982 humans (1774 men and 2208 women) in order to create a set of easy- to-use predictive formulas for the calculation of length and circumference measurements of various body parts. Nomenclature AAC = Axillary Arm Circumference KHM = Knee Height, Midpatella Age = Age of the
[Show full text]