DOCSLIB.ORG

Formulas Among Diagonals in the Regular Polygon and the Catalan Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Formulas Among Diagonals in the Regular Polygon and the Catalan Numbers Forum Geometricorum b Volume 6 (2006) 255–262. bbb FORUM GEOM ISSN 1534-1178 Formulas Among Diagonals in the Regular Polygon and the Catalan Numbers Matthew Hudelson Abstract. We look at relationships among the lengths of diagonals in the reg- ular polygon. Specifically, we derive formulas for all diagonals in terms of the shortest diagonals and other formulas in terms of the next-to-shortest diagonals, assuming unit side length. These formulas are independent of the number of sides of the regular polygon. We also show that the formulas in terms of the shortest diagonals involve the famous Catalan numbers. 1. Motivation In [1], Fontaine and Hurley develop formulas that relate the diagonal lengths of a regular n-gon. Specifically, given a regular convex n-gon whose vertices are P0,P1,...,Pn−1, define dk as the distance between P0 and Pk. Then the law of sines yields d sin kπ k = n . d jπ j sin n Defining kπ sin n rk = π , sin n the formulas given in [1] are min{k,h,n−k,n−h} rhrk = r|k−h|+2i−1 i=1 and 1 s = r r k(2j−1) k j=1 where s =min{j>0:jk ≡±1 mod n}. dk 1 ≤ k ≤ n − 1 rk = , Notice that for , d1 but there is no a priori restriction on k in the definition of rk. Thus, it would make perfect sense to consider r0 =0and r−k = −rk not to mention rk for non-integer values of k as well. Also, the only restriction on n in the definition of rn is that n not be zero or the reciprocal of an integer. Publication Date: October 23, 2006. Communicating Editor: Paul Yiu. 256 M. Hudelson 2. Short proofs of rk formulas 1 Using the identity sin α sin β = 2 (cos(α − β) − cos(α + β)), we can provide some short proofs of formulas equivalent, and perhaps simpler, to those in [1]: Proposition 1. For integers h and k, k−1 rhrk = rh−k+2j+1. j=0 Proof. Letting h and k be integers, we have π −2 hπ kπ rhrk =(sin ) sin sin n n n π 1 (h − k)π (h + k)π =(sin )−2 cos − cos n 2 n n π k−1 1 (h − k +2j)π (h − k +2j +2)π =(sin )−2 cos − cos n 2 n n j=0 π k−1 (h − k +2j +1)π π =(sin )−2 sin sin n n n j=0 k−1 = rh−k+2j+1. j=0 The third equality holds since the sum telescopes. Note that we can switch the roles of h and k to arrive at the formula h−1 rkrh = rk−h+2j+1. j=0 To illustrate that this is not contradictory, consider the example when k =2and h =5. From Proposition 1, we have r5r2 = r4 + r6. Reversing the roles of h and k,wehave r2r5 = r−2 + r0 + r2 + r4 + r6. Recalling that r0 =0and r−j = rj, we see that these two sums are in fact equal. The reciprocal formula in [1] is proven almost as easily: Proposition 2. Given an integer k relatively prime to n, 1 s = r r k(2j−1) k j=1 where s is any (not necessarily the smallest) positive integer such that ks ≡ ±1 mod n. Formulas among diagonals in the regular polygon and the Catalan numbers 257 Proof. Starting at the right-hand side, we have s π kπ −1 s k(2j − 1)π kπ r = sin sin sin sin k(2j−1) n n n n j=1 j=1 π kπ −1 s 1 k(2j − 2)π 2jkπ = sin sin cos − cos n n 2 n n j=1 π kπ −1 1 2skπ = sin sin cos 0 − cos n n 2 n π kπ −1 skπ = sin sin sin2 n n n π kπ −1 π = sin sin sin2 n n n kπ −1 π = sin sin n n 1 = . rk Here, the third equality follows from the telescoping sum, and the fifth follows from the definition of s. 3. From powers of r2 to Catalan numbers We use the special case of Proposition 1 when h =2, namely rkr2 = rk−1 + rk+1, to develop formulas for powers of r2. Proposition 3. For nonnegative integers m, m m r m = r . 2 i 1−m+2i i=0 Proof. We proceed by induction on m. When we have m =0, the formula reduces 0 to r2 = r1 and both sides equal 1. This establishes the basis step. For the inductive step, we assume the result for m = n and begin with the sum on the right-hand side for m = n +1. 258 M. Hudelson n+1 n+1 n +1 n n r = + r i −n+2i i i − 1 −n+2i i=0 i=0 n+1 n+1 n n = r + r i − 1 −n+2i i −n+2i i=0 i=0 n n n n = r + r j 2−n+2j i −n+2i j=0 i=0 n n = (r + r ) i −n+2i 2−n+2i i=0 n n = r r i 2 1−n+2i i=0 n = r2r2 n+1 = r2 which completes the induction. The first equality uses the standard identity for n +1 n n = + . binomial coefficients i i i − 1 The third equality is by means of the change of index j = i − 1 and the fact that n =0 c<0 c>n c if or . The fifth equality is from Proposition 1 and the sixth is from the induction hy- pothesis. Now, we use Proposition 3 and the identity r−k = −rk to consider an expression m for r2 as a linear combination of rk’s where k>0, i.e., we wish to determine the coefficients αk in the sum m+1 m r2 = αm,krk. k=1 From Proposition 2, the sum is known to end at k = m +1. In fact, we can determine αk directly. One contribution occurs when k =1− m +2i,ori = 1 2 (m + k − 1). A second contribution occurs when −k =1− m +2i,ori = 1 2 (m − k − 1). Notice that if m and k have the same parity, there is no contribution to αm,k. Piecing this information together, we find m m − , m − k α = 1 (m + k − 1) 1 (m − k − 1) if is odd; m,k 2 2 0, if m − k is even. Notice that if m − k is odd, then m m 1 = 1 . 2 (m − k +1) 2 (m + k − 1) Formulas among diagonals in the regular polygon and the Catalan numbers 259 Therefore, m m − , m + k α = 1 (m − k +1) 1 (m − k − 1) if is odd; m,k 2 2 0, if m + k is even. Intuitively, if we arrange the coefficients of the original formula in a table, in- dexed horizontally by k ∈ Z and vertically by m ∈ N, then we obtain Pascal’s triangle (with an extra row corresponding to m =0attached to the top): −2 −10123456 0 0 0 0100000 1 0 0 0010000 2 0 0 0101000 3 0 0 1020100 4 0 1 0303010 5 1 0 4060401 Next, if we subtract the column corresponding to s = −k from that correspond- ing to s = k, we obtain the αm,k array: 123456 0 100000 1 010000 2 101000 3 020100 4 203010 5 050401 As a special case of this formula, consider what happens when m =2p and k =1.Wehave 2p 2p α = − 1 p p − 1 (2p)! (2p)! = − p!p! (p − 1)!(p +1)! (2p)! p = 1 − p!p! p +1 1 2p = p +1 p which is the closed form for the pth Catalan number. 4. Inverse formulas, polynomials, and binomial coefficients We have a formula for the powers of r2 as linear combinations of the rk values. We now derive the inverse relationship, writing the rk values as linear combinations of powers of r2. We start with Proposition 1: r2rk = rk−1 + rk+1. 260 M. Hudelson We demonstrate that for natural numbers k, there exist polynomials Pk(t) such that rk = Pk(r2). We note that P0(t)=0and P1(t)=1. Now assume the existence of Pk−1(t) and Pk(t). Then from the identity rk+1 = r2rk − rk−1 we have Pk+1(t)=tPk(t) − Pk−1(t) which establishes a second-order recurrence for the polynomials Pk(t). Armed k ≥ 0 with this, we show for , k − 1 − i P (t)= (−1)itk−1−2i. k i i By inspection, this holds for k =0as the binomial coefficients are all zero in the sum. Also, when k =1, the i =0term is the only nonzero contributor to the sum. Therefore, it is immediate that this formula holds for k =0, 1. Now, we use the recurrence to establish the induction. Given k ≥ 1, Pk+1(t)=tPk(t) − Pk−1(t) k − 1 − i k − 2 − j = t (−1)itk−1−2i − (−1)jtk−2−2j i j i j k − 1 − i k − 1 − i = (−1)itk−2i − (−1)i−1tk−2i i i − 1 i i k − i = (−1)itk−2i i i as desired. The third equality is obtained by replacing j with i − 1. As a result, we obtain the desired formula for rk in terms of powers of r2: Proposition 4. k − 1 − i r = (−1)ir k−1−2i. k i 2 i Assembling these coefficients into an array similar to the αm,k array in the pre- vious section, we have 0123456 1 1000000 2 0100000 3 −1010000 4 0 −201000 5 10−30 100 6 030−4010 7 −1060−501 This array displays the coefficient β(k, m) in the formula m rk = β(k, m)r2 , m Formulas among diagonals in the regular polygon and the Catalan numbers 261 where k is the column number and m is the row number.
Load more

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]
  • 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]
  • 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]
  • 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]
  • 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]
  • A CONCISE MINI HISTORY of GEOMETRY 1. Origin And
    Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 5{21. A CONCISE MINI HISTORY OF GEOMETRY LEOPOLD VERSTRAELEN 1. Origin and development in Old Greece Mathematics was the crowning and lasting achievement of the ancient Greek cul- ture. To more or less extent, arithmetical and geometrical problems had been ex- plored already before, in several previous civilisations at various parts of the world, within a kind of practical mathematical scientific context. The knowledge which in particular as such first had been acquired in Mesopotamia and later on in Egypt, and the philosophical reflections on its meaning and its nature by \the Old Greeks", resulted in the sublime creation of mathematics as a characteristically abstract and deductive science. The name for this science, \mathematics", stems from the Greek language, and basically means \knowledge and understanding", and became of use in most other languages as well; realising however that, as a matter of fact, it is really an art to reach new knowledge and better understanding, the Dutch term for mathematics, \wiskunde", in translation: \the art to achieve wisdom", might be even more appropriate. For specimens of the human kind, \nature" essentially stands for their organised thoughts about sensations and perceptions of \their worlds outside and inside" and \doing mathematics" basically stands for their thoughtful living in \the universe" of their idealisations and abstractions of these sensations and perceptions. Or, as Stewart stated in the revised book \What is Mathematics?" of Courant and Robbins: \Mathematics links the abstract world of mental concepts to the real world of physical things without being located completely in either".
    [Show full text]
  • Understanding of Prospective Mathematics Teachers of the Concept of Diagonal
    ISSN 2087-8885 E-ISSN 2407-0610 Journal on Mathematics Education Volume 8, No. 2, July 2017, pp. 165-184 DOI: http://dx.doi.org/10.22342/jme.8.2.4102.165-184 UNDERSTANDING OF PROSPECTIVE MATHEMATICS TEACHERS OF THE CONCEPT OF DIAGONAL Ülkü Ayvaz1, Nazan Gündüz1, Figen Bozkuş2 1Abant Izzet Baysal University, 14280 Merkez/Bolu Merkez/Bolu, Turkey 2Kocaeli Universty, Turkey Email: [email protected] Abstract This study aims to investigate the concept images of prospective mathematics teachers about the concept of diagonal. With this aim, case study method was used in the study. The participants of the study were consisted of 7 prospective teachers educating at the Department of Mathematics Education. Criterion sampling method was used to select the participants and the criterion was determined as taking the course of geometry in the graduate program. Data was collected in two steps: a diagnostic test form about the definition and features of diagonal was applied to participants firstly and according to the answers of the participants to the diagnostic test form, semi-structured interviews were carried out. Data collected form the diagnostic test form and the semi-structured interviews were analyzed with descriptive analysis. According to the results of the study, it is understood that the prospective teachers had difficulties with the diagonals of parallelogram, rhombus and deltoid. Moreover, it is also seen that the prospective teachers were inadequate to support their ideas with further explanations although they could answer correctly. İt is thought that the inadequacy of the prospective teachers stems from the inadequacy related to proof.
    [Show full text]
  • Inheritance Relations of Hexagons and Ellipses Mahesh Agarwal and Narasimhamurthi Natarajan
    Mathematical Assoc. of America College Mathematics Journal 45:1 June 13, 2014 12:16 a.m. Inheritancerelations1.tex page 1 Inheritance relations of hexagons and ellipses Mahesh Agarwal and Narasimhamurthi Natarajan Recessive Gene Inside each convex hexagon ABCDEF is a diagonal hexagon, UVWXYZ its child (See figure 1). This establishes a parent-child relationship. This concept can be ex- tended to grandchildren and grandparents, etc. Brianchon’s theorem gives a criterion for inscribing an ellipse in a hexagon and Pascal’s theorem gives a criterion for cir- cumscribing an ellipse around a hexagon. So it is natural to ask, if we know that a hexagon inscribes in an ellipse, will its child or grandchild inherit this trait? Similarly, if a hexagon is circumscribed by an ellipse, will its child or grandchild inherit this trait? These are the questions we explore here, and the answer leads us to a recessive trait. We show that a hexagon can be circumscribed by an ellipse if and only if its child has an ellipse inscribed inside it. This parent-child relationship is symmetric in that a hexagon has an ellipse inscribed inside it if and only if the child can be circumscribed by an ellipse. In short, Circumscribed begets inscribed and inscribed begets circum- scribed. This shows that inscribing and circumscribing are recessive traits, in the sense that it can skip a generation but certainly resurfaces in the next. The language of projective geometry The conditions for circumscribing a hexagon by an ellipse was answered by Pascal in 1640 when he showed that for such hexagons, the points of intersections of the Figure 1.
    [Show full text]
  • Folding the Regular Pentagon Using Bisections and Perpendiculars
    Folding the Regular Pentagon Using Bisections and Perpendiculars Roger C. Alperin There are numerous origami constructions for the pentagon, see for example [3]. Dureisseix [2] provided constructions for optimal polygons inscribed in a square using origami folds. The optimal pentagon has four vertices on the four edges of the square and one vertex on the diagonal so that the pentagon has that diagonal as an axis of symmetry. However, the construction is known to be a ‘Pythagorean’ construction [1], that is, we can achieve it using only the origami bisection of angles or the construction of a perpendicular to a line through a given point. We accomplish this for a maximal inscribed pentagon in the square by modifying Dureisseix’ construction (notably in his second step). Suppose the side length of our square OPQR is one. Fold the hoizontal mid- line MN of the square parallel to RO. From the vertex P construct the diagonal PM and the angle bisector PA of ∠MPO with A on the edge RO. Let = ∠AP O, ∠ MN x = tan()=OA√, then 2 = MPO and tan(2)=2= PN ; hence x satises 2x 51 1x2 =2sox= 2 . Construct A1 on the side OP by folding A across the diagonal at O so that OA1 = OA. Construct A2 as midpoint of OA. Fold the line A2N to YN√on the 1 2 midline MN by using a bisection of MNA2. The length of YN is y = 1+x √ √ 2 102 5 so y = 4 . YN B1A1 Now we determine the product xy using similar triangles: 2y = 1 = A O = 2 1 B1A1 x .
    [Show full text]