A Historical Survey of Methods of Solving Cubic Equations Minna Burgess Connor
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Symmetry and the Cubic Formula
SYMMETRY AND THE CUBIC FORMULA DAVID CORWIN The purpose of this talk is to derive the cubic formula. But rather than finding the exact formula, I'm going to prove that there is a cubic formula. The way I'm going to do this uses symmetry in a very elegant way, and it foreshadows Galois theory. Note that this material comes almost entirely from the first chapter of http://homepages.warwick.ac.uk/~masda/MA3D5/Galois.pdf. 1. Deriving the Quadratic Formula Before discussing the cubic formula, I would like to consider the quadratic formula. While I'm expecting you know the quadratic formula already, I'd like to treat this case first in order to motivate what we will do with the cubic formula. Suppose we're solving f(x) = x2 + bx + c = 0: We know this factors as f(x) = (x − α)(x − β) where α; β are some complex numbers, and the problem is to find α; β in terms of b; c. To go the other way around, we can multiply out the expression above to get (x − α)(x − β) = x2 − (α + β)x + αβ; which means that b = −(α + β) and c = αβ. Notice that each of these expressions doesn't change when we interchange α and β. This should be the case, since after all, we labeled the two roots α and β arbitrarily. This means that any expression we get for α should equally be an expression for β. That is, one formula should produce two values. We say there is an ambiguity here; it's ambiguous whether the formula gives us α or β. -
Sripati: an Eleventh-Century Indian Mathematician
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector HlSTORlA MATHEMATICA 12 (1985). 2.544 Sripati: An Eleventh-Century Indian Mathematician KRIPA NATH SINHA University of Kalyani, P.O. Kalyani, District Nadia, West Bengal, India Srlpati (fl. A.D. 1039-1056) is best known for his writings on astronomy, arithmetic, mensuration, and algebra. This article discusses Sripati’s arithmetic, the Ganitatilaka, as well as the arithmetical and algebraic chapters of the SiddhdntaSekhara. In addition to discussing the kinds of problems considered by Srlpati and the techniques he used to solve them, the article considers the sources upon which Sripati drew. A glossary of Indian treatises and technical terms is provided. o 1985 Academic PKSS. IOC. Srlpati (actif vers 1039-1056 ap. J.C.) est surtout connu pour ses Ccrits sur I’astronomie, I’arithmetique, le toise, et I’algebre. Dans cet article, nous abordons I’arithmetique de Sripati, le Ganitatilaka, de m&me que les chapitres arithmetiques et algebriques de son SiddhrintaSekh’ara. En plus d’aborder les types de problemes Ctudies par Sripati et les techniques qu’il a employees pour les resoudre, nous exminons aussi les sources auxquelles Srlpati fait appel. Un glossaire des trait& et des termes techniques indiens complete cet article. 0 1985 Academic Press, Inc. Sripati, der zwischen 1039 und 1056 wirkte, ist vor allem durch seine Schriften tiber Astronomie, Arithmetik, Mensuration und Algebra bekannt. In diesem Beitrag werden seine Arithmetik, die Gavitatilaka, und die arithmetischen und algebraischen Kapitel aus SiddhhtaSekhara behandelt. Neben der Art der Probleme, die Srlpati studierte, und den von ihm verwendeten Losungsmethoden werden such die von ihm benutzten Quellen be- trachtet. -
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. -
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. -
Algorithmic Factorization of Polynomials Over Number Fields
Rose-Hulman Institute of Technology Rose-Hulman Scholar Mathematical Sciences Technical Reports (MSTR) Mathematics 5-18-2017 Algorithmic Factorization of Polynomials over Number Fields Christian Schulz Rose-Hulman Institute of Technology Follow this and additional works at: https://scholar.rose-hulman.edu/math_mstr Part of the Number Theory Commons, and the Theory and Algorithms Commons Recommended Citation Schulz, Christian, "Algorithmic Factorization of Polynomials over Number Fields" (2017). Mathematical Sciences Technical Reports (MSTR). 163. https://scholar.rose-hulman.edu/math_mstr/163 This Dissertation is brought to you for free and open access by the Mathematics at Rose-Hulman Scholar. It has been accepted for inclusion in Mathematical Sciences Technical Reports (MSTR) by an authorized administrator of Rose-Hulman Scholar. For more information, please contact [email protected]. Algorithmic Factorization of Polynomials over Number Fields Christian Schulz May 18, 2017 Abstract The problem of exact polynomial factorization, in other words expressing a poly- nomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used to form the algebraic number field in question, let s be the sum of the squares of these degrees, and let d be the degree of the polynomial to be factored; then the runtime of this algorithm is found to be O(d4sk2 + 2dd3). -
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. -
Some Properties of the Discriminant Matrices of a Linear Associative Algebra*
570 R. F. RINEHART [August, SOME PROPERTIES OF THE DISCRIMINANT MATRICES OF A LINEAR ASSOCIATIVE ALGEBRA* BY R. F. RINEHART 1. Introduction. Let A be a linear associative algebra over an algebraic field. Let d, e2, • • • , en be a basis for A and let £»•/*., (hjik = l,2, • • • , n), be the constants of multiplication corre sponding to this basis. The first and second discriminant mat rices of A, relative to this basis, are defined by Ti(A) = \\h(eres[ CrsiCij i, j=l T2(A) = \\h{eres / ,J CrsiC j II i,j=l where ti(eres) and fa{erea) are the first and second traces, respec tively, of eres. The first forms in terms of the constants of multi plication arise from the isomorphism between the first and sec ond matrices of the elements of A and the elements themselves. The second forms result from direct calculation of the traces of R(er)R(es) and S(er)S(es), R{ei) and S(ei) denoting, respectively, the first and second matrices of ei. The last forms of the dis criminant matrices show that each is symmetric. E. Noetherf and C. C. MacDuffeeJ discovered some of the interesting properties of these matrices, and shed new light on the particular case of the discriminant matrix of an algebraic equation. It is the purpose of this paper to develop additional properties of these matrices, and to interpret them in some fa miliar instances. Let A be subjected to a transformation of basis, of matrix M, 7 J rH%j€j 1,2, *0). -
In Praise of Her Supreme Holiness Shri Mataji Nirmala Devi
In praise of Her Supreme Holiness Shri Mataji Nirmala Devi 2016 Edition The original Sahaja Yoga Mantrabook was compiled by Sahaja Yoga Austria and gibven as a Guru Puja gift in 1989 0 'Now the name of your Mother is very powerful. You know that is the most powerful name, than all the other names, the most powerful mantra. But you must know how to take it. With that complete dedication you have to take that name. Not like any other.' Her Supreme Holiness Shri Mataji Nirmala Devi ‘Aum Twameva sakshat, Shri Nirmala Devyai namo namaḥ. That’s the biggest mantra, I tell you. That’s the biggest mantra. Try it’ Birthday Puja, Melbourne, 17-03-85. 1 This book is dedicated to Our Beloved Divine M other Her Supreme Holiness Shri MMMatajiM ataji Nirmal aaa DevDeviiii,,,, the Source of This Knowledge and All Knowledge . May this humble offering be pleasing in Her Sight. May Her Joy always be known and Her P raises always sung on this speck of rock in the Solar System. Feb 2016 No copyright is held on this material which is for the emancipation of humanity. But we respectfully request people not to publish any of the contents in a substantially changed or modified manner which may be misleading. 2 Contents Sanskrit Pronunciation .................................... 8 Mantras in Sahaja Yoga ................................... 10 Correspondence with the Chakras ....................... 14 The Three Levels of Sahasrara .......................... 16 Om ................................................. 17 Mantra Forms ........................................ 19 Mantras for the Chakras .................................. 20 Mantras for Special Purposes ............................. 28 The Affirmations ......................................... 30 Short Prayers for the Chakras ............................. 33 Gāyatrī Mantra ...................................... -
501 Algebra Questions 2Nd Edition
501 Algebra Questions 501 Algebra Questions 2nd Edition ® NEW YORK Copyright © 2006 LearningExpress, LLC. All rights reserved under International and Pan-American Copyright Conventions. Published in the United States by LearningExpress, LLC, New York. Library of Congress Cataloging-in-Publication Data: 501 algebra questions.—2nd ed. p. cm. Rev. ed. of: 501 algebra questions / [William Recco]. 1st ed. © 2002. ISBN 1-57685-552-X 1. Algebra—Problems, exercises, etc. I. Recco, William. 501 algebra questions. II. LearningExpress (Organization). III. Title: Five hundred one algebra questions. IV. Title: Five hundred and one algebra questions. QA157.A15 2006 512—dc22 2006040834 Printed in the United States of America 98765432 1 Second Edition ISBN 1-57685-552-X For more information or to place an order, contact LearningExpress at: 55 Broadway 8th Floor New York, NY 10006 Or visit us at: www.learnatest.com The LearningExpress Skill Builder in Focus Writing Team is comprised of experts in test preparation, as well as educators and teachers who specialize in language arts and math. LearningExpress Skill Builder in Focus Writing Team Brigit Dermott Freelance Writer English Tutor, New York Cares New York, New York Sandy Gade Project Editor LearningExpress New York, New York Kerry McLean Project Editor Math Tutor Shirley, New York William Recco Middle School Math Teacher, Grade 8 New York Shoreham/Wading River School District Math Tutor St. James, New York Colleen Schultz Middle School Math Teacher, Grade 8 Vestal Central School District Math Tutor -
Analytical Formula for the Roots of the General Complex Cubic Polynomial Ibrahim Baydoun
Analytical formula for the roots of the general complex cubic polynomial Ibrahim Baydoun To cite this version: Ibrahim Baydoun. Analytical formula for the roots of the general complex cubic polynomial. 2018. hal-01237234v2 HAL Id: hal-01237234 https://hal.archives-ouvertes.fr/hal-01237234v2 Preprint submitted on 17 Jan 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Analytical formula for the roots of the general complex cubic polynomial Ibrahim Baydoun1 1ESPCI ParisTech, PSL Research University, CNRS, Univ Paris Diderot, Sorbonne Paris Cit´e, Institut Langevin, 1 rue Jussieu, F-75005, Paris, France January 17, 2018 Abstract We present a new method to calculate analytically the roots of the general complex polynomial of degree three. This method is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantage of this method is to calculate the roots of the cubic polynomial as uniform formula using the standard convention of the square and cubic roots. In contrast, the reference methods for this problem, as Cardan-Tartaglia and Lagrange, give the roots of the cubic polynomial as expressions with case distinctions which are incorrect using the standar convention. -
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. -
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.