Approximating Square Roots and Cube Roots

Total Page:16

File Type:pdf, Size:1020Kb

Approximating Square Roots and Cube Roots Simple formulas … Approximating Square Roots and Cube Roots feature Do they work? The idea of equivalent geometric forms is used in this study to devise simple formulas to estimate the square root and the cube root of an arbitrary positive number. The resulting formulas are easy to use and they don’t take much time to calculate. They give excellent estimates which compare very favourably with those given by a pocket calculator. Introductory Remarks Ali Ibrahim Hussen Historically the Babylonians were the �irst to devise an iterative method for computing square roots of numbers using rational operations that are easy to carry out ([1], [2]). The ancient Chinese method (200 BCE), commented on by Liu Hui in the third century CE, is similar in procedure to the long division method used in schools even today ([2]). The Greek mathematician Heron of �lexandria, who gave the �irst explicit description of the Babylonians iterative method, also devised a method for cube root calculation in the �irst century CE ([�]). In ��� CE, �ryabhata (Indian mathematician and astronomer) gave a method for computing cube roots of numbers of arbitrary size ([5]). In the sixteenth century, Isaac Newton devised an iterative method used to calculate square and cube roots of arbitrary numbers. The method used in this article is different from the methods mentioned above. It is based on the idea of changing a geometric Keywords: Square root, cube root, estimation, accuracy, geometric mean, harmonic mean, inequality, square, cube 11 At Right Angles | Vol. 4, No. 1, March 2015 Vol. 4, No. 1, March 2015 | At Right Angles 11 �igure or form into an equivalent ‘regular’ one numbers are close to one another, then the AM is We can do better that this by taking and estimate quite close to the GM. To our surprise, with equal area or volume, e.g. changing a quite close to the GM. . Then our estimate for √ is: we �ind that thissecond idea algorithmworks very well. rectangle into a square, or a rectangular cuboid Geometrically this may be viewed as follows. 96 푎 So here is our for approximating into a cube. � 푎 � � � Assume that . Within the rectangle we 2 2 the square root of aAlgorithm given positive II number . The idea was used by ancient Indian engineers draw a square on the shorter side , then slice the 96 Step 1: who worked with designing and constructing leftover portion into two equal halves and stack ≈ 6 62 Write as ×where and are temples (600 BCE). TheySulba-sutras used a practical method them (one each) on to two adjacent sides of the TheSecond error approach now is about to approximating2%. square Step 2: for changing a rectangle into a square. The square (Figure� 2). The resulting shape is a square reasonably close to each other. method appears in the by of side � ( minus a small piece in the corner, roots. � Step 3: � Compute the AM and the HM of and . Baudhayana (Sulba-sutras means the ‘Rule of the which is a square of side | |. If is close to , In the study of statistics we encounter Chord’) ([6]). The idea is used also by David W. then this portion will be very small. So if we Compute the average of the AM and HM severalarithmetic different mean kinds of meansgeometric de�ined for mean any Henderson in his attempt to solve quadratic and ignore the little square, the larger square may be given pair of positive numbers and .Wehave computed in Step 2. That is, compute: First approach to approximating square roots. harmonic mean cubic equations geometrically ([7]). In our case taken to be the one we seek. the (AM), the �irst algorithm 푎 2 an algebraic analysis is performed instead of a (GM) and the (HM), among � 푎 � geometric one. 2 2 푎 The above reasoning gives us our many others (not listed here). These are de�ined 1. Estimation of Square Roots for approximating the square root of a given as follows: This is our estimate for √. positive number . Algorithm I 2 This algorithm gives us extremely good results — Step 1: AM (푎 GM √ HM Let be the given number whose square root is 2 푎 far better than we would expect! The following Example 3. required. (Here, of course, is positive.) We start Write as where and are close �ach of these has its signi�icance and uses. �f examples illustrate this. by expressing as a product , with as close to toStep each 2: other. particular interest to us is the fact that if , Let 6. Let us take 24 and as possible (the closer the better). The task of � then: � 25. Then our estimate for √6 is: computing √√ may be expressed Then our estimate of √ is ( . HM < GM < AM geometrically as: Construct a square whose area always 24푎25 2×24×25 2 The closer and are to each other, the better � 푎 � �245 푎 � is equal to that of a rectangle with dimensions These inequalities are never violated. The HM and 2 2 24푎25 2 49 will be our estimate. (Figure 1). AM lie on opposite sides of the GM. 4 ≈244949795 This algorithm gives us fairly good results For example, if 2 and , then 96 a √ab provided we are wise in our initial choice of Compare this with the true value: Example 1. numbers. The following examples illustrate this. AM (2 푎 5 GM √2×4 √6 244949742 …. The estimate is correct to 2 Example 4. b Let . Let us take and 2×2× seven decimal places. HM 2 Figure 1. � . Then our estimate for √ is 2푎 Let . Let us take and � ( . This may be compared with and, of course, 2<4<5. . Then our estimate for √ is: the actual value which is roughly 9 (an error geometric mean ofExample about 0 2.0%). 푎 2× × 9 6 Recall that in our approach we start by selecting � 푎 � � 푎 � positive numbers and such that . We 2 2 푎 2 6 9 Now note that √ is the (GM) of Let 0. Let us take and arithmetic mean wish to compute the GM of and . But as the GM 72 the quantities and . We may try to approximate � . Then our estimate for √0 is ≈ 622 is dif�icult to compute, we choose to compute the 22 the GM by the (AM) of and . It � (0 9 ≈ 7. This may be AM instead. We could also choose to compute the is well known that the AM exceeds the GM compared with the actual value which is roughly This estimate is correct to four decimal places. HM (this too is an easy computation). Whichever (strictly) if the numbers are unequal. But if the (an error of about 0%). (TheExample true 5. value is 6227766 ….) b (a + b)/2 one we choose to compute will then be our estimate for the GM. over-estimate Let 2. Let us take 45 92 and 245 49. Then our estimate for If we use the AM, we always get an a under-estimate √2 is: (a + b)/2 for the GM. And if we use the HM, we always get 92푎49 2×92×49 Empty square an . � 푎 � 2 2 92푎49 of side 1 a b both 2 Now an interesting idea strikes us: why not | − | 6 72 54 compute the AM and HM, and then take their � 푎 � ≈44725955 Figure 2. 2 6 6 592 average? Their respective errors may then just cancel each other, and we may just get an This estimate is correct to eight decimal places. 1312 At Right Angles | Vol. 4, No. 1, March 2015 Vol. 4, No. 1, March 2015 | At Right Angles 1312 2 At Right Angles ∣ Vol. 4, No. 1, March 2015 Vol. 4, No. 1, March 2015 ∣ At Right Angles 3 We can do better that this by taking and estimate quite close to the GM. To our surprise, . Then our estimate for √ is: we �ind that thissecond idea algorithmworks very well. 96 푎 So here is our for approximating � 푎 � � � 2 2 the square root of aAlgorithm given positive II number . 96 Step 1: ≈ 6 62 Write as ×where and are TheSecond error approach now is about to approximating2%. square reasonablyStep 2: close to each other. roots. Step 3: Compute the AM and the HM of and . In the study of statistics we encounter Compute the average of the AM and HM severalarithmetic different mean kinds of meansgeometric de�ined for mean any computed in Step 2. That is, compute: given pair of positiveharmonic numbers mean and .Wehave the (AM), the 푎 2 (GM) and the (HM), among � 푎 � 2 2 푎 many others (not listed here). These are de�ined as follows: This is our estimate for √. 2 AM (푎 GM √ HM This algorithm gives us extremely good results — 2 푎 far better than we would expect! The following �ach of these has its signi�icance and uses. �f examplesExample 3. illustrate this. particular interest to us is the fact that if , Let 6. Let us take 24 and then: 25. Then our estimate for √6 is: HM < GM < AM always 24푎25 2×24×25 2 � 푎 � �245 푎 � These inequalities are never violated. The HM and 2 2 24푎25 2 49 AM lie on opposite sides of the GM. 4 ≈244949795 For example, if 2 and , then 96 Compare this with the true value: AM (2 푎 5 GM √2×4 6 244949742 …. The estimate is correct to 2 √ Example 4. 2×2× seven decimal places. HM 2 2푎 Let . Let us take and and, of course, 2<4<5. . Then our estimate for √ is: 푎 2× × 9 6 Recall that in our approach we start by selecting � 푎 � � 푎 � positive numbers and such that .
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]