Modern Elementary Geometry"
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Parallelogram Law Objective: to Take Students Through the Process
The Parallelogram Law Objective: To take students through the process of discovery, making a conjecture, further exploration, and finally proof. I. Introduction: Use one of the following… • Geometer’s Sketchpad demonstration • Geogebra demonstration • The introductory handout from this lesson Using one of the introductory activities, allow students to explore and make a conjecture about the relationship between the sum of the squares of the sides of a parallelogram and the sum of the squares of the diagonals. Conjecture: The sum of the squares of the sides of a parallelogram equals the sum of the squares of the diagonals. Ask the question: Can we prove this is always true? II. Activity: Have students look at one more example. Follow the instructions on the exploration handouts, “Demonstrating the Parallelogram Law.” • Give each student a copy of the student handouts, scissors, a glue stick, and two different colored highlighters. Have students follow the instructions. When they get toward the end, they will need to cut very small pieces to fit in the uncovered space. Most likely there will be a very small amount of space left uncovered, or a small amount will extend outside the figure. • After the activity, discuss the results. Did the squares along the two diagonals fit into the squares along all four sides? Since it is unlikely that it will fit exactly, students might question if the relationship is always true. At this point, talk about how we will need to find a convincing proof. III. Go through one or more of the proofs below: Page 1 of 10 MCC@WCCUSD 02/26/13 A. -
CHAPTER 3. VECTOR ALGEBRA Part 1: Addition and Scalar
CHAPTER 3. VECTOR ALGEBRA Part 1: Addition and Scalar Multiplication for Vectors. §1. Basics. Geometric or physical quantities such as length, area, volume, tempera- ture, pressure, speed, energy, capacity etc. are given by specifying a single numbers. Such quantities are called scalars, because many of them can be measured by tools with scales. Simply put, a scalar is just a number. Quantities such as force, velocity, acceleration, momentum, angular velocity, electric or magnetic field at a point etc are vector quantities, which are represented by an arrow. If the ‘base’ and the ‘head’ of this arrow are B and H repectively, then we denote this vector by −−→BH: Figure 1. Often we use a single block letter in lower case, such as u, v, w, p, q, r etc. to denote a vector. Thus, if we also use v to denote the above vector −−→BH, then v = −−→BH.A vector v has two ingradients: magnitude and direction. The magnitude is the length of the arrow representing v, and is denoted by v . In case v = −−→BH, certainly we | | have v = −−→BH for the magnitude of v. The meaning of the direction of a vector is | | | | self–evident. Two vectors are considered to be equal if they have the same magnitude and direction. You recognize two equal vectors in drawing, if their representing arrows are parallel to each other, pointing in the same way, and have the same length 1 Figure 2. For example, if A, B, C, D are vertices of a parallelogram, followed in that order, then −→AB = −−→DC and −−→AD = −−→BC: Figure 3. -
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. -
An FPT Algorithm for the Embeddability of Graphs Into Two-Dimensional Simplicial Complexes∗
An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes∗ Éric Colin de Verdière† Thomas Magnard‡ Abstract We consider the embeddability problem of a graph G into a two-dimensional simplicial com- plex C: Given G and C, decide whether G admits a topological embedding into C. The problem is NP-hard, even in the restricted case where C is homeomorphic to a surface. It is known that the problem admits an algorithm with running time f(c)nO(c), where n is the size of the graph G and c is the size of the two-dimensional complex C. In other words, that algorithm is polynomial when C is fixed, but the degree of the polynomial depends on C. We prove that the problem is fixed-parameter tractable in the size of the two-dimensional complex, by providing a deterministic f(c)n3-time algorithm. We also provide a randomized algorithm with O(1) expected running time 2c nO(1). Our approach is to reduce to the case where G has bounded branchwidth via an irrelevant vertex method, and to apply dynamic programming. We do not rely on any component of the existing linear-time algorithms for embedding graphs on a fixed surface; the only elaborated tool that we use is an algorithm to compute grid minors. 1 Introduction An embedding of a graph G into a host topological space X is a crossing-free topological drawing of G into X. The use and computation of graph embeddings is central in the communities of computational topology, topological graph theory, and graph drawing. -
Special Isocubics in the Triangle Plane
Special Isocubics in the Triangle Plane Jean-Pierre Ehrmann and Bernard Gibert June 19, 2015 Special Isocubics in the Triangle Plane This paper is organized into five main parts : a reminder of poles and polars with respect to a cubic. • a study on central, oblique, axial isocubics i.e. invariant under a central, oblique, • axial (orthogonal) symmetry followed by a generalization with harmonic homolo- gies. a study on circular isocubics i.e. cubics passing through the circular points at • infinity. a study on equilateral isocubics i.e. cubics denoted 60 with three real distinct • K asymptotes making 60◦ angles with one another. a study on conico-pivotal isocubics i.e. such that the line through two isoconjugate • points envelopes a conic. A number of practical constructions is provided and many examples of “unusual” cubics appear. Most of these cubics (and many other) can be seen on the web-site : http://bernard.gibert.pagesperso-orange.fr where they are detailed and referenced under a catalogue number of the form Knnn. We sincerely thank Edward Brisse, Fred Lang, Wilson Stothers and Paul Yiu for their friendly support and help. Chapter 1 Preliminaries and definitions 1.1 Notations We will denote by the cubic curve with barycentric equation • K F (x,y,z) = 0 where F is a third degree homogeneous polynomial in x,y,z. Its partial derivatives ∂F ∂2F will be noted F ′ for and F ′′ for when no confusion is possible. x ∂x xy ∂x∂y Any cubic with three real distinct asymptotes making 60◦ angles with one another • will be called an equilateral cubic or a 60. -
Delaunay Triangulations of Points on Circles Arxiv:1803.11436V1 [Cs.CG
Delaunay Triangulations of Points on Circles∗ Vincent Despr´e † Olivier Devillers† Hugo Parlier‡ Jean-Marc Schlenker‡ April 2, 2018 Abstract Delaunay triangulations of a point set in the Euclidean plane are ubiq- uitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but since it is not a generic situation, this difficulty is usually handled by using a (symbolic or explicit) perturbation. As an alter- native, we propose to define a canonical triangulation for a set of concyclic points by using a max-min angle characterization of Delaunay triangulations. This point of view leads to a well defined and unique triangulation as long as there are no symmetric quadruples of points. This unique triangulation can be computed in quasi-linear time by a very simple algorithm. 1 Introduction Let P be a set of points in the Euclidean plane. If we assume that P is in general position and in particular do not contain 4 concyclic points, then the Delaunay triangulation DT (P ) is the unique triangulation over P such that the (open) circumdisk of each triangle is empty. DT (P ) has a number of interesting properties. The one that we focus on is called the max-min angle property. For a given triangulation τ, let A(τ) be the list of all the angles of τ sorted from smallest to largest. DT (P ) is the triangulation which maximizes A(τ) for the lexicographical order [4,7] . In dimension 2 and for points in general position, this max-min angle arXiv:1803.11436v1 [cs.CG] 30 Mar 2018 property characterizes Delaunay triangulations and highlights one of their most ∗This work was supported by the ANR/FNR project SoS, INTER/ANR/16/11554412/SoS, ANR-17-CE40-0033. -
The Octagonal Pets by Richard Evan Schwartz
The Octagonal PETs by Richard Evan Schwartz 1 Contents 1 Introduction 11 1.1 WhatisaPET?.......................... 11 1.2 SomeExamples .......................... 12 1.3 GoalsoftheMonograph . 13 1.4 TheOctagonalPETs . 14 1.5 TheMainTheorem: Renormalization . 15 1.6 CorollariesofTheMainTheorem . 17 1.6.1 StructureoftheTiling . 17 1.6.2 StructureoftheLimitSet . 18 1.6.3 HyperbolicSymmetry . 21 1.7 PolygonalOuterBilliards. 22 1.8 TheAlternatingGridSystem . 24 1.9 ComputerAssists ......................... 26 1.10Organization ........................... 28 2 Background 29 2.1 LatticesandFundamentalDomains . 29 2.2 Hyperplanes............................ 30 2.3 ThePETCategory ........................ 31 2.4 PeriodicTilesforPETs. 32 2.5 TheLimitSet........................... 34 2.6 SomeHyperbolicGeometry . 35 2.7 ContinuedFractions . 37 2.8 SomeAnalysis........................... 39 I FriendsoftheOctagonalPETs 40 3 Multigraph PETs 41 3.1 TheAbstractConstruction. 41 3.2 TheReflectionLemma . 43 3.3 ConstructingMultigraphPETs . 44 3.4 PlanarExamples ......................... 45 3.5 ThreeDimensionalExamples . 46 3.6 HigherDimensionalGeneralizations . 47 2 4 TheAlternatingGridSystem 48 4.1 BasicDefinitions ......................... 48 4.2 CompactifyingtheGenerators . 50 4.3 ThePETStructure........................ 52 4.4 CharacterizingthePET . 54 4.5 AMoreSymmetricPicture. 55 4.5.1 CanonicalCoordinates . 55 4.5.2 TheDoubleFoliation . 56 4.5.3 TheOctagonalPETs . 57 4.6 UnboundedOrbits ........................ 57 4.7 TheComplexOctagonalPETs. 58 4.7.1 ComplexCoordinates. -
Angles in a Circle and Cyclic Quadrilateral MODULE - 3 Geometry
Angles in a Circle and Cyclic Quadrilateral MODULE - 3 Geometry 16 Notes ANGLES IN A CIRCLE AND CYCLIC QUADRILATERAL You must have measured the angles between two straight lines. Let us now study the angles made by arcs and chords in a circle and a cyclic quadrilateral. OBJECTIVES After studying this lesson, you will be able to • verify that the angle subtended by an arc at the centre is double the angle subtended by it at any point on the remaining part of the circle; • prove that angles in the same segment of a circle are equal; • cite examples of concyclic points; • define cyclic quadrilterals; • prove that sum of the opposite angles of a cyclic quadrilateral is 180o; • use properties of cyclic qudrilateral; • solve problems based on Theorems (proved) and solve other numerical problems based on verified properties; • use results of other theorems in solving problems. EXPECTED BACKGROUND KNOWLEDGE • Angles of a triangle • Arc, chord and circumference of a circle • Quadrilateral and its types Mathematics Secondary Course 395 MODULE - 3 Angles in a Circle and Cyclic Quadrilateral Geometry 16.1 ANGLES IN A CIRCLE Central Angle. The angle made at the centre of a circle by the radii at the end points of an arc (or Notes a chord) is called the central angle or angle subtended by an arc (or chord) at the centre. In Fig. 16.1, ∠POQ is the central angle made by arc PRQ. Fig. 16.1 The length of an arc is closely associated with the central angle subtended by the arc. Let us define the “degree measure” of an arc in terms of the central angle. -
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 . -
Application of Nine Point Circle Theorem
Application of Nine Point Circle Theorem Submitted by S3 PLMGS(S) Students Bianca Diva Katrina Arifin Kezia Aprilia Sanjaya Paya Lebar Methodist Girls’ School (Secondary) A project presented to the Singapore Mathematical Project Festival 2019 Singapore Mathematic Project Festival 2019 Application of the Nine-Point Circle Abstract In mathematics geometry, a nine-point circle is a circle that can be constructed from any given triangle, which passes through nine significant concyclic points defined from the triangle. These nine points come from the midpoint of each side of the triangle, the foot of each altitude, and the midpoint of the line segment from each vertex of the triangle to the orthocentre, the point where the three altitudes intersect. In this project we carried out last year, we tried to construct nine-point circles from triangulated areas of an n-sided polygon (which we call the “Original Polygon) and create another polygon by connecting the centres of the nine-point circle (which we call the “Image Polygon”). From this, we were able to find the area ratio between the areas of the original polygon and the image polygon. Two equations were found after we collected area ratios from various n-sided regular and irregular polygons. Paya Lebar Methodist Girls’ School (Secondary) 1 Singapore Mathematic Project Festival 2019 Application of the Nine-Point Circle Acknowledgement The students involved in this project would like to thank the school for the opportunity to participate in this competition. They would like to express their gratitude to the project supervisor, Ms Kok Lai Fong for her guidance in the course of preparing this project. -
Ill.'Dept. of Mathemat Available in Hard Copy Due To:Copyright,Restrictions
Docusty4 REWIRE . ED184843 E 030 460 AUTHOR Kogan, B. Yu TITLE The Application àf Me anics to Ge setry. Popullr Lectures in Mathematice. 'INSTITUTION Cbicag Univ. Ill.'Dept. of Mathemat s. SPONS AGENCY National Science Foundation, Nashington;.D.C. PUB DATE 74 GRANT NSLY-3-13847(MA) NOTE 65p.; ?or related documents, see SE 030 4-61-465. Not available in hard copy due to:copyright,restrictions. Translated and adapted from the Russian edition. 'AVAILABLE FROM The University of Chicago Press, Chicaip, IL 60637. (Order No. 450163; $4.50). EDRS PRICE MP01 Plus Postage.. PC Not Available from ED4S. DESZRIPTORS *College Mathematics; Force; Geometric Concepti; *Geometry; Higher Education; Lecture Method; *Mathematical Applications; *Mathemaiics; *Mechanics (Physics) ABBTRAiT Presented in thir traInslktion are three chapters. Chapter I discusses the compbsitivn of forces and several theoreas of geometry are proved using the'fundamental conceptsand certain laws of statics. Chapter II discusses the perpetual motion postRlate; several geometri:l.theorems are proved, uting the postulate t4t p9rp ual motion is iipossib?e. In Chapter ILI,' the Center of Gray Potential Energy, and Vork are discussed. (MK) a N'4 , * Reproductions supplied by EDRS are the best that can be madel * * from the original document. * U.S. DIEPARTMINT OP WEALTH. g.tpUCATION WILPARI - aATIONAL INSTITTLISM Oa IDUCATION THIS DOCUMENT HAS BEEN REPRO. atiCED EXACTLMAIS RECEIVED Flicw THE PERSON OR ORGANIZATION DRPOIN- ATINO IT POINTS'OF VIEW OR OPINIONS STATED DO NOT NECESSARILY WEPRE.' se NT OFFICIAL NATIONAL INSTITUTE OF EDUCATION POSITION OR POLICY 0 * "PERMISSION TO REPRODUC THIS MATERIAL IN MICROFICHE dIlLY HAS SEEN GRANTED BY TO THE EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC)." -Mlk -1 Popular Lectures In nithematics. -
Arxiv:1812.02806V3 [Math.GT] 27 Jun 2019 Sphere Formed by the Triangles Bounds a Ball and the Vertex in the Identification Space Looks Like the Centre of a Ball
TRAVERSING THREE-MANIFOLD TRIANGULATIONS AND SPINES J. HYAM RUBINSTEIN, HENRY SEGERMAN AND STEPHAN TILLMANN Abstract. A celebrated result concerning triangulations of a given closed 3–manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves. A similar result is known for ideal triangulations of topologically finite non-compact 3–manifolds. These results build on classical work that goes back to Alexander, Newman, Moise, and Pachner. The key special case of 1–vertex triangulations of closed 3–manifolds was independently proven by Matveev and Piergallini. The general result for closed 3–manifolds can be found in work of Benedetti and Petronio, and Amendola gives a proof for topologically finite non-compact 3–manifolds. These results (and their proofs) are phrased in the dual language of spines. The purpose of this note is threefold. We wish to popularise Amendola’s result; we give a combined proof for both closed and non-compact manifolds that emphasises the dual viewpoints of triangulations and spines; and we give a proof replacing a key general position argument due to Matveev with a more combinatorial argument inspired by the theory of subdivisions. 1. Introduction Suppose you have a finite number of triangles. If you identify edges in pairs such that no edge remains unglued, then the resulting identification space looks locally like a plane and one obtains a closed surface, a two-dimensional manifold without boundary. The classification theorem for surfaces, which has its roots in work of Camille Jordan and August Möbius in the 1860s, states that each closed surface is topologically equivalent to a sphere with some number of handles or crosscaps.