DOCSLIB.ORG

Famous Conjectures in Mathematics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Famous Conjectures in Mathematics Appendix A Famous Conjectures in Mathematics There are many perplexing questions in mathematics that have not been resolved. For most of these open questions—and particularly since computing power has increased—researchers have been able to guess the answer; the question is not con- sidered settled, however, until a rigorous proof has been established. A conjecture is a statement for which there is no proof yet known. While conjectures turn into theorems on a daily basis, one suspects that, as mathematicians are introducing and investigating new concepts in an ever-growing number of fields, the number of unsolved questions in mathematics is actually increasing. Even about such familiar concepts as the positive integers, there is a lot we do not know. Here is our selection for the top ten most famous conjectures about the integers, together with some information on how much we currently know about them. Odd Perfect Number Conjecture. There are no odd perfect numbers. (It has been verified that there are no odd perfect numbers under 10300; see also Chap. 3.) Conjecture on Prime Values of Polynomials. There are polynomials of one variable and of degree two or more that assume infinitely many prime values. In particular, there are infinitely many values of n for which n2 C 1 and n2 n C 41 are prime numbers. (It has been known that there are infinitely many values of n for which n2 C 1 is either prime or the product of two primes; the same holds for n2 n C 41. The polynomial n2 n C 41 generates primes for all 39 Ä n Ä 40; see Chap. 3.) Waring’s Problem Conjecture. The smallest integer m for which every positive integer n can be expressed as the sum of m terms, each of which is a perfect k-th power, is $Â Ã % 3 k g.k/ D 2k C 2: 2 (At the present time we know that this holds for every k Ä 471; 600; 000 and every sufficiently large k, thus leaving only finitely many cases open; see Chap. 3). B. Bajnok, An Invitation to Abstract Mathematics, Undergraduate Texts in Mathematics, 381 DOI 10.1007/978-1-4614-6636-9, © Bela´ Bajnok 2013 382 A Famous Conjectures in Mathematics The Mersenne Prime Conjecture. There are infinitely positive integers n for which 2n 1 is a prime number. (There are currently 47 Mersenne primes known; see Chap. 2.) The Fermat Prime Conjecture. There are only five nonnegative integers n for which 2n C 1 is a prime number. (It has been shown that no other n yields prime up to n D 32; see Chap. 2.) The Euclid Number Conjecture. There are infinitely many positive integers n for which Euclid’s number Yn Kn D 1 C pi iD1 is a prime number. (It has been shown that the only values of n under 200 for which Kn is prime are n D 1; 2; 3; 4; 5; 11; 75; 171; and 172; see also Chaps. 3 and 5.) The Twin Prime Conjecture. There are infinitely many pairs of prime numbers that differ by 2. (The largest twin primes currently known have more than two hundred thousand digits; see Chap. 5.) The Goldbach Conjecture. Every even integer that is greater than 2 can be expressed as the sum of two positive prime numbers. (As of today, the Goldbach Conjecture has been shown to be true for all even integers up to about 1018.Note that, as a consequence, every odd integer that is greater than 5 can be expressed as the sum of three positive prime numbers; this latter claim is also unknown and is usually referred to as the Weak Goldbach Conjecture. The Weak Goldbach Conjecture has been proved for all odd integers greater than about 2 101346, leaving only finitely many cases open that, in theory, can be completed with the help of improved computer technology.) Beal’s Conjecture. If a; b,andc are relatively prime positive integers, then the equation ax C by D cz has no positive integer solutions with x, y,andz all greater than 2. (The banker and amateur mathematician Andrew Beal offered $100,000 for a solution of this conjecture; the funds are held in trust by the American Mathematical Society.) The Collatz 3x C 1 Conjecture. On the positive integers, define the function x f.x/ D 3x C 1 if x is odd and f.x/ D 2 if x is even. Then the iteration of f starting with any initial value a (i.e., the sequence a; f .a/; f .f .a//; : : : ) eventually leads to 1. (This conjecture is currently verified for all initial values up to 5:6 1013.) We have to admit that, in our selection of these conjectures, we had a preference for those questions that could be stated without complicated technicalities. The questions considered most important, however, often require background that would take more time to explain. In the year 1900, the German mathematician David Hilbert (1862–1943), at the second International Congress of Mathematicians held in Paris, stated 23 open questions ranging over most branches of mathematics. (Many of Hilbert’s Problems, as they became known, are still open. As it turns out, Hilbert was mistaken in thinking that every well-phrased problem has a solution: A Famous Conjectures in Mathematics 383 the first problem on his list, the so-called Continuum Hypothesis, is now known to be independent of the usual axioms of mathematics; see Chap. 22.) One hundred years later, at the turn of the twenty-first century, several mathemati- cians collected what they believed were the most important open questions. Seven of these questions are known as the Millennium Problems; the Clay Mathematics Institute offers one-million-dollar prizes for the solution of each of seven important conjectures (e.g., the Riemann Hypothesis, the Poincare´ Conjecture, and “P D NP”)—see www.claymath.org for more information. As of now, six of the Millennium Problems remain open; the Poincare´ Conjecture, however, was solved in 2003 in a fantastic achievement by Grigori Perelman of the Steklov Institute of Mathematics in St. Petersburg. (Perelman chose not to accept the Millennium Prize, as he also declined the most prestigious award in mathematics, the Fields Medal. As he told the President of the International Mathematical Union, the prize “was completely irrelevant for me. Everybody understood that if the proof is correct then no other recognition is needed.”) The Poincare´ Conjecture deals with the characterization of n-dimensional spheres, a fundamental topic in topology. We attempt to explain the Poincare´ Conjecture as follows. In topology, one considers two shapes equivalent if each one can be continuously transformed into the other—breaking and punching holes are not allowed. For example, a topologist would say that a doughnut and a coffee cup are equivalent, but an apple is different. One way to see the difference is by considering various loops on these surfaces. Every loop on an apple can be continuously moved to any other loop—this, however, cannot be said about the coffee cup where, for example, a loop around the ear of the cup cannot be moved to a loop on the side (without breaking up the loop). In 1904, the French mathematician Henri Poincare´ asked whether this simple loop test is enough to identify S n,the n-dimensional sphere. Using more precise (yet here undefined) terminology, the Poincare´ Conjecture (now theorem) can be stated as follows: Theorem A.1 (The PoincareTheorem).´ Every compact, simply connected, smooth n-dimensional manifold is equivalent to the sphere S n. The two-dimensional case was quickly solved by Poincare´ himself, but several decades passed before the next breakthrough occurred. In 1961, Stephen Smale proved the conjecture for every n 5; then, in 1982, Michael Freedman resolved the case n D 4. This left only the three-dimensional case open, which became the non plus ultra question in topology. Perelman’s breakthrough came after deep and extensive work done by many mathematicians. The assignments below offer you a wide variety of project possibilities for further investigation of these conjectures and results as well as additional questions that await mathematicians of the future. 384 A Famous Conjectures in Mathematics Assignments 1. Recall that we call a positive integer n perfect if its positive divisors other than itself add up to n. Related to perfect numbers, we define a pair of positive integers m and n amicable if the positive divisors of m other than m add up to n and the positive divisors of n other than n adduptom. As of today, over 10 million pairs of amicable numbers are known, and it is a famous old conjecture that there are infinitely many. (a) Verify that 220 and 284 form an amicable pair. (b) There have been numerous rules discovered that, under certain conditions, yield amicable numbers. One such rule, known since the tenth century, k kC1 2kC1 states that if p1 D 3 2 1, p2 D 3 2 1,andp3 D 9 2 1 are kC1 kC1 primes for some positive integer k,thenm D 2 p1 p2 and n D 2 p3 are amicable. (For k D 1 we get m D 220 and n D 284.) Verify this result. 2. Here we investigate prime numbers in arithmetic progressions, that is, a sequence of prime numbers of the form a; a C d;a C 2d;:::;aC kd for some positive integers a, d,andk. (a) Find three primes in arithmetic progression. (b) Find four primes in arithmetic progression. (c) Find five primes in arithmetic progression.
Load more

Recommended publications
  • Scalar Curvature and Geometrization Conjectures for 3-Manifolds
    Comparison Geometry MSRI Publications Volume 30, 1997 Scalar Curvature and Geometrization Conjectures for 3-Manifolds MICHAEL T. ANDERSON Abstract. We first summarize very briefly the topology of 3-manifolds and the approach of Thurston towards their geometrization. After dis- cussing some general properties of curvature functionals on the space of metrics, we formulate and discuss three conjectures that imply Thurston’s Geometrization Conjecture for closed oriented 3-manifolds. The final two sections present evidence for the validity of these conjectures and outline an approach toward their proof. Introduction In the late seventies and early eighties Thurston proved a number of very re- markable results on the existence of geometric structures on 3-manifolds. These results provide strong support for the profound conjecture, formulated by Thur- ston, that every compact 3-manifold admits a canonical decomposition into do- mains, each of which has a canonical geometric structure. For simplicity, we state the conjecture only for closed, oriented 3-manifolds. Geometrization Conjecture [Thurston 1982]. Let M be a closed , oriented, 2 prime 3-manifold. Then there is a finite collection of disjoint, embedded tori Ti 2 in M, such that each component of the complement M r Ti admits a geometric structure, i.e., a complete, locally homogeneous RiemannianS metric. A more detailed description of the conjecture and the terminology will be given in Section 1. A complete Riemannian manifold N is locally homogeneous if the universal cover N˜ is a complete homogenous manifold, that is, if the isometry group Isom N˜ acts transitively on N˜. It follows that N is isometric to N=˜ Γ, where Γ is a discrete subgroup of Isom N˜, which acts freely and properly discontinuously on N˜.
    [Show full text]
  • A Tour of Fermat's World
    ATOUR OF FERMAT’S WORLD Ching-Li Chai Samples of numbers More samples in arithemetic ATOUR OF FERMAT’S WORLD Congruent numbers Fermat’s infinite descent Counting solutions Ching-Li Chai Zeta functions and their special values Department of Mathematics Modular forms and University of Pennsylvania L-functions Elliptic curves, complex multiplication and Philadelphia, March, 2016 L-functions Weil conjecture and equidistribution ATOUR OF Outline FERMAT’S WORLD Ching-Li Chai 1 Samples of numbers Samples of numbers More samples in 2 More samples in arithemetic arithemetic Congruent numbers Fermat’s infinite 3 Congruent numbers descent Counting solutions 4 Fermat’s infinite descent Zeta functions and their special values 5 Counting solutions Modular forms and L-functions Elliptic curves, 6 Zeta functions and their special values complex multiplication and 7 Modular forms and L-functions L-functions Weil conjecture and equidistribution 8 Elliptic curves, complex multiplication and L-functions 9 Weil conjecture and equidistribution ATOUR OF Some familiar whole numbers FERMAT’S WORLD Ching-Li Chai Samples of numbers More samples in §1. Examples of numbers arithemetic Congruent numbers Fermat’s infinite 2, the only even prime number. descent 30, the largest positive integer m such that every positive Counting solutions Zeta functions and integer between 2 and m and relatively prime to m is a their special values prime number. Modular forms and L-functions 3 3 3 3 1729 = 12 + 1 = 10 + 9 , Elliptic curves, complex the taxi cab number. As Ramanujan remarked to Hardy, multiplication and it is the smallest positive integer which can be expressed L-functions Weil conjecture and as a sum of two positive integers in two different ways.
    [Show full text]
  • Generalized Riemann Hypothesis Léo Agélas
    Generalized Riemann Hypothesis Léo Agélas To cite this version: Léo Agélas. Generalized Riemann Hypothesis. 2019. hal-00747680v3 HAL Id: hal-00747680 https://hal.archives-ouvertes.fr/hal-00747680v3 Preprint submitted on 29 May 2019 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. Generalized Riemann Hypothesis L´eoAg´elas Department of Mathematics, IFP Energies nouvelles, 1-4, avenue de Bois-Pr´eau,F-92852 Rueil-Malmaison, France Abstract (Generalized) Riemann Hypothesis (that all non-trivial zeros of the (Dirichlet L-function) zeta function have real part one-half) is arguably the most impor- tant unsolved problem in contemporary mathematics due to its deep relation to the fundamental building blocks of the integers, the primes. The proof of the Riemann hypothesis will immediately verify a slew of dependent theorems (Borwien et al.(2008), Sabbagh(2002)). In this paper, we give a proof of Gen- eralized Riemann Hypothesis which implies the proof of Riemann Hypothesis and Goldbach's weak conjecture (also known as the odd Goldbach conjecture) one of the oldest and best-known unsolved problems in number theory. 1. Introduction The Riemann hypothesis is one of the most important conjectures in math- ematics.
    [Show full text]
  • Ces`Aro's Integral Formula for the Bell Numbers (Corrected)
    Ces`aro’s Integral Formula for the Bell Numbers (Corrected) DAVID CALLAN Department of Statistics University of Wisconsin-Madison Medical Science Center 1300 University Ave Madison, WI 53706-1532 [email protected] October 3, 2005 In 1885, Ces`aro [1] gave the remarkable formula π 2 cos θ N = ee cos(sin θ)) sin( ecos θ sin(sin θ) ) sin pθ dθ p πe Z0 where (Np)p≥1 = (1, 2, 5, 15, 52, 203,...) are the modern-day Bell numbers. This formula was reproduced verbatim in the Editorial Comment on a 1941 Monthly problem [2] (the notation Np for Bell number was still in use then). I have not seen it in recent works and, while it’s not very profound, I think it deserves to be better known. Unfortunately, it contains a typographical error: a factor of p! is omitted. The correct formula, with n in place of p and using Bn for Bell number, is π 2 n! cos θ B = ee cos(sin θ)) sin( ecos θ sin(sin θ) ) sin nθ dθ n ≥ 1. n πe Z0 eiθ The integrand is the imaginary part of ee sin nθ, and so an equivalent formula is π 2 n! eiθ B = Im ee sin nθ dθ . (1) n πe Z0 The formula (1) is quite simple to prove modulo a few standard facts about set par- n titions. Recall that the Stirling partition number k is the number of partitions of n n [n] = {1, 2,...,n} into k nonempty blocks and the Bell number Bn = k=1 k counts n k n n k k all partitions of [ ].
    [Show full text]
  • Towards the Poincaré Conjecture and the Classification of 3-Manifolds John Milnor
    Towards the Poincaré Conjecture and the Classification of 3-Manifolds John Milnor he Poincaré Conjecture was posed ninety- space SO(3)/I60 . Here SO(3) is the group of rota- nine years ago and may possibly have tions of Euclidean 3-space, and I60 is the subgroup been proved in the last few months. This consisting of those rotations which carry a regu- note will be an account of some of the lar icosahedron or dodecahedron onto itself (the Tmajor results over the past hundred unique simple group of order 60). This manifold years which have paved the way towards a proof has the homology of the 3-sphere, but its funda- and towards the even more ambitious project of mental group π1(SO(3)/I60) is a perfect group of classifying all compact 3-dimensional manifolds. order 120. He concluded the discussion by asking, The final paragraph provides a brief description of again translated into modern language: the latest developments, due to Grigory Perelman. A more serious discussion of Perelman’s work If a closed 3-dimensional manifold has will be provided in a subsequent note by Michael trivial fundamental group, must it be Anderson. homeomorphic to the 3-sphere? The conjecture that this is indeed the case has Poincaré’s Question come to be known as the Poincaré Conjecture. It At the very beginning of the twentieth century, has turned out to be an extraordinarily difficult Henri Poincaré (1854–1912) made an unwise claim, question, much harder than the corresponding which can be stated in modern language as follows: question in dimension five or more,2 and is a If a closed 3-dimensional manifold has key stumbling block in the effort to classify the homology of the sphere S3 , then it 3-dimensional manifolds.
    [Show full text]
  • MAT344 Lecture 6
    MAT344 Lecture 6 2019/May/22 1 Announcements 2 This week This week, we are talking about 1. Recursion 2. Induction 3 Recap Last time we talked about 1. Recursion 4 Fibonacci numbers The famous Fibonacci sequence starts like this: 1; 1; 2; 3; 5; 8; 13;::: The rule defining the sequence is F1 = 1;F2 = 1, and for n ≥ 3, Fn = Fn−1 + Fn−2: This is a recursive formula. As you might expect, if certain kinds of numbers have a name, they answer many counting problems. Exercise 4.1 (Example 3.2 in [KT17]). Show that a 2 × n checkerboard can be tiled with 2 × 1 dominoes in Fn+1 many ways. Solution: Denote the number of tilings of a 2 × n rectangle by Tn. We check that T1 = 1 and T2 = 2. We want to prove that they satisfy the recurrence relation Tn = Tn−1 + Tn−2: Consider the domino occupying the rightmost spot in the top row of the tiling. It is either a vertical domino, in which case the rest of the tiling can be interpreted as a tiling of a 2 × (n − 1) rectangle, or it is a horizontal domino, in which case there must be another horizontal domino under it, and the rest of the tiling can be interpreted as a tiling of a 2 × (n − 2) rectangle. Therefore Tn = Tn−1 + Tn−2: Since the number of tilings satisfies the same recurrence relation as the Fibonacci numbers, and T1 = F2 = 1 and T2 = F3 = 2, we may conclude that Tn = Fn+1.
    [Show full text]
  • The Process of Student Cognition in Constructing Mathematical Conjecture
    ISSN 2087-8885 E-ISSN 2407-0610 Journal on Mathematics Education Volume 9, No. 1, January 2018, pp. 15-26 THE PROCESS OF STUDENT COGNITION IN CONSTRUCTING MATHEMATICAL CONJECTURE I Wayan Puja Astawa1, I Ketut Budayasa2, Dwi Juniati2 1Ganesha University of Education, Jalan Udayana 11, Singaraja, Indonesia 2State University of Surabaya, Ketintang, Surabaya, Indonesia Email: [email protected] Abstract This research aims to describe the process of student cognition in constructing mathematical conjecture. Many researchers have studied this process but without giving a detailed explanation of how students understand the information to construct a mathematical conjecture. The researchers focus their analysis on how to construct and prove the conjecture. This article discusses the process of student cognition in constructing mathematical conjecture from the very beginning of the process. The process is studied through qualitative research involving six students from the Mathematics Education Department in the Ganesha University of Education. The process of student cognition in constructing mathematical conjecture is grouped into five different stages. The stages consist of understanding the problem, exploring the problem, formulating conjecture, justifying conjecture, and proving conjecture. In addition, details of the process of the students’ cognition in each stage are also discussed. Keywords: Process of Student Cognition, Mathematical Conjecture, qualitative research Abstrak Penelitian ini bertujuan untuk mendeskripsikan proses kognisi mahasiswa dalam mengonstruksi konjektur matematika. Beberapa peneliti mengkaji proses-proses ini tanpa menjelaskan bagaimana siswa memahami informasi untuk mengonstruksi konjektur. Para peneliti dalam analisisnya menekankan bagaimana mengonstruksi dan membuktikan konjektur. Artikel ini membahas proses kognisi mahasiswa dalam mengonstruksi konjektur matematika dari tahap paling awal.
    [Show full text]
  • History of Mathematics
    History of Mathematics James Tattersall, Providence College (Chair) Janet Beery, University of Redlands Robert E. Bradley, Adelphi University V. Frederick Rickey, United States Military Academy Lawrence Shirley, Towson University Introduction. There are many excellent reasons to study the history of mathematics. It helps students develop a deeper understanding of the mathematics they have already studied by seeing how it was developed over time and in various places. It encourages creative and flexible thinking by allowing students to see historical evidence that there are different and perfectly valid ways to view concepts and to carry out computations. Ideally, a History of Mathematics course should be a part of every mathematics major program. A course taught at the sophomore-level allows mathematics students to see the great wealth of mathematics that lies before them and encourages them to continue studying the subject. A one- or two-semester course taught at the senior level can dig deeper into the history of mathematics, incorporating many ideas from the 19th and 20th centuries that could only be approached with difficulty by less prepared students. Such a senior-level course might be a capstone experience taught in a seminar format. It would be wonderful for students, especially those planning to become middle school or high school mathematics teachers, to have the opportunity to take advantage of both options. We also encourage History of Mathematics courses taught to entering students interested in mathematics, perhaps as First Year or Honors Seminars; to general education students at any level; and to junior and senior mathematics majors and minors. Ideally, mathematics history would be incorporated seamlessly into all courses in the undergraduate mathematics curriculum in addition to being addressed in a few courses of the type we have listed.
    [Show full text]
  • A Primer of Analytic Number Theory: from Pythagoras to Riemann Jeffrey Stopple Index More Information
    Cambridge University Press 0521813093 - A Primer of Analytic Number Theory: From Pythagoras to Riemann Jeffrey Stopple Index More information Index #, number of elements in a set, 101 and ␨(2n), 154–157 A =, Abel summation, 202, 204, 213 and Euler-Maclaurin summation, 220 definition, 201 definition, 149 Abel’s Theorem Bernoulli, Jacob, 146, 150, 152 I, 140, 145, 201, 267, 270, 272 Bessarion, Cardinal, 282 II, 143, 145, 198, 267, 270, 272, 318 binary quadratic forms, 270 absolute convergence definition, 296 applications, 133, 134, 139, 157, 167, 194, equivalence relation ∼, 296 198, 208, 215, 227, 236, 237, 266 reduced, 302 definition, 133 Birch Swinnerton-Dyer conjecture, xi, xii, abundant numbers, 27, 29, 31, 43, 54, 60, 61, 291–294, 326 82, 177, 334, 341, 353 Black Death, 43, 127 definition, 27 Blake, William, 216 Achilles, 125 Boccaccio’s Decameron, 281 aliquot parts, 27 Boethius, 28, 29, 43, 278 aliquot sequences, 335 Bombelli, Raphael, 282 amicable pairs, 32–35, 39, 43, 335 de Bouvelles, Charles, 61 definition, 334 Bradwardine, Thomas, 43, 127 ibn Qurra’s algorithm, 33 in Book of Genesis, 33 C2, twin prime constant, 182 amplitude, 237, 253 Cambyses, Persian emperor, 5 Analytic Class Number Formula, 273, 293, Cardano, Girolamo, 25, 282 311–315 Catalan-Dickson conjecture, 336 analytic continuation, 196 Cataldi, Pietro, 30, 333 Anderson, Laurie, ix cattle problem, 261–263 Apollonius, 261, 278 Chebyshev, Pafnuty, 105, 108 Archimedes, 20, 32, 92, 125, 180, 260, 285 Chinese Remainder Theorem, 259, 266, 307, area, basic properties, 89–91, 95, 137, 138, 308, 317 198, 205, 346 Cicero, 21 Aristotle’s Metaphysics,5,127 class number, see also h arithmetical function, 39 Clay Mathematics Institute, xi ∼, asymptotic, 64 comparison test Athena, 28 infinite series, 133 St.
    [Show full text]
  • A Theorem of Fermat on Congruent Number Curves Lorenz Halbeisen, Norbert Hungerbühler
    A Theorem of Fermat on Congruent Number Curves Lorenz Halbeisen, Norbert Hungerbühler To cite this version: Lorenz Halbeisen, Norbert Hungerbühler. A Theorem of Fermat on Congruent Number Curves. Hardy-Ramanujan Journal, Hardy-Ramanujan Society, 2019, Hardy-Ramanujan Journal, 41, pp.15 – 21. hal-01983260 HAL Id: hal-01983260 https://hal.archives-ouvertes.fr/hal-01983260 Submitted on 16 Jan 2019 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. Hardy-Ramanujan Journal 41 (2018), 15-21 submitted 28/03/2018, accepted 06/07/2018, revised 06/07/2018 A Theorem of Fermat on Congruent Number Curves Lorenz Halbeisen and Norbert Hungerb¨uhler To the memory of S. Srinivasan Abstract. A positive integer A is called a congruent number if A is the area of a right-angled triangle with three rational sides. Equivalently, A is a congruent number if and only if the congruent number curve y2 = x3 − A2x has a rational point (x; y) 2 Q2 with y =6 0. Using a theorem of Fermat, we give an elementary proof for the fact that congruent number curves do not contain rational points of finite order.
    [Show full text]
  • Primality Testing for Beginners
    STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker http://dx.doi.org/10.1090/stml/070 Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov The cover illustration is a variant of the Sieve of Eratosthenes (Sec- tion 1.5), showing the integers from 1 to 2704 colored by the number of their prime factors, including repeats. The illustration was created us- ing MATLAB. The back cover shows a phase plot of the Riemann zeta function (see Appendix A), which appears courtesy of Elias Wegert (www.visual.wegert.com). 2010 Mathematics Subject Classification. Primary 11-01, 11-02, 11Axx, 11Y11, 11Y16. For additional information and updates on this book, visit www.ams.org/bookpages/stml-70 Library of Congress Cataloging-in-Publication Data Rempe-Gillen, Lasse, 1978– author. [Primzahltests f¨ur Einsteiger. English] Primality testing for beginners / Lasse Rempe-Gillen, Rebecca Waldecker. pages cm. — (Student mathematical library ; volume 70) Translation of: Primzahltests f¨ur Einsteiger : Zahlentheorie - Algorithmik - Kryptographie. Includes bibliographical references and index. ISBN 978-0-8218-9883-3 (alk. paper) 1. Number theory. I. Waldecker, Rebecca, 1979– author. II. Title. QA241.R45813 2014 512.72—dc23 2013032423 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given.
    [Show full text]
  • Code Library
    Code Library Himemiya Nanao @ Perfect Freeze September 13, 2013 Contents 1 Data Structure 1 1.1 atlantis .......................................... 1 1.2 binary indexed tree ................................... 3 1.3 COT ............................................ 4 1.4 hose ........................................... 7 1.5 Leist tree ........................................ 8 1.6 Network ......................................... 10 1.7 OTOCI ........................................... 16 1.8 picture .......................................... 19 1.9 Size Blanced Tree .................................... 22 1.10 sparse table - rectangle ................................. 27 1.11 sparse table - square ................................... 28 1.12 sparse table ....................................... 29 1.13 treap ........................................... 29 2 Geometry 32 2.1 3D ............................................. 32 2.2 3DCH ........................................... 36 2.3 circle's area ....................................... 40 2.4 circle ........................................... 44 2.5 closest point pair .................................... 45 2.6 half-plane intersection ................................. 49 2.7 intersection of circle and poly .............................. 52 2.8 k-d tree .......................................... 53 2.9 Manhattan MST ..................................... 56 2.10 rotating caliper ...................................... 60 2.11 shit ............................................ 63 2.12 other ..........................................
    [Show full text]