DOCSLIB.ORG

The Mathematics of Origami

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Mathematics of Origami The Mathematics of Origami Moti Ben-Ari http://www.weizmann.ac.il/sci-tea/benari/ Version 4 © 2020 Moti Ben-Ari This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-sa/3.0/ or send a letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. Contents 1 Introduction 4 2 Axioms 5 2.1 Axiom 1 . .5 2.2 Axiom 2 . .6 2.3 Axiom 3 . .7 2.4 Axiom 4 . 10 2.5 Axiom 5 . 11 2.6 Axiom 6 . 13 2.7 Axiom 7 . 19 3 Trisecting an Angle 21 3.1 Abe’s trisection of an angle . 21 3.2 Martin’s trisection of an angle . 24 4 Doubling a Cube 25 4.1 Messer’s doubling of a cube . 25 4.2 Beloch’s doubling of a cube . 28 5 Lill’s Method for Finding Roots 30 5.1 Magic . 30 5.2 Introduction . 31 5.3 Multiple roots . 32 5.4 Paths that do not lead to roots . 33 5.5 Specification of Lill’s method . 34 5.6 Negative coefficients . 35 5.7 Zero coefficients . 36 5.8 Non-integer roots . 37 5.9 The cube root of two . 38 5.10 Proof of Lill’s method . 39 2 6 Beloch’s Fold and Beloch’s Square 40 6.1 The Beloch fold . 40 6.2 The Beloch square . 43 7 Constructing a Nonagon 44 7.1 Construction of regular polygons . 44 7.2 The cubic equation for a nonagon . 44 7.3 Solving the equation with Beloch’s fold . 45 7.4 Constructing the central angle of the nonagon . 46 A GeoGebra links 49 B Derivation of trigonometric identities 50 C Parabolas 51 D Tangents Common to Two Parabolas 53 3 Chapter 1 Introduction This document develops the mathematics of origami using secondary-school mathematics. Equations of lines are given in the slope-intercept form y = mx + b. Chapter 2 develops the mathematical formulas for the seven axioms and together with numerical examples. In the diagrams, given lines are solid, folds are dashed, auxiliary lines are dotted, and dotted arrows indicate the direction of folding the paper. The fold operations can construct every length that can be constructed by straightedge and p compass. Given a, b: a + b, a − b, a × b, a/b, a can be constructed [6, Chapter 4]. Folding is more powerful because it can construct cube roots. Chapter 3 presents two methods for trisecting an arbitrary angle and Chapter 4 presents two methods for doubling a cube. Chapter 5 explains Eduard Lill’s geometric method for finding real roots of any polynomical; we will demonstrate the method for cubic polynomials. Chapter 6 presents Margharita P. Beloch’s implementation of Lill’ method using a fold. Appendix A contains links to GeoGebra projects that visualize the axioms. Appendix B derives trigonometric identities for tangents that may not be familiar. Appendix C explains the geometric definition of parabolas. Definitions Each axiom states that a fold exists that will place given points and lines onto points and lines, such that certain properties hold. The term fold comes from the origami operation of folding a piece of paper, but here it is used to refer the geometric line that would be created by folding the paper. Formal definitions are given in [7, Chapter 10]. The reader should be aware that, by definition, folds result in reflections. Given a point p, its reflection around a fold l results in a point p0, such that l is the perpendicular bisector of the line segment pp0: p0 l p 4 Chapter 2 Axioms 2.1 Axiom 1 Axiom Given two distinct points p1 = (x1, y1), p2 = (x2, y2), there is a unique fold l that passes through both of them. 6 5 p2 l 4 3 p1 2 1 0 1 2 3 4 5 6 7 8 Derivation of the equation of the fold The equation of fold l is derived from the coordinates of p1 and p2: the slope is the quotient of the differences of the coordinates and the intercept is derived from p1: y2 − y1 y − y1 = (x − x1) . (2.1) x2 − x1 Example Let p1 = (2, 2), p2 = (6, 4). The equation of l is: 4 − 2 y − 2 = (x − 2) 6 − 2 1 y = x + 1 . 2 5 2.2 Axiom 2 Axiom Given two distinct points p1 = (x1, y1), p2 = (x2, y2), there is a unique fold l that places p1 onto p2. 6 5 l p2 4 3 p1 2 1 0 1 2 3 4 5 6 7 8 Derivation of the equation of the fold The fold l is the perpendicular bisector of p1 p2. Its slope is the negative reciprocal of the slope of the line connecting p1 and p2. l passes through the midpoint between the points: y + y x − x x + x y − 1 2 = − 2 1 x − 1 2 . (2.2) 2 y2 − y1 2 Example Let p1 = (2, 2), p2 = (6, 4). The equation of l is: 2 + 4 6 − 2 2 + 6 y − = − x − 2 4 − 2 2 y = −2x + 11 . 6 2.3 Axiom 3 Axiom Given two lines l1 and l2, there is a fold l that places l1 onto l2. 7 6 b b a 5 l f1 a pi 4 3 l1 2 l2 1 l f2 0 1 2 3 4 5 6 7 8 Derivation of the equation of the fold If the lines are parallel, let l1 be y = mx + b1 and let l2 be y = mx + b2. The fold is the line b + b parallel to l , l and halfway between them y = mx + 1 2 . 1 2 2 If the lines intersect, let l1 be y = m1x + b1 and let l2 be y = m2x + b2. Derivation of the point of intersection pi = (xi, yi), the point of intersection of the two lines, is: m1xi + b2 = m2xi + b2 b2 − b1 xi = m1 − m2 yi = m1xi + b1 . Example Let l1 be y = 2x − 2 and let l2 be y = −x + 8. The point of intersection is: 8 − (−2) 10 x = = ≈ 3.33 i 2 − (−1) 3 10 14 y = 2 · − 2 = ≈ 4.67 . i 3 3 7 Derivation of the equation of the slope of the angle bisector The two lines form an angle at their point of intersection, actually, two pairs of vertical angles. The folds are the bisectors of these angles. If the angle of line l1 relative to the x-axis is q1 and the angle of line l2 relative to the x-axis is q + q q , then the fold is the line which makes an angle of q = 1 2 with the x-axis. 2 b 2 tan q1 = m1 and tan q2 = m2 are given and mb, the slope of the angle bisector, is: q + q m = tan q = tan 1 2 . b b 2 The derivation requires the use of the following trigonometric identities:1 tan a1 + tan a2 tan(a1 + a2) = 1 − tan a1 tan a2 p a −1 ± 1 + tan2 a tan = . 2 tan a First derive ms, the slope of q1 + q2: m1 + m2 ms = tan(q1 + q2) = . 1 − m1m2 Then derive mb, the slope of the angle bisector: q + q m = tan 1 2 b 2 p −1 ± 1 + tan2(q + q ) = 1 2 tan(q1 + q2) p −1 ± 1 + m2 = s . ms Example For the lines y = 2x − 2 and y = −x + 8, the slope of the angle bisector is: 2 + (−1) 1 m = = s 1 − (2 · −1) 3 p −1 ± 1 + (1/3)2 p m = = −3 ± 10 ≈ −6.16, 0.162 . b 1/3 1The derivation of these identities is given in Appendix B. 8 Derivation of the equation of the fold Let us derive equation of the fold l f1 with the positive slope; we know the coordinates of the 10 14 intersection of the two lines m = , : i 3 3 14 p 10 = (−3 + 10) · + b 3 3 p 44 − 10 10 b = 3 p p 44 − 10 10 y = (−3 + 10)x + ≈ 0.162x + 4.13 . 3 9 2.4 Axiom 4 Axiom Given a point p1 and a line l1, there is a unique fold l perpendicular to l1 that passes through point p1. 7 p1 6 5 4 l 3 2 1 l1 0 1 2 3 4 5 6 7 8 Derivation of the equation of the fold 1 Let l1 be y = m1x + b1 and let p1 = (x1, y1). l is perpendicular to l1 so its slope is − . Since m1 it passes through p1, we can compute the intercept b and write down its equation: 1 y = − x + b 1 m 1 (my + x ) b = 1 1 m 1 (my + x ) y = − x + 1 1 . m m Example Let p1 = (2, 6) and let l1 be y = 2x − 4. The equation of the fold l is: 1 2 · 6 + 2 1 y = − x + = − x + 7 . 2 2 2 10 2.5 Axiom 5 Axiom Given two points p1, p2 and a line l1, there is a fold l that places p1 onto l1 and passes through p2. 9 p1 8 7 6 l f1 5 p2 0 4 p1 3 l f2 2 1 00 p1 0 1 2 3 4 5 6 7 8 9 l1 For a given pair of points and a line, there may be zero, one or two folds. Derivation of the equations of the reflections 0 Let l be a fold through p2 and p1 be the reflection of p1 around l.
Load more

Recommended publications
  • A Quartically Convergent Square Root Algorithm: an Exercise in Forensic Paleo-Mathematics
    A Quartically Convergent Square Root Algorithm: An Exercise in Forensic Paleo-Mathematics David H Bailey, Lawrence Berkeley National Lab, USA DHB’s website: http://crd.lbl.gov/~dhbailey! Collaborator: Jonathan M. Borwein, University of Newcastle, Australia 1 A quartically convergent algorithm for Pi: Jon and Peter Borwein’s first “big” result In 1985, Jonathan and Peter Borwein published a “quartically convergent” algorithm for π. “Quartically convergent” means that each iteration approximately quadruples the number of correct digits (provided all iterations are performed with full precision): Set a0 = 6 - sqrt[2], and y0 = sqrt[2] - 1. Then iterate: 1 (1 y4)1/4 y = − − k k+1 1+(1 y4)1/4 − k a = a (1 + y )4 22k+3y (1 + y + y2 ) k+1 k k+1 − k+1 k+1 k+1 Then ak, converge quartically to 1/π. This algorithm, together with the Salamin-Brent scheme, has been employed in numerous computations of π. Both this and the Salamin-Brent scheme are based on the arithmetic-geometric mean and some ideas due to Gauss, but evidently he (nor anyone else until 1976) ever saw the connection to computation. Perhaps no one in the pre-computer age was accustomed to an “iterative” algorithm? Ref: J. M. Borwein and P. B. Borwein, Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity}, John Wiley, New York, 1987. 2 A quartically convergent algorithm for square roots I have found a quartically convergent algorithm for square roots in a little-known manuscript: · To compute the square root of q, let x0 be the initial approximation.
    [Show full text]
  • Solving Cubic Polynomials
    Solving Cubic Polynomials 1.1 The general solution to the quadratic equation There are four steps to finding the zeroes of a quadratic polynomial. 1. First divide by the leading term, making the polynomial monic. a 2. Then, given x2 + a x + a , substitute x = y − 1 to obtain an equation without the linear term. 1 0 2 (This is the \depressed" equation.) 3. Solve then for y as a square root. (Remember to use both signs of the square root.) a 4. Once this is done, recover x using the fact that x = y − 1 . 2 For example, let's solve 2x2 + 7x − 15 = 0: First, we divide both sides by 2 to create an equation with leading term equal to one: 7 15 x2 + x − = 0: 2 2 a 7 Then replace x by x = y − 1 = y − to obtain: 2 4 169 y2 = 16 Solve for y: 13 13 y = or − 4 4 Then, solving back for x, we have 3 x = or − 5: 2 This method is equivalent to \completing the square" and is the steps taken in developing the much- memorized quadratic formula. For example, if the original equation is our \high school quadratic" ax2 + bx + c = 0 then the first step creates the equation b c x2 + x + = 0: a a b We then write x = y − and obtain, after simplifying, 2a b2 − 4ac y2 − = 0 4a2 so that p b2 − 4ac y = ± 2a and so p b b2 − 4ac x = − ± : 2a 2a 1 The solutions to this quadratic depend heavily on the value of b2 − 4ac.
    [Show full text]
  • Chapter 5 Complex Numbers
    Chapter 5 Complex numbers Why be one-dimensional when you can be two-dimensional? ? 3 2 1 0 1 2 3 − − − ? We begin by returning to the familiar number line, where I have placed the question marks there appear to be no numbers. I shall rectify this by defining the complex numbers which give us a number plane rather than just a number line. Complex numbers play a fundamental rˆolein mathematics. In this chapter, I shall use them to show how e and π are connected and how certain primes can be factorized. They are also fundamental to physics where they are used in quantum mechanics. 5.1 Complex number arithmetic In the set of real numbers we can add, subtract, multiply and divide, but we cannot always extract square roots. For example, the real number 1 has 125 126 CHAPTER 5. COMPLEX NUMBERS the two real square roots 1 and 1, whereas the real number 1 has no real square roots, the reason being that− the square of any real non-zero− number is always positive. In this section, we shall repair this lack of square roots and, as we shall learn, we shall in fact have achieved much more than this. Com- plex numbers were first studied in the 1500’s but were only fully accepted and used in the 1800’s. Warning! If r is a positive real number then √r is usually interpreted to mean the positive square root. If I want to emphasize that both square roots need to be considered I shall write √r.
    [Show full text]
  • A Historical Survey of Methods of Solving Cubic Equations Minna Burgess Connor
    University of Richmond UR Scholarship Repository Master's Theses Student Research 7-1-1956 A historical survey of methods of solving cubic equations Minna Burgess Connor Follow this and additional works at: http://scholarship.richmond.edu/masters-theses Recommended Citation Connor, Minna Burgess, "A historical survey of methods of solving cubic equations" (1956). Master's Theses. Paper 114. This Thesis is brought to you for free and open access by the Student Research at UR Scholarship Repository. It has been accepted for inclusion in Master's Theses by an authorized administrator of UR Scholarship Repository. For more information, please contact [email protected]. A HISTORICAL SURVEY OF METHODS OF SOLVING CUBIC E<~UATIONS A Thesis Presented' to the Faculty or the Department of Mathematics University of Richmond In Partial Fulfillment ot the Requirements tor the Degree Master of Science by Minna Burgess Connor August 1956 LIBRARY UNIVERStTY OF RICHMOND VIRGlNIA 23173 - . TABLE Olf CONTENTS CHAPTER PAGE OUTLINE OF HISTORY INTRODUCTION' I. THE BABYLONIANS l) II. THE GREEKS 16 III. THE HINDUS 32 IV. THE CHINESE, lAPANESE AND 31 ARABS v. THE RENAISSANCE 47 VI. THE SEVEW.l'EEl'iTH AND S6 EIGHTEENTH CENTURIES VII. THE NINETEENTH AND 70 TWENTIETH C:BNTURIES VIII• CONCLUSION, BIBLIOGRAPHY 76 AND NOTES OUTLINE OF HISTORY OF SOLUTIONS I. The Babylonians (1800 B. c.) Solutions by use ot. :tables II. The Greeks·. cs·oo ·B.c,. - )00 A~D.) Hippocrates of Chios (~440) Hippias ot Elis (•420) (the quadratrix) Archytas (~400) _ .M~naeobmus J ""375) ,{,conic section~) Archimedes (-240) {conioisections) Nicomedea (-180) (the conchoid) Diophantus ot Alexander (75) (right-angled tr~angle) Pappus (300) · III.
    [Show full text]
  • The Evolution of Equation-Solving: Linear, Quadratic, and Cubic
    California State University, San Bernardino CSUSB ScholarWorks Theses Digitization Project John M. Pfau Library 2006 The evolution of equation-solving: Linear, quadratic, and cubic Annabelle Louise Porter Follow this and additional works at: https://scholarworks.lib.csusb.edu/etd-project Part of the Mathematics Commons Recommended Citation Porter, Annabelle Louise, "The evolution of equation-solving: Linear, quadratic, and cubic" (2006). Theses Digitization Project. 3069. https://scholarworks.lib.csusb.edu/etd-project/3069 This Thesis is brought to you for free and open access by the John M. Pfau Library at CSUSB ScholarWorks. It has been accepted for inclusion in Theses Digitization Project by an authorized administrator of CSUSB ScholarWorks. For more information, please contact [email protected]. THE EVOLUTION OF EQUATION-SOLVING LINEAR, QUADRATIC, AND CUBIC A Project Presented to the Faculty of California State University, San Bernardino In Partial Fulfillment of the Requirements for the Degre Master of Arts in Teaching: Mathematics by Annabelle Louise Porter June 2006 THE EVOLUTION OF EQUATION-SOLVING: LINEAR, QUADRATIC, AND CUBIC A Project Presented to the Faculty of California State University, San Bernardino by Annabelle Louise Porter June 2006 Approved by: Shawnee McMurran, Committee Chair Date Laura Wallace, Committee Member , (Committee Member Peter Williams, Chair Davida Fischman Department of Mathematics MAT Coordinator Department of Mathematics ABSTRACT Algebra and algebraic thinking have been cornerstones of problem solving in many different cultures over time. Since ancient times, algebra has been used and developed in cultures around the world, and has undergone quite a bit of transformation. This paper is intended as a professional developmental tool to help secondary algebra teachers understand the concepts underlying the algorithms we use, how these algorithms developed, and why they work.
    [Show full text]
  • Real Numbers 6.3B
    6.3b Real Numbers Lesson Tutorials A cube root of a number is a number that when multiplied by itself, and then multiplied by itself again, equals the given number. A perfect cube is a number that can be written as the cube of an integer. EXAMPLE 1 Finding Cube Roots Find the cube root of each number. a. 8 b. −27 2 ⋅ 2 ⋅ 2 = 8 −3 ⋅ (−3) ⋅ (−3) = −27 So, the cube root of 8 is 2. So, the cube root of − 27 is − 3. 3 — The symbol √ is used to represent a cube root. Cubing a number and fi nding a cube root are inverse operations. Use this relationship to solve equations involving cubes. EXAMPLE 2 Solving an Equation Find the surface area of the cube. Volume ä 125 ft3 Use the formula for the volume of a cube to fi nd the side length s. Remember s V = s 3 Write formula for volume. The volume V of a cube = 3 with side length s is 125 s Substitute 125 for V. 3 — — given by V = s . The 3 3 3 s √ 125 = √ s Take the cube root of each side. surface area S is given s by S = 6s 2. 5 = s Simplify. The side length is 5 feet. Use a formula to fi nd the surface area of the cube. S = 6s 2 Write formula for surface area. = 6(5)2 Substitute 5 for s. = 150 Simplify. The surface area of the cube is 150 square feet. Find the cube root of the number. 1.
    [Show full text]
  • And Cubic Equations by the Odd Number Method 1
    Calculating Machine Solution of Quadratic and Cubic Equations by the Odd Number Method 1. Introduction. Eastlack1 has published a method for the solution of quadratic equations by means of a calculating machine. His process is ex- tended here to the solution of cubic equations. In the ordinary manual operation of calculating machines, the use of the method of solving cubic equations presented here will not be found to be as convenient as the use of certain other methods, such as that of Newton. The method is described here, however, in the belief that it may find application in large scale, automatic computing machines (such as the IBM Sequence Controlled Calculator or the ENIAC) where a large number of operations is not objec- tionable, provided that the operations are repetitive and sufficiently simple. We limit our discussion to real roots. Eastlack's method of solving quadratic equations is first reviewed so that the extension of the method to cubic equa- tions may be clearer. 2. Extraction of square roots by the odd number method. The ordinary method for finding on the calculating machine the square root of a number of 3 or 4 digits of the form (10* + y)2 = 100*2 + 20*y + y1 consists in removing the 100*2 term by subtracting the x odd numbers, 1, 3, 5, • • -, (2x — 1), from the first one or two digits of (10* + y)2, and then removing the remainder of (10* + y)2 by subtracting the y numbers, (20* + 1), (20* + 3), • • -, (20* + 2y - 1). This process of square root extraction may evidently be extended to the evaluation of roots having more than two digits.
    [Show full text]
  • How Cubic Equations (And Not Quadratic) Led to Complex Numbers
    How Cubic Equations (and Not Quadratic) Led to Complex Numbers J. B. Thoo Yuba College 2013 AMATYC Conference, Anaheim, California This presentation was produced usingLATEX with C. Campani’s BeamerLATEX class and saved as a PDF file: <http://bitbucket.org/rivanvx/beamer>. See Norm Matloff’s web page <http://heather.cs.ucdavis.edu/~matloff/beamer.html> for a quick tutorial. Disclaimer: Our slides here won’t show off what Beamer can do. Sorry. :-) Are you sitting in the right room? This talk is about the solution of the general cubic equation, and how the solution of the general cubic equation led mathematicians to study complex numbers seriously. This, in turn, encouraged mathematicians to forge ahead in algebra to arrive at the modern theory of groups and rings. Hence, the solution of the general cubic equation marks a watershed in the history of algebra. We shall spend a fair amount of time on Cardano’s solution of the general cubic equation as it appears in his seminal work, Ars magna (The Great Art). Outline of the talk Motivation: square roots of negative numbers The quadratic formula: long known The cubic formula: what is it? Brief history of the solution of the cubic equation Examples from Cardano’s Ars magna Bombelli’s famous example Brief history of complex numbers The fundamental theorem of algebra References Girolamo Cardano, The Rules of Algebra (Ars Magna), translated by T. Richard Witmer, Dover Publications, Inc. (1968). Roger Cooke, The History of Mathematics: A Brief Course, second edition, Wiley Interscience (2005). Victor J. Katz, A History of Mathematics: An Introduction, third edition, Addison-Wesley (2009).
    [Show full text]
  • An Analysis on Extracting Square and Cube Roots by Aryabhata's Methods
    ADBU-Journal of Engineering Technology An Analysis on Extracting Square and Cube Roots by Aryabhata’s Methods. Yumnam Kirani Singh, C-DAC, IIPC Building, NIT Campus, Silchar, Assam. Email:yumnam.singh[@]cdac.in Abstract— Finding accurate root of a number is still considered as challenging in computer science community. The only popularly known method to compute root is the long division method of finding square root. Aryabhata contributed two methods similar to long division method to compute square root and cube root. In recent years, his methods have also been studied, explained and tried to implement as computer algorithms. The explained methods and proposed algorithms fail to give correct results. Some analyses have been made on these methods in order to ascertain why the algorithms fail. Improved algorithms have been provided to give correct result while computing square root or cube root using Aryabhata’s methods. Keywords—cube root, square root, Bino’s Model of multiplication, Large number manipulation, Long division method, Aryabhata’s methods. (Article history: Received 12 November 2016 and accepted 30 December 2016) In this paper, the algorithms for extraction of square root and I. INTRODUCTION cube root using Aryabhata’s methods are analyzed and Aryabhatta is one of the most revered ancient Indian improved so that it gives for correct results while computing mathematicians who made significant contributions in various the roots. The paper is divided into four sections. Section II fields of mathematics and astronomy [1, 2]. His contribution discusses algorithm for extraction of square root and section in mathematics has also been studied for possible applications III discusses the algorithm to compute cube root.
    [Show full text]
  • Equation Solving in Indian Mathematics
    U.U.D.M. Project Report 2018:27 Equation Solving in Indian Mathematics Rania Al Homsi Examensarbete i matematik, 15 hp Handledare: Veronica Crispin Quinonez Examinator: Martin Herschend Juni 2018 Department of Mathematics Uppsala University Equation Solving in Indian Mathematics Rania Al Homsi “We owe a lot to the ancient Indians teaching us how to count. Without which most modern scientific discoveries would have been impossible” Albert Einstein Sammanfattning Matematik i antika och medeltida Indien har påverkat utvecklingen av modern matematik signifi- kant. Vissa människor vet de matematiska prestationer som har sitt urspring i Indien och har haft djupgående inverkan på matematiska världen, medan andra gör det inte. Ekvationer var ett av de områden som indiska lärda var mycket intresserade av. Vad är de viktigaste indiska bidrag i mate- matik? Hur kunde de indiska matematikerna lösa matematiska problem samt ekvationer? Indiska matematiker uppfann geniala metoder för att hitta lösningar för ekvationer av första graden med en eller flera okända. De studerade också ekvationer av andra graden och hittade heltalslösningar för dem. Denna uppsats presenterar en litteraturstudie om indisk matematik. Den ger en kort översyn om ma- tematikens historia i Indien under många hundra år och handlar om de olika indiska metoderna för att lösa olika typer av ekvationer. Uppsatsen kommer att delas in i fyra avsnitt: 1) Kvadratisk och kubisk extraktion av Aryabhata 2) Kuttaka av Aryabhata för att lösa den linjära ekvationen på formen 푐 = 푎푥 + 푏푦 3) Bhavana-metoden av Brahmagupta för att lösa kvadratisk ekvation på formen 퐷푥2 + 1 = 푦2 4) Chakravala-metoden som är en annan metod av Bhaskara och Jayadeva för att lösa kvadratisk ekvation 퐷푥2 + 1 = 푦2.
    [Show full text]
  • An Episode of the Story of the Cubic Equation: the Del Ferro-Tartaglia-Cardano’S Formulas
    An Episode of the Story of the Cubic Equation: The del Ferro-Tartaglia-Cardano’s Formulas José N. Contreras, Ph.D. † Abstra ct In this paper, I discuss the contributions of del Ferro, Tartaglia, and Cardano in the development of algebra, specifically determining the formula to solve cubic equations in one variable. To contextualize their contributions, brief biographical sketches are included. A brief discussion of the influence of Ars Magna , Cardano’s masterpiece, in the development of algebra is also included. Introduction Our mathematical story takes place in the Renaissance era, specifically in sixteenth-century Italy. The Renaissance was a period of cultural, scientific, technology, and intellectual accomplishments. Vesalius’s On the Structure of the Human Body revolutionized the field of human anatomy while Copernicus’ On the Revolutions of the Heavenly Spheres transformed drastically astronomy; both texts were published in 1543. Soon after the publication of these two influential scientific treatises, a breakthrough in mathematics was unveiled in a book on algebra whose author, Girolamo Cardano (1501-1576), exemplifies the common notion of Renaissance man. As a universal scholar, Cardano was a physician, mathematician, natural philosopher, astrologer, and interpreter of dreams. Cardano’s book, Ars Magna ( The Great Art ), was published in 1545. As soon as Ars Magna appeared in print, the algebraist Niccolo Fontana (1499- 1557), better known as Tartaglia – the stammerer– was outraged and furiously accused the author of deceit, treachery, and violation of an oath sworn on the Sacred Gospels. The attacks and counterattacks set the stage for a fierce battle between the two mathematicians. What does Ars Magna contain that triggered one of the greatest feuds in the history of mathematics? (Helman, 2006).
    [Show full text]
  • Fast Calculation of Cube and Inverse Cube Roots Using a Magic Constant and Its Implementation on Microcontrollers
    energies Article Fast Calculation of Cube and Inverse Cube Roots Using a Magic Constant and Its Implementation on Microcontrollers Leonid Moroz 1, Volodymyr Samotyy 2,* , Cezary J. Walczyk 3 and Jan L. Cie´sli´nski 3 1 Department of Information Technologies Security, Institute of Computer Technologies, Automation, and Metrology, Lviv Polytechnic National University, 79013 Lviv, Ukraine; [email protected] 2 Department of Automatic Control and Information Technology, Faculty of Electrical and Computer Engineering, Cracow University of Technology, 31155 Cracow, Poland 3 Department of Mathematical Methods in Physics, Faculty of Physics, University of Bialystok, 15245 Bialystok, Poland; [email protected] (C.J.W.); [email protected] (J.L.C.) * Correspondence: [email protected] Abstract: We develop a bit manipulation technique for single precision floating point numbers which leads to new algorithms for fast computation of the cube root and inverse cube root. It uses the modified iterative Newton–Raphson method (the first order of convergence) and Householder method (the second order of convergence) to increase the accuracy of the results. The proposed algo- rithms demonstrate high efficiency and reduce error several times in the first iteration in comparison with known algorithms. After two iterations 22.84 correct bits were obtained for single precision. Experimental tests showed that our novel algorithm is faster and more accurate than library functions for microcontrollers. Keywords: floating point; cube root; inverse cube root; Newton–Raphson; Householder Citation: Moroz, L.; Samotyy, V.; Walczyk, C.J.; Cie´sli´nski,J.L. Fast 1. Introduction Calculation of Cube and Inverse Cube Roots Using a Magic Constant and Its The operation of extracting a cube and inverse cube root is not as common as adding, Implementation on Microcontrollers.
    [Show full text]