Babylonian Mathematicians Implemented for Solving Problems (Høyrup 2002)
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Euler's Square Root Laws for Negative Numbers
Ursinus College Digital Commons @ Ursinus College Transforming Instruction in Undergraduate Complex Numbers Mathematics via Primary Historical Sources (TRIUMPHS) Winter 2020 Euler's Square Root Laws for Negative Numbers Dave Ruch Follow this and additional works at: https://digitalcommons.ursinus.edu/triumphs_complex Part of the Curriculum and Instruction Commons, Educational Methods Commons, Higher Education Commons, and the Science and Mathematics Education Commons Click here to let us know how access to this document benefits ou.y Euler’sSquare Root Laws for Negative Numbers David Ruch December 17, 2019 1 Introduction We learn in elementary algebra that the square root product law pa pb = pab (1) · is valid for any positive real numbers a, b. For example, p2 p3 = p6. An important question · for the study of complex variables is this: will this product law be valid when a and b are complex numbers? The great Leonard Euler discussed some aspects of this question in his 1770 book Elements of Algebra, which was written as a textbook [Euler, 1770]. However, some of his statements drew criticism [Martinez, 2007], as we shall see in the next section. 2 Euler’sIntroduction to Imaginary Numbers In the following passage with excerpts from Sections 139—148of Chapter XIII, entitled Of Impossible or Imaginary Quantities, Euler meant the quantity a to be a positive number. 1111111111111111111111111111111111111111 The squares of numbers, negative as well as positive, are always positive. ...To extract the root of a negative number, a great diffi culty arises; since there is no assignable number, the square of which would be a negative quantity. Suppose, for example, that we wished to extract the root of 4; we here require such as number as, when multiplied by itself, would produce 4; now, this number is neither +2 nor 2, because the square both of 2 and of 2 is +4, and not 4. -
Positional Notation Or Trigonometry [2, 13]
The Greatest Mathematical Discovery? David H. Bailey∗ Jonathan M. Borweiny April 24, 2011 1 Introduction Question: What mathematical discovery more than 1500 years ago: • Is one of the greatest, if not the greatest, single discovery in the field of mathematics? • Involved three subtle ideas that eluded the greatest minds of antiquity, even geniuses such as Archimedes? • Was fiercely resisted in Europe for hundreds of years after its discovery? • Even today, in historical treatments of mathematics, is often dismissed with scant mention, or else is ascribed to the wrong source? Answer: Our modern system of positional decimal notation with zero, to- gether with the basic arithmetic computational schemes, which were discov- ered in India prior to 500 CE. ∗Bailey: Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA. Email: [email protected]. This work was supported by the Director, Office of Computational and Technology Research, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy, under contract number DE-AC02-05CH11231. yCentre for Computer Assisted Research Mathematics and its Applications (CARMA), University of Newcastle, Callaghan, NSW 2308, Australia. Email: [email protected]. 1 2 Why? As the 19th century mathematician Pierre-Simon Laplace explained: It is India that gave us the ingenious method of expressing all numbers by means of ten symbols, each symbol receiving a value of position as well as an absolute value; a profound and important idea which appears so simple to us now that we ignore its true merit. But its very sim- plicity and the great ease which it has lent to all computations put our arithmetic in the first rank of useful inventions; and we shall appre- ciate the grandeur of this achievement the more when we remember that it escaped the genius of Archimedes and Apollonius, two of the greatest men produced by antiquity. -
The Geometry of René Descartes
BOOK FIRST The Geometry of René Descartes BOOK I PROBLEMS THE CONSTRUCTION OF WHICH REQUIRES ONLY STRAIGHT LINES AND CIRCLES ANY problem in geometry can easily be reduced to such terms that a knowledge of the lengths of certain straight lines is sufficient for its construction.1 Just as arithmetic consists of only four or five operations, namely, addition, subtraction, multiplication, division and the extraction of roots, which may be considered a kind of division, so in geometry, to find required lines it is merely necessary to add or subtract ther lines; or else, taking one line which I shall call unity in order to relate it as closely as possible to numbers,2 and which can in general be chosen arbitrarily, and having given two other lines, to find a fourth line which shall be to one of the given lines as the other is to unity (which is the same as multiplication) ; or, again, to find a fourth line which is to one of the given lines as unity is to the other (which is equivalent to division) ; or, finally, to find one, two, or several mean proportionals between unity and some other line (which is the same as extracting the square root, cube root, etc., of the given line.3 And I shall not hesitate to introduce these arithmetical terms into geometry, for the sake of greater clearness. For example, let AB be taken as unity, and let it be required to multiply BD by BC. I have only to join the points A and C, and draw DE parallel to CA ; then BE is the product of BD and BC. -
Calculating Numerical Roots = = 1.37480222744
#10 in Fundamentals of Applied Math Series Calculating Numerical Roots Richard J. Nelson Introduction – What is a root? Do you recognize this number(1)? 1.41421 35623 73095 04880 16887 24209 69807 85696 71875 37694 80731 76679 73799 07324 78462 10703 88503 87534 32764 15727 35013 84623 09122 97024 92483 60558 50737 21264 41214 97099 93583 14132 22665 92750 55927 55799 95050 11527 82060 57147 01095 59971 60597 02745 34596 86201 47285 17418 64088 91986 09552 32923 04843 08714 32145 08397 62603 62799 52514 07989 68725 33965 46331 80882 96406 20615 25835 Fig. 1 - HP35s √ key. 23950 54745 75028 77599 61729 83557 52203 37531 85701 13543 74603 40849 … If you have had any math classes you have probably run into this number and you should recognize it as the square root of two, . The square root of a number, n, is that value when multiplied by itself equals n. 2 x 2 = 4 and = 2. Calculating the square root of the number is the inverse operation of squaring that number = n. The "√" symbol is called the "radical" symbol or "check mark." MS Word has the radical symbol, √, but we often use it with a line across the top. This is called the "vinculum" circa 12th century. The expression " (2)" is read as "root n", "radical n", or "the square root of n". The vinculum extends over the number to make it inclusive e.g. Most HP calculators have the square root key as a primary key as shown in Fig. 1 because it is used so much. Roots and Powers Numbers may be raised to any power (y, multiplied by itself x times) and the inverse operation, taking the root, may be expressed as shown below. -
Arxiv:Math/0701554V2 [Math.HO] 22 May 2007 Pythagorean Triples and a New Pythagorean Theorem
Pythagorean Triples and A New Pythagorean Theorem H. Lee Price and Frank Bernhart January 1, 2007 Abstract Given a right triangle and two inscribed squares, we show that the reciprocals of the hypotenuse and the sides of the squares satisfy an interesting Pythagorean equality. This gives new ways to obtain rational (integer) right triangles from a given one. 1. Harmonic and Symphonic Squares Consider an arbitrary triangle with altitude α corresponding to base β (see Figure 1a). Assuming that the base angles are acute, suppose that a square of side η is inscribed as shown in Figure 1b. arXiv:math/0701554v2 [math.HO] 22 May 2007 Figure 1: Triangle and inscribed square Then α,β,η form a harmonic sum, i.e. satisfy (1). The equivalent formula αβ η = α+β is also convenient, and is found in some geometry books. 1 1 1 + = (1) α β η 1 Figure 2: Three congruent harmonic squares Equation (1) remains valid if a base angle is a right angle, or is obtuse, save that in the last case the triangle base must be extended, and the square is not strictly inscribed ( Figures 2a, 2c ). Starting with the right angle case (Figure 2a) it is easy to see the inscribed square uniquely exists (bisect the right angle), and from similar triangles we have proportion (β η) : β = η : α − which leads to (1). The horizontal dashed lines are parallel, hence the three triangles of Figure 2 have the same base and altitude; and the three squares are congruent and unique. Clearly (1) applies to all cases. -
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. -
UNDERSTANDING MATHEMATICS to UNDERSTAND PLATO -THEAETEUS (147D-148B Salomon Ofman
UNDERSTANDING MATHEMATICS TO UNDERSTAND PLATO -THEAETEUS (147d-148b Salomon Ofman To cite this version: Salomon Ofman. UNDERSTANDING MATHEMATICS TO UNDERSTAND PLATO -THEAETEUS (147d-148b. Lato Sensu, revue de la Société de philosophie des sciences, Société de philosophie des sciences, 2014, 1 (1). hal-01305361 HAL Id: hal-01305361 https://hal.archives-ouvertes.fr/hal-01305361 Submitted on 20 Apr 2016 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. UNDERSTANDING MATHEMATICS TO UNDERSTAND PLATO - THEAETEUS (147d-148b) COMPRENDRE LES MATHÉMATIQUES POUR COMPRENDRE PLATON - THÉÉTÈTE (147d-148b) Salomon OFMAN Institut mathématique de Jussieu-PRG Histoire des Sciences mathématiques 4 Place Jussieu 75005 Paris [email protected] Abstract. This paper is an updated translation of an article published in French in the Journal Lato Sensu (I, 2014, p. 70-80). We study here the so- called ‘Mathematical part’ of Plato’s Theaetetus. Its subject concerns the incommensurability of certain magnitudes, in modern terms the question of the rationality or irrationality of the square roots of integers. As the most ancient text on the subject, and on Greek mathematics and mathematicians as well, its historical importance is enormous. -
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). -
The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes
Portland State University PDXScholar Mathematics and Statistics Faculty Fariborz Maseeh Department of Mathematics Publications and Presentations and Statistics 3-2018 The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes Xu Hu Sun University of Macau Christine Chambris Université de Cergy-Pontoise Judy Sayers Stockholm University Man Keung Siu University of Hong Kong Jason Cooper Weizmann Institute of Science SeeFollow next this page and for additional additional works authors at: https:/ /pdxscholar.library.pdx.edu/mth_fac Part of the Science and Mathematics Education Commons Let us know how access to this document benefits ou.y Citation Details Sun X.H. et al. (2018) The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes. In: Bartolini Bussi M., Sun X. (eds) Building the Foundation: Whole Numbers in the Primary Grades. New ICMI Study Series. Springer, Cham This Book Chapter is brought to you for free and open access. It has been accepted for inclusion in Mathematics and Statistics Faculty Publications and Presentations by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Authors Xu Hu Sun, Christine Chambris, Judy Sayers, Man Keung Siu, Jason Cooper, Jean-Luc Dorier, Sarah Inés González de Lora Sued, Eva Thanheiser, Nadia Azrou, Lynn McGarvey, Catherine Houdement, and Lisser Rye Ejersbo This book chapter is available at PDXScholar: https://pdxscholar.library.pdx.edu/mth_fac/253 Chapter 5 The What and Why of Whole Number Arithmetic: Foundational Ideas from History, Language and Societal Changes Xu Hua Sun , Christine Chambris Judy Sayers, Man Keung Siu, Jason Cooper , Jean-Luc Dorier , Sarah Inés González de Lora Sued , Eva Thanheiser , Nadia Azrou , Lynn McGarvey , Catherine Houdement , and Lisser Rye Ejersbo 5.1 Introduction Mathematics learning and teaching are deeply embedded in history, language and culture (e.g. -
Proofs by Cases, Square Root of 2 Is Irrational, Operations on Sets
COMP 1002 Intro to Logic for Computer Scientists Lecture 16 B 5 2 J Puzzle: Caesar cipher • The Roman dictator Julius Caesar encrypted his personal correspondence using the following code. – Number letters of the alphabet: A=0, B=1,… Z=25. – To encode a message, replace every letter by a letter three positions before that (wrapping). • A letter numbered x by a letter numbered x-3 mod 26. • For example, F would be replaced by C, and A by X • Suppose he sent the following message. – QOBXPROB FK QEB ZXSB • What does it say? Proof by cases • Use the tautology • If is ( ) ( ), 1 2 1 2 • prove 푝 ∨ 푝( ∧ 푝 → 푞 ∧). 푝 → 푞 → 푞 1 2 • Proof:∀푥 퐹 푥 ∀푥 퐺 푥 ∨ 퐺 푥 → 퐻 푥 1 2 – Universal퐺 푥 instantiation:→ 퐻 푥 ∧ 퐺“let푥 n be→ an퐻 arbitrary푥 element of the domain of ” – Case 1: ( ) – Case 2: 푆 ∀푥 ( ) 1 – Therefore,퐺 (푛 → 퐻 푛 ) ( ), 2 – Now use퐺 universal푛 → 퐻 generalization푛 to conclude that is true. 퐺1 푛 ∨ 퐺2 푛 → 퐻 푛 • This generalizes for any number of cases 2. ∀ 푥 퐹 푥 푘 ≥ (Done). □ Proof by cases. • Definition (of odd integers): – An integer n is odd iff , = 2 + 1. • Theorem: Sum of an integer with a consecutive integer is odd. ∃푘 ∈ ℤ 푛 ⋅ 푘 – ( + + 1 ). • Proof: – Suppose∀푥 ∈ ℤ 푂푂푂n is an푥 arbitrary푥 integer. – Case 1: n is even. • So n=2k for some k (by definition). • Its consecutive integer is n+1 = 2k+1. Their sum is (n+(n+1))= 2k + (2k+1) = 4k+1. (axioms). -
The Theorem of Pythagoras
The Most Famous Theorem The Theorem of Pythagoras feature Understanding History – Who, When and Where Does mathematics have a history? In this article the author studies the tangled and multi-layered past of a famous result through the lens of modern thinking, look- ing at contributions from schools of learning across the world, and connecting the mathematics recorded in archaeological finds with that taught in the classroom. Shashidhar Jagadeeshan magine, in our modern era, a very important theorem being Iattributed to a cult figure, a new age guru, who has collected a band of followers sworn to secrecy. The worldview of this cult includes number mysticism, vegetarianism and the transmigration of souls! One of the main preoccupations of the group is mathematics: however, all new discoveries are ascribed to the guru, and these new results are not to be shared with anyone outside the group. Moreover, they celebrate the discovery of a new result by sacrificing a hundred oxen! I wonder what would be the current scientific community’s reaction to such events. This is the legacy associated with the most ‘famous’ theorem of all times, the Pythagoras Theorem. In this article, we will go into the history of the theorem, explain difficulties historians have with dating and authorship and also speculate as to what might have led to the general statement and proof of the theorem. Vol. 1, No. 1, June 2012 | At Right Angles 5 Making sense of the history Why Pythagoras? Greek scholars seem to be in Often in the history of ideas, especially when there agreement that the first person to clearly state PT has been a discovery which has had a significant in all its generality, and attempt to establish its influence on mankind, there is this struggle to find truth by the use of rigorous logic (what we now call mathematical proof), was perhaps Pythagoras out who discovered it first. -
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).