HISTORY of MATHEMATICS SECTION Hypatia of Alexandria
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Diophantine Equation X 2 + C = Y N : a Brief Overview
Revista Colombiana de Matem¶aticas Volumen 40 (2006), p¶aginas31{37 The Diophantine equation x 2 + c = y n : a brief overview Fadwa S. Abu Muriefah Girls College Of Education, Saudi Arabia Yann Bugeaud Universit¶eLouis Pasteur, France Abstract. We give a survey on recent results on the Diophantine equation x2 + c = yn. Key words and phrases. Diophantine equations, Baker's method. 2000 Mathematics Subject Classi¯cation. Primary: 11D61. Resumen. Nosotros hacemos una revisi¶onacerca de resultados recientes sobre la ecuaci¶onDiof¶antica x2 + c = yn. 1. Who was Diophantus? The expression `Diophantine equation' comes from Diophantus of Alexandria (about A.D. 250), one of the greatest mathematicians of the Greek civilization. He was the ¯rst writer who initiated a systematic study of the solutions of equations in integers. He wrote three works, the most important of them being `Arithmetic', which is related to the theory of numbers as distinct from computation, and covers much that is now included in Algebra. Diophantus introduced a better algebraic symbolism than had been known before his time. Also in this book we ¯nd the ¯rst systematic use of mathematical notation, although the signs employed are of the nature of abbreviations for words rather than algebraic symbols in contemporary mathematics. Special symbols are introduced to present frequently occurring concepts such as the unknown up 31 32 F. S. ABU M. & Y. BUGEAUD to its sixth power. He stands out in the history of science as one of the great unexplained geniuses. A Diophantine equation or indeterminate equation is one which is to be solved in integral values of the unknowns. -
Arithmetic Sequences, Diophantine Equations and the Number of the Beast Bryan Dawson Union University
Arithmetic Sequences, Diophantine Equations and the Number of the Beast Bryan Dawson Union University Here is wisdom. Let him who has understanding calculate the number of the beast, for it is the number of a man: His number is 666. -Revelation 13:18 (NKJV) "Let him who has understanding calculate ... ;" can anything be more enticing to a mathe matician? The immediate question, though, is how do we calculate-and there are no instructions. But more to the point, just who might 666 be? We can find anything on the internet, so certainly someone tells us. A quick search reveals the answer: according to the "Gates of Hell" website (Natalie, 1998), 666 refers to ... Bill Gates ill! In the calculation offered by the website, each letter in the name is replaced by its ASCII character code: B I L L G A T E S I I I 66 73 76 76 71 65 84 69 83 1 1 1 = 666 (Notice, however, that an exception is made for the suffix III, where the value of the suffix is given as 3.) The big question is this: how legitimate is the calculation? To answer this question, we need to know several things: • Can this same type of calculation be performed on other names? • What mathematics is behind such calculations? • Have other types of calculations been used to propose a candidate for 666? • What type of calculation did John have in mind? Calculations To answer the first two questions, we need to understand the ASCII character code. The ASCII character code replaces characters with numbers in order to have a numeric way of storing all characters. -
Survey of Modern Mathematical Topics Inspired by History of Mathematics
Survey of Modern Mathematical Topics inspired by History of Mathematics Paul L. Bailey Department of Mathematics, Southern Arkansas University E-mail address: [email protected] Date: January 21, 2009 i Contents Preface vii Chapter I. Bases 1 1. Introduction 1 2. Integer Expansion Algorithm 2 3. Radix Expansion Algorithm 3 4. Rational Expansion Property 4 5. Regular Numbers 5 6. Problems 6 Chapter II. Constructibility 7 1. Construction with Straight-Edge and Compass 7 2. Construction of Points in a Plane 7 3. Standard Constructions 8 4. Transference of Distance 9 5. The Three Greek Problems 9 6. Construction of Squares 9 7. Construction of Angles 10 8. Construction of Points in Space 10 9. Construction of Real Numbers 11 10. Hippocrates Quadrature of the Lune 14 11. Construction of Regular Polygons 16 12. Problems 18 Chapter III. The Golden Section 19 1. The Golden Section 19 2. Recreational Appearances of the Golden Ratio 20 3. Construction of the Golden Section 21 4. The Golden Rectangle 21 5. The Golden Triangle 22 6. Construction of a Regular Pentagon 23 7. The Golden Pentagram 24 8. Incommensurability 25 9. Regular Solids 26 10. Construction of the Regular Solids 27 11. Problems 29 Chapter IV. The Euclidean Algorithm 31 1. Induction and the Well-Ordering Principle 31 2. Division Algorithm 32 iii iv CONTENTS 3. Euclidean Algorithm 33 4. Fundamental Theorem of Arithmetic 35 5. Infinitude of Primes 36 6. Problems 36 Chapter V. Archimedes on Circles and Spheres 37 1. Precursors of Archimedes 37 2. Results from Euclid 38 3. Measurement of a Circle 39 4. -
Dossier Pierre Duhem Pierre Duhem's Philosophy and History of Science
Transversal: International Journal for the Historiography of Science , 2 (201 7) 03 -06 ISSN 2526 -2270 www.historiographyofscience.org © The Author s 201 7 — This is an open access article Dossier Pierre Duhem Pierre Duhem’s Philos ophy and History of Science Introduction Fábio Rodrigo Leite 1 Jean-François Stoffel 2 DOI: http://dx.doi.org/10.24117/2526-2270.2017.i2.02 _____________________________________________________________________________ We are pleased to present in this issue a tribute to the thought of Pierre Duhem, on the occasion of the centenary of his death that occurred in 2016. Among articles and book reviews, the dossier contains 14 contributions of scholars from different places across the world, from Europe (Belgium, Greece, Italy, Portugal and Sweden) to the Americas (Brazil, Canada, Mexico and the United States). And this is something that attests to the increasing scope of influence exerted by the French physicist, philosopher and 3 historian. It is quite true that since his passing, Duhem has been remembered in the writings of many of those who knew him directly. However, with very few exceptions (Manville et al. 1927), the comments devoted to him exhibited clear biographical and hagiographic characteristics of a generalist nature (see Jordan 1917; Picard 1921; Mentré 1922a; 1922b; Humbert 1932; Pierre-Duhem 1936; Ocagne et al. 1937). From the 1950s onwards, when the studies on his philosophical work resumed, the thought of the Professor from Bordeaux acquired an irrevocable importance, so that references to La théorie physique: Son objet et sa structure became a common place in the literature of the area. As we know, this recovery was a consequence of the prominence attributed, firstly, to the notorious Duhem-Quine thesis in the English- speaking world, and secondly to the sparse and biased comments made by Popper that generated an avalanche of revaluations of the Popperian “instrumentalist interpretation”. -
Historiographie De Paul Tannery Et Receptions De Son Œuvre: Sur L'invention Du Metier D'historien Des Sciences
Historiographie de Paul Tannery et receptions de son œuvre : sur l’invention du metier d’historien des sciences François Pineau To cite this version: François Pineau. Historiographie de Paul Tannery et receptions de son œuvre : sur l’invention du metier d’historien des sciences. Histoire, Philosophie et Sociologie des sciences. Université de Nantes, 2010. Français. NNT : 2010NANT2076. tel-00726388 HAL Id: tel-00726388 https://tel.archives-ouvertes.fr/tel-00726388 Submitted on 29 Aug 2012 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. UNIVERSITÉ DE NANTES UFR SCIENCES ET TECHNIQUES _____ ECOLE DOCTORALE SOCIETES, CULTURES, ECHANGES Année 2010 N° attribué par la bibliothèque Historiographie de Paul Tannery et réceptions de son œuvre : sur l'invention du métier d'historien des sciences ___________ THÈSE DE DOCTORAT Discipline : Épistémologie et Histoire des sciences et des techniques Présentée et soutenue publiquement par François PINEAU Le 11 décembre 2010, devant le jury ci-dessous Rapporteurs : M. Eberhard KNOBLOCH, Professeur, Berlin Mme Jeanne PEIFFER, Directeur de recherche CNRS, Paris Examinateurs : M. Anastasios BRENNER, Professeur, Montpellier M. Bernard VITRAC, Directeur de recherche CNRS, Paris Co-directeurs de thèse : Mme Évelyne BARBIN, Professeur, Nantes M. -
Solving Elliptic Diophantine Equations: the General Cubic Case
ACTA ARITHMETICA LXXXVII.4 (1999) Solving elliptic diophantine equations: the general cubic case by Roelof J. Stroeker (Rotterdam) and Benjamin M. M. de Weger (Krimpen aan den IJssel) Introduction. In recent years the explicit computation of integer points on special models of elliptic curves received quite a bit of attention, and many papers were published on the subject (see for instance [ST94], [GPZ94], [Sm94], [St95], [Tz96], [BST97], [SdW97], [ST97]). The overall picture before 1994 was that of a field with many individual results but lacking a comprehensive approach to effectively settling the el- liptic equation problem in some generality. But after S. David obtained an explicit lower bound for linear forms in elliptic logarithms (cf. [D95]), the elliptic logarithm method, independently developed in [ST94] and [GPZ94] and based upon David’s result, provided a more generally applicable ap- proach for solving elliptic equations. First Weierstraß equations were tack- led (see [ST94], [Sm94], [St95], [BST97]), then in [Tz96] Tzanakis considered quartic models and in [SdW97] the authors gave an example of an unusual cubic non-Weierstraß model. In the present paper we shall treat the general case of a cubic diophantine equation in two variables, representing an elliptic curve over Q. We are thus interested in the diophantine equation (1) f(u, v) = 0 in rational integers u, v, where f Q[x,y] is of degree 3. Moreover, we require (1) to represent an elliptic curve∈ E, that is, a curve of genus 1 with at least one rational point (u0, v0). 1991 Mathematics Subject Classification: 11D25, 11G05, 11Y50, 12D10. -
Diophantine Equations 1 Exponential Diophantine Equations
Number Theory Misha Lavrov Diophantine equations Western PA ARML Practice October 4, 2015 1 Exponential Diophantine equations Diophantine equations are just equations we solve with the constraint that all variables must be integers. These are generally really hard to solve (for example, the famous Fermat's Last Theorem is an example of a Diophantine equation). Today, we will begin by focusing on a special kind of Diophantine equation: exponential Diophantine equations. Here's an example. Example 1. Solve 5x − 8y = 1 for integers x and y. These can still get really hard, but there's a special technique that solves them most of the time. That technique is to take the equation modulo m. In this example, if 5x − 8y = 1, then in particular 5x − 8y ≡ 1 (mod 21). But what do the powers of 5 and 8 look like modulo 21? We have: • 5x ≡ 1; 5; 4; 20; 16; 17; 1; 5; 4;::: , repeating every 6 steps. • 8y ≡ 1; 8; 1; 8;::: , repeating every 2 steps. So there are only 12 possibilities for 5x − 8y when working modulo 21. We can check them all, and we notice that 1 − 1; 1 − 8; 5 − 1; 5 − 8;:::; 17 − 1; 17 − 8 are not ever equal to 1. So the equation has no solutions. Okay, but there's a magic step here: how did we pick 21? Example 2. Solve 5x − 8y = 1 for integers x and y, but in a way that's not magic. There are several rules to follow for picking the modulus m. The first is one we've already broken: Rule 1: Choose m to be a prime or a power of a prime. -
Archimedes' Cattle Problem
Archimedes’ Cattle Problem D. Joyce, Clark University January 2006 Brief htistory. L. E. Dickson describes the history of Archimede’s Cattle Problem in his History of the Theory of Numbers,1 briefly summarized here. A manuscript found in the Herzog August Library at Wolfenb¨uttel,Germany, was first described in 1773 by G. E. Lessing with a German translation from the Greek and a mathematical commentary by C. Leiste.2 The problem was stated in a Greek epigram in 24 verses along with a solution of part of the problem, but not the last part about square and triangular numbers. Leiste explained how the partial solution may have been derived, but he didn’t solve the last part either. That was first solved by A. Amthor in 1880.3 Part 1. We can solve the first part of the problem with a little algebra and a few hand com- putations. It is a multilinear Diophantine problem with four variables and three equations. If thou art diligent and wise, O stranger, compute the number of cattle of the Sun, who once upon a time grazed on the fields of the Thrinacian isle of Sicily, divided into four herds of different colours, one milk white, another a glossy black, a third yellow and the last dappled. In each herd were bulls, mighty in number according to these proportions: Understand, stranger, that the white bulls were equal to a half and a third of the black together with the whole of the yellow, while the black were equal to the fourth part of the dappled and a fifth, together with, once more, the whole of the yellow. -
Historiographie De Paul Tannery Et Receptions De Son Œuvre : Sur L’Invention Du Metier D’Historien Des Sciences Fran¸Coispineau
Historiographie de Paul Tannery et receptions de son œuvre : sur l'invention du metier d'historien des sciences Fran¸coisPineau To cite this version: Fran¸coisPineau. Historiographie de Paul Tannery et receptions de son œuvre : sur l'invention du metier d'historien des sciences. Histoire, Philosophie et Sociologie des sciences. Universit´e de Nantes, 2010. Fran¸cais. <NNT : 2010NANT2076>. <tel-00726388> HAL Id: tel-00726388 https://tel.archives-ouvertes.fr/tel-00726388 Submitted on 29 Aug 2012 HAL is a multi-disciplinary open access L'archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destin´eeau d´ep^otet `ala diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publi´esou non, lished or not. The documents may come from ´emanant des ´etablissements d'enseignement et de teaching and research institutions in France or recherche fran¸caisou ´etrangers,des laboratoires abroad, or from public or private research centers. publics ou priv´es. UNIVERSITÉ DE NANTES UFR SCIENCES ET TECHNIQUES _____ ECOLE DOCTORALE SOCIETES, CULTURES, ECHANGES Année 2010 N° attribué par la bibliothèque Historiographie de Paul Tannery et réceptions de son œuvre : sur l'invention du métier d'historien des sciences ___________ THÈSE DE DOCTORAT Discipline : Épistémologie et Histoire des sciences et des techniques Présentée et soutenue publiquement par François PINEAU Le 11 décembre 2010, devant le jury ci-dessous Rapporteurs : M. Eberhard KNOBLOCH, Professeur, Berlin Mme Jeanne PEIFFER, Directeur de recherche CNRS, Paris Examinateurs : M. Anastasios BRENNER, Professeur, Montpellier M. Bernard VITRAC, Directeur de recherche CNRS, Paris Co-directeurs de thèse : Mme Évelyne BARBIN, Professeur, Nantes M. -
Math Circles Diophantine Equations and the Euclidean Algorithm
Math Circles Diophantine Equations and the Euclidean Algorithm Colin Curtis August 9, 2020 Definition: A Diophantine equation is an equation of the form ax + by = c, where x; y are variables that we are trying to solve for. In other words, we are trying to find x and y that solve the given equation. Definition: The greatest common divisor (gcd) of two numbers a and b, denoted gcd(a; b), is the greatest number that divides both a and b. Example: gcd(5; 10) = 5. We see this just through simple observation. gcd(12; 7) = 1 since 7 is a prime number. Important Fact: if c = gcd(a; b), then there exist integers x and y such that ax + by = c. This is important because it guarantees the existence of a solution to the Diophantine equation ax + by = c if and only if c = gcd(a; b). Problem 1: Try to find integer solutions to the Diophantine equation 2x + 3y = 0. What about 2x + 3y = 1? Or 2x + 3y = 31? Think about how you can get the third equation from the second equation. Problem 2: Suppose we have a solution (x0; y0) to the Diophantine equa- tion ax + by = 1. Let n be an arbitrary integer. Show there is a solution to the Diophantine equation ax + by = n. Can you give a solution? hint: think about the previous problem. Euclidean Algorithm: Suppose we are trying to calculate gcd(a; b), with a ≥ b. Then write 1. a = q0b + ro, where q0 is the quotient and r0 is the remainder. 2. -
Effective Methods for Diophantine Problems
Diophantine problems Michael Bennett Introduction What we know Effective methods for Diophantine problems Case studies Michael Bennett University of British Columbia BIRS Summer School : June 2012 Diophantine problems Michael What are Diophantine equations? Bennett Introduction According to Hilbert, a Diophantine equation is an equation of What we know the form Case studies D(x1; : : : ; xm) = 0; where D is a polynomial with integer coefficients. Hilbert's 10th problem : Determination of the solvability of a Diophantine equation. Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in rational integers. Diophantine problems Michael Bennett What are Diophantine equations? (take 2) Introduction What we know A few more opinions : Case studies Wikipedia pretty much agrees with Hilbert Mordell, in his book \Diophantine Equations", never really defines the term (!) Wolfram states \A Diophantine equation is an equation in which only integer solutions are allowed". Diophantine problems Michael Bennett Introduction Back to Hilbert's 10th problem What we know Case studies Determination of the solvability of a Diophantine equation. Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in rational integers. But . Hilbert's problem is still open over Q (and over OK for most number fields) It is not yet understood what happens if the number of variables is \small" Diophantine problems Michael Bennett Matiyasevich's Theorem Introduction (building on work of Davis, Putnam and Robinson) is that, in What we know Case studies general, no such process exists. -
Explicit Methods for Solving Diophantine Equations
Explicit Methods for Solving Diophantine Equations Henri Cohen Laboratoire A2X Universite´ Bordeaux 1 Tucson, Arizona Winter School, 2006 EXAMPLES (I) Diophantine equation: system of polynomial equations to be solved in integers, rational numbers, or other number rings. Fermat’s Last Theorem (FLT): in Z, xn + yn = zn with n 3 implies • ≥ xyz = 0. This gave the impetus for algebraic number theory by Kummer, Dirichlet, . Solved by these methods up to large values of n (several million). Then Faltings’s result on rational points on higher genus curves proved that for fixed n, only finite number of (coprime) solutions. But finally completely solved using elliptic curves, modular forms, and Galois representations by Ribet, Wiles, and Taylor–Wiles. The method of solution is more important than FLT itself. EXAMPLES (II) Catalan’s conjecture: if m and n are at least 2, nonzero solutions of • xm yn = 1 come from 32 23 = 1. Until recently, same status as FLT: − − attacks using algebraic number theory solved many cases. Then Baker-type methods were used by Tijdeman to show that the total number of (m, n, x, y) is finite. Finally completely solved by Mihailescu˘ in 2001, using only the theory of cyclotomic fields, but rather deep results (Thaine’s theorem), quite a surprise. Proof later simplified by Bilu and Lenstra. EXAMPLES (III) The congruent number problem (Diophantus, 4th century A.D.). Find • all integers n equal to the area of a Pythagorean triangle, i.e. with all sides rational (example (3, 4, 5) gives n = 6). Easy: equivalent to the existence of rational solutions of y2 = x3 n2x with y = 0.