DOCSLIB.ORG

MAT 6932 - Number Theory Seminar

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
MAT 6932 - Number Theory Seminar MAT 6932 - Number Theory Seminar Jay Pantone University of Florida Last Edited: August 19, 2012 2 Contents 1 Some Basic Theorems 1 1.1 RootsofIntegers .................................. ........ 1 1.2 SomeTheoremsofCantor ............................. ........ 3 2 Decimal Representations 4 2.1 DecimalRepresentations............................. ......... 4 2.2 Decimal Expansions and a Criterion for Irrationality . ............ 6 2.3 DecimalApproximations............................... ....... 8 2.4 Irrationality of π .......................................... 11 2.5 Irrationality of π2 .......................................... 12 2.6 Irrationality of the Trig Functions . .......... 14 2.7 Irrationality of the Hyperbolic Trig Functions . ........... 16 3 Engel Series Expansions 17 3.1 Construction ...................................... ...... 17 3.2 SomeTheorems..................................... ...... 19 4 Cantor Product Representation 22 4.1 Construction ...................................... ...... 22 4.2 SomeTheorems..................................... ...... 24 4.3 EvaluationofaSpecialCantorProduct . .......... 26 4.4 ConnectionWithEngelSeries. .. .. .. .. .. .. .. .. .. .. .. ........ 27 5 Sylvester Series 28 5.1 Construction ...................................... ...... 28 5.2 SomeTheorems..................................... ...... 30 5.3 An Irrationality Criterion . ....... 31 6 Continued Fractions 34 6.1 GeneralContinuedFractions. .......... 34 6.2 ConvergenceofGeneralContinuedFractions. .............. 36 6.3 Continued Fractions for e and π .................................. 38 6.4 ConversionofContinuedFractions . .......... 40 6.5 Bessel Functions: Their Quotients and Their Irrationals . .............. 43 6.6 SomeTheorems..................................... ...... 48 6.7 Simple Continued Fractions . ....... 51 6.8 Finite Continued Fraction Expansion of Rationals . ........... 55 6.9 Minkowiski Question Mark Function . ........ 56 6.10 Continued Fraction for e ...................................... 57 6.11 Irrational Numbers and Continued Fraction Convergence . ................. 59 7 Best Approximations 62 7.1 DefinitionandSomeTheorems ........................... ....... 62 7.2 AProceduretoGenerateBestApproximations . ............ 67 i ii CONTENTS 7.3 Connection with Continued Fractions . .......... 69 8 Equivalence of Real Numbers 70 8.1 Definition .......................................... .... 70 8.2 Connection with Continued Fractions . .......... 71 8.3 TheMarkovConstantofaRealNumber . .......... 74 9 Farey Fractions 80 10 Transcendental Numbers 85 10.1 Khintchin’s Metric Theorems . ........ 85 10.2 TheFirstTranscendentalNumber . ........... 87 11 Irrationality Type and Measure 88 11.1 Definitions........................................ ...... 88 11.2 TheThue-Siegel-Roth-DysonTheorem . ............ 90 11.3 Methods for Obtaining Irrationality Type and Measure . .............. 91 11.4 ζ(2) ................................................ 108 11.5 ζ(3) ................................................ 112 11.6 Transcendence of e ......................................... 115 11.7 Transcendence of π ......................................... 117 11.8 ζ(2π)................................................. 119 12 The Transcendence Theorems of Lindemann and Weierstrass 123 13 The Gelfond-Schneider Theorem 128 14 Transcendence Degree and Transcendental Functions 133 14.1 Definitions........................................ ...... 133 14.2 Schanuel’s Conjecture and its Implications . ............ 134 14.3 Transcendental Functions and their Exceptional Sets . ................. 135 15 Uniform Distribution 138 15.1 BasicTheorems.................................... ....... 138 15.2 An Application of Kronecker’s Theorem to Geometry . ............. 142 15.3 Simultaneous Approximation of Real Numbers . ........... 144 15.4 Kronecker’s Theorem in Two Dimensions . ......... 148 15.5 Uniform Distribution Modulo 1 . ....... 151 15.6 TheWeylCriterion.................................. ....... 154 15.7 Similar results on Q ........................................ 156 15.8 Uniform Distribution of Sequences Using Weyl’s Criterion . ............ 163 15.9 ATheoremofvanderCorput. .. .. .. .. .. .. .. .. .. .. ......... 168 15.10 SuccessiveDifferences . .. .. .. .. .. .. .. .. .. .. .. .. .......... 172 15.11 Metric Theorems on Uniform Distribution . ........... 173 16 Diophantine Approximations and Transcendence 175 16.1 Koksma’sGeneralMetricTheorem . .......... 175 16.2 ThePisot-VijayaraghavanNumbers. ............ 181 16.3 NormalNumbers ................................... ....... 183 16.4 Uniform Distribution of Integer Sequences . ............. 186 16.5 Connection Between Uniform Distribution Mod 1 of Reals and Uniform Distribution Mod m of Integer Sequences 16.6 AnApplication ...................................... ..... 195 A Frank Patane: Irrationality Measure 196 B Todd Molnar: Periodic Continued Fractions 198 CONTENTS iii C Duc Huynh: Ford’s Theorem 200 D Jay Pantone: History of π 203 E Meng Liu: Certain Trigonometric Values 220 ∞ n F Ying Guo: Transcendence of α2 223 n=0 G Ali Uncu: Ramanujan Sums 226 H Hongyan Hou: Bernoulli Coefficients 230 I Frank Patane: Bernoulli Polynomials 233 J Todd Molnar: The Sathe/Selberg-Delange Theorem 237 Index 242 iv CONTENTS Chapter 1 Some Basic Theorems 1.1 Roots of Integers Theorem 1: (Euclid) √2 is irrational. p Proof: Suppose toward a contradiction that √2 is rational. Then, √2 = for some p, q Z with q ∈ gcd(p, q) = 1. Now, p p2 √2= = 2= q ⇒ q2 = 2q2 = p2 ⇒ = p2 is even ⇒ = p is even ⇒ = p2 =4r2 =2q2, for some r Z ⇒ ∈ = 2r2 = q2 ⇒ = q2 is even ⇒ = q is even ⇒ = gcd(p, q) =1. ⇒ We have reached a contradiction. Thus √2 is not rational. Theorem 2: If n Z and n is not a perfect kth power for some k Z+, then √k n is irrational. ∈ ∈ a Proof: Suppose that √k n = , for some a,b Z. Define ν (m) := the largest power of a prime p that b ∈ p k k k k divides m. So, nb = a . Now now that for all primes p, we have νp(a ) k. Similarly, νp(b ) k. | | th Hence νp(n) k. Now, since all primes p divide n a multiple of k times, we have that n is a perfect k power. Thus| we have proved the contrapositive. Corollary: If n, k Z+, then either √k n Z or √k n is irrational. ∈ ∈ 1 2 CHAPTER 1. SOME BASIC THEOREMS Theorem 3: (Rational Root Theorem) If P (x) Z[x] is written as P (x) = a + a x + + a xn, and if ∈ 0 1 ··· n P p = 0, for p Q with gcd(p, q) = 1, then q a and p a . q q ∈ | n | 0 p p pn Proof: Let P ( )= a + a + + a n . Then, q 0 1 q ··· n q n n 1 n a q = a q − p + + a p . (3.1) − 0 1 ··· n Now observe that the right-hand side of (3.1) is a multiple of p, and thus so is the left-hand side. Since n gcd(p, q) = 1, we have p a0. Similarly, since q LHS(3.1) and q divides all terms but anp in the right-hand side of (3.1), we| must have q a pn. Since| gcd(p, q) = 1, it follows that q a . | n | n Corollary: If P (x) Z[z] is monic, then the rational roots, if any, are integers which divide a = P (0). ∈ 0 Example: P (x)= x2 2. By the Rational Root Theorem, there are no integer roots (we only need to test 1, 2). So, the two− roots must be irrational, and thus √2 is irrational. ± ± Exercise: Show that √2+ √3 is irrational. Archimedean Property: If α, β are positive reals, then there exists n N+ such that nα<β. ∈ Theorem 4: Between any two real numbers, there exists both a rational and an irrational number. Proof: Without loss of generality, let 0 <α<β. Then, β α> 0. So, there exists n Z+ such that n(β α) > 1. Now, nβ > nα + 1. Since nβ and nα differ by− more than 1, there is an∈ integer m such − m that nα<m<nβ. Thus, α< n <β. To find an irrational number between α and β, find n such that n(β α) > √2 and proceed similarly. − Corollary: Between any two rationals there exists an irrational. Between any two irrationals there exists a rational. 1.2. SOME THEOREMS OF CANTOR 3 1.2 Some Theorems of Cantor Theorem A: (Cantor) The set of rationals Q is countable. Proof: First list the rationals in [0, 1] is lexicographical order by denominator then numerator: 0 1 1 1 2 1 3 , , , , , , ,.... 1 1 2 3 3 4 4 To get all of Q, take each fraction in the list, and follow it by its negative, its reciprocal, and its negative reciprocal: 0 1 1 1 1 2 2 1 1 3 3 , , , , , , , , , , ,.... 1 1 −1 2 −2 1 −1 3 −3 1 −1 This is all of Q, enumerated on the integers. Thus Q is countable. Theorem B: (Cantor) R is uncountable. Theorem C: (Cantor) The set RQ of irrationals is uncountable. Remark: Just because two things have the same cardinality doesn’t mean it’s easy to find a bijection between them. For example, consider the sets [0, 1] and (0, 1). To find a bijection between these two sets, pick a countably infinite set X := 0, 1, x , x ,... [0, 1]. Then, let { 1 2 }⊂ r, r X x , r =0∈ ϕ(r) := 1 . x , r =1 2 xi+2, r = xi Chapter 2 Decimal Representations 2.1 Decimal Representations Definition: A decimal representation is a series ∞ a i , 10i i=1 where ai satisfies 0 ai 9 and for infinitely many ai, we have ai < 9 (this prevents duplicate series such as .6729999 ... = .673).≤ ≤ Remark: Note that: ∞ a ∞ 9 0 i < =1. ≤ 10i 10i i=1 i=1 Theorem 5: (i) Every decimal representation converges to a real number α [0, 1). ∈ (ii) Every real α [0, 1) admits a decimal representation. ∈ (iii) The decimal representation in (ii) is unique. Proof: We’ve already shown part (i). Next, denote [x] := the greatest integer x and x := x [x] [0, 1). ≤ { } − ∈ Uniqueness: Let α = .a a a .... So, 10α = a + .a a ... and thus a = [10α] and α := .a a ... = 10α . 1 2 3 1 2 3 1 1 2 3 { } So, a1 and α1 are uniquely determined. Iterating, we see that all ai are uniquely defined by a = [10α ] i+1 i . (5.1) α = 10α i+1 { i} Existence Given an α, define a as in (5.1) with α =: α . Clearly 0 a 9, since 0 α < 1. i 0 ≤ i ≤ ≤ i So 0 10αi < 10. Now we claim α = .a1a2 ..., and we use induction. Note that ≤ a 10α α α .a = α 1 = − 1 . − 1 − 10 10 4 2.1. DECIMAL REPRESENTATIONS 5 10an 1 Now we claim that α .a a ...a = { − }. To see this, observe that − 1 2 n 10n a1 an 1 an − α .a1a2 ...an = α + + n 1 n . − − 10 ··· 10 − − 10 By the Induction Hypothesis, this equals 10αi 2 an 10αn 1 [10αn 1] 10αn 1 − − − − { n 1 } n = − n = { n }. 10 − − 10 10 10 Now, by letting n , we get existence.
Load more

Recommended publications
  • Power Values of Divisor Sums Author(S): Frits Beukers, Florian Luca, Frans Oort Reviewed Work(S): Source: the American Mathematical Monthly, Vol
    Power Values of Divisor Sums Author(s): Frits Beukers, Florian Luca, Frans Oort Reviewed work(s): Source: The American Mathematical Monthly, Vol. 119, No. 5 (May 2012), pp. 373-380 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/10.4169/amer.math.monthly.119.05.373 . Accessed: 15/02/2013 04:05 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp . JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to The American Mathematical Monthly. http://www.jstor.org This content downloaded on Fri, 15 Feb 2013 04:05:44 AM All use subject to JSTOR Terms and Conditions Power Values of Divisor Sums Frits Beukers, Florian Luca, and Frans Oort Abstract. We consider positive integers whose sum of divisors is a perfect power. This prob- lem had already caught the interest of mathematicians from the 17th century like Fermat, Wallis, and Frenicle. In this article we study this problem and some variations. We also give an example of a cube, larger than one, whose sum of divisors is again a cube. 1. INTRODUCTION. Recently, one of the current authors gave a mathematics course for an audience with a general background and age over 50.
    [Show full text]
  • Euler's Calculation of the Sum of the Reciprocals of the Squares
    Euler's Calculation of the Sum of the Reciprocals of the Squares Kenneth M. Monks ∗ August 5, 2019 A central theme of most second-semester calculus courses is that of infinite series. Simply put, to study infinite series is to attempt to answer the following question: What happens if you add up infinitely many numbers? How much sense humankind made of this question at different points throughout history depended enormously on what exactly those numbers being summed were. As far back as the third century bce, Greek mathematician and engineer Archimedes (287 bce{212 bce) used his method of exhaustion to carry out computations equivalent to the evaluation of an infinite geometric series in his work Quadrature of the Parabola [Archimedes, 1897]. Far more difficult than geometric series are p-series: series of the form 1 X 1 1 1 1 = 1 + + + + ··· np 2p 3p 4p n=1 for a real number p. Here we show the history of just two such series. In Section 1, we warm up with Nicole Oresme's treatment of the harmonic series, the p = 1 case.1 This will lessen the likelihood that we pull a muscle during our more intense Section 3 excursion: Euler's incredibly clever method for evaluating the p = 2 case. 1 Oresme and the Harmonic Series In roughly the year 1350 ce, a University of Paris scholar named Nicole Oresme2 (1323 ce{1382 ce) proved that the harmonic series does not sum to any finite value [Oresme, 1961]. Today, we would say the series diverges and that 1 1 1 1 + + + + ··· = 1: 2 3 4 His argument was brief and beautiful! Let us admire it below.
    [Show full text]
  • Fundamental Theorems in Mathematics
    SOME FUNDAMENTAL THEOREMS IN MATHEMATICS OLIVER KNILL Abstract. An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 243 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful and whether it could serve as a guide [6] without leading to panic. The order is not a ranking but ordered along a time-line when things were writ- ten down. Since [556] stated “a mathematical theorem only becomes beautiful if presented as a crown jewel within a context" we try sometimes to give some context. Of course, any such list of theorems is a matter of personal preferences, taste and limitations. The num- ber of theorems is arbitrary, the initial obvious goal was 42 but that number got eventually surpassed as it is hard to stop, once started. As a compensation, there are 42 “tweetable" theorems with included proofs. More comments on the choice of the theorems is included in an epilogue. For literature on general mathematics, see [193, 189, 29, 235, 254, 619, 412, 138], for history [217, 625, 376, 73, 46, 208, 379, 365, 690, 113, 618, 79, 259, 341], for popular, beautiful or elegant things [12, 529, 201, 182, 17, 672, 673, 44, 204, 190, 245, 446, 616, 303, 201, 2, 127, 146, 128, 502, 261, 172]. For comprehensive overviews in large parts of math- ematics, [74, 165, 166, 51, 593] or predictions on developments [47]. For reflections about mathematics in general [145, 455, 45, 306, 439, 99, 561]. Encyclopedic source examples are [188, 705, 670, 102, 192, 152, 221, 191, 111, 635].
    [Show full text]
  • A SIMPLE COMPUTATION of Ζ(2K) 1. Introduction in the Mathematical Literature, One Finds Many Ways of Obtaining the Formula
    A SIMPLE COMPUTATION OF ζ(2k) OSCAR´ CIAURRI, LUIS M. NAVAS, FRANCISCO J. RUIZ, AND JUAN L. VARONA Abstract. We present a new simple proof of Euler's formulas for ζ(2k), where k = 1; 2; 3;::: . The computation is done using only the defining properties of the Bernoulli polynomials and summing a telescoping series, and the same method also yields integral formulas for ζ(2k + 1). 1. Introduction In the mathematical literature, one finds many ways of obtaining the formula 1 X 1 (−1)k−122k−1π2k ζ(2k) := = B ; k = 1; 2; 3;:::; (1) n2k (2k)! 2k n=1 where Bk is the kth Bernoulli number, a result first published by Euler in 1740. For example, the recent paper [2] contains quite a complete list of references; among them, the articles [3, 11, 12, 14] published in this Monthly. The aim of this paper is to give a new proof of (1) which is simple and elementary, in the sense that it involves only basic one variable Calculus, the Bernoulli polynomials, and a telescoping series. As a bonus, it also yields integral formulas for ζ(2k + 1) and the harmonic numbers. 1.1. The Bernoulli polynomials | necessary facts. For completeness, we be- gin by recalling the definition of the Bernoulli polynomials Bk(t) and their basic properties. There are of course multiple approaches one can take (see [7], which shows seven ways of defining these polynomials). A frequent starting point is the generating function 1 xext X xk = B (t) ; ex − 1 k k! k=0 from which, by the uniqueness of power series expansions, one can quickly obtain many of their basic properties.
    [Show full text]
  • Leonhard Euler - Wikipedia, the Free Encyclopedia Page 1 of 14
    Leonhard Euler - Wikipedia, the free encyclopedia Page 1 of 14 Leonhard Euler From Wikipedia, the free encyclopedia Leonhard Euler ( German pronunciation: [l]; English Leonhard Euler approximation, "Oiler" [1] 15 April 1707 – 18 September 1783) was a pioneering Swiss mathematician and physicist. He made important discoveries in fields as diverse as infinitesimal calculus and graph theory. He also introduced much of the modern mathematical terminology and notation, particularly for mathematical analysis, such as the notion of a mathematical function.[2] He is also renowned for his work in mechanics, fluid dynamics, optics, and astronomy. Euler spent most of his adult life in St. Petersburg, Russia, and in Berlin, Prussia. He is considered to be the preeminent mathematician of the 18th century, and one of the greatest of all time. He is also one of the most prolific mathematicians ever; his collected works fill 60–80 quarto volumes. [3] A statement attributed to Pierre-Simon Laplace expresses Euler's influence on mathematics: "Read Euler, read Euler, he is our teacher in all things," which has also been translated as "Read Portrait by Emanuel Handmann 1756(?) Euler, read Euler, he is the master of us all." [4] Born 15 April 1707 Euler was featured on the sixth series of the Swiss 10- Basel, Switzerland franc banknote and on numerous Swiss, German, and Died Russian postage stamps. The asteroid 2002 Euler was 18 September 1783 (aged 76) named in his honor. He is also commemorated by the [OS: 7 September 1783] Lutheran Church on their Calendar of Saints on 24 St. Petersburg, Russia May – he was a devout Christian (and believer in Residence Prussia, Russia biblical inerrancy) who wrote apologetics and argued Switzerland [5] forcefully against the prominent atheists of his time.
    [Show full text]
  • MODERN MATHEMATICS 1900 to 1950
    Free ebooks ==> www.Ebook777.com www.Ebook777.com Free ebooks ==> www.Ebook777.com MODERN MATHEMATICS 1900 to 1950 Michael J. Bradley, Ph.D. www.Ebook777.com Free ebooks ==> www.Ebook777.com Modern Mathematics: 1900 to 1950 Copyright © 2006 by Michael J. Bradley, Ph.D. All rights reserved. No part of this book may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage or retrieval systems, without permission in writing from the publisher. For information contact: Chelsea House An imprint of Infobase Publishing 132 West 31st Street New York NY 10001 Library of Congress Cataloging-in-Publication Data Bradley, Michael J. (Michael John), 1956– Modern mathematics : 1900 to 1950 / Michael J. Bradley. p. cm.—(Pioneers in mathematics) Includes bibliographical references and index. ISBN 0-8160-5426-6 (acid-free paper) 1. Mathematicians—Biography. 2. Mathematics—History—20th century. I. Title. QA28.B736 2006 510.92'2—dc22 2005036152 Chelsea House books are available at special discounts when purchased in bulk quantities for businesses, associations, institutions, or sales promotions. Please call our Special Sales Department in New York at (212) 967-8800 or (800) 322-8755. You can find Chelsea House on the World Wide Web at http://www.chelseahouse.com Text design by Mary Susan Ryan-Flynn Cover design by Dorothy Preston Illustrations by Jeremy Eagle Printed in the United States of America MP FOF 10 9 8 7 6 5 4 3 2 1 This book is printed on acid-free paper.
    [Show full text]
  • Scope of Various Random Number Generators in Ant System Approach for Tsp
    AC 2007-458: SCOPE OF VARIOUS RANDOM NUMBER GENERATORS IN ANT SYSTEM APPROACH FOR TSP S.K. Sen, Florida Institute of Technology Syamal K Sen ([email protected]) is currently a professor in the Dept. of Mathematical Sciences, Florida Institute of Technology (FIT), Melbourne, Florida. He did his Ph.D. (Engg.) in Computational Science from the prestigious Indian Institute of Science (IISc), Bangalore, India in 1973 and then continued as a faculty of this institute for 33 years. He was a professor of Supercomputer Computer Education and Research Centre of IISc during 1996-2004 before joining FIT in January 2004. He held a Fulbright Fellowship for senior teachers in 1991 and worked in FIT. He also held faculty positions, on leave from IISc, in several universities around the globe including University of Mauritius (Professor, Maths., 1997-98), Mauritius, Florida Institute of Technology (Visiting Professor, Math. Sciences, 1995-96), Al-Fateh University (Associate Professor, Computer Engg, 1981-83.), Tripoli, Libya, University of the West Indies (Lecturer, Maths., 1975-76), Barbados.. He has published over 130 research articles in refereed international journals such as Nonlinear World, Appl. Maths. and Computation, J. of Math. Analysis and Application, Simulation, Int. J. of Computer Maths., Int. J Systems Sci., IEEE Trans. Computers, Internl. J. Control, Internat. J. Math. & Math. Sci., Matrix & Tensor Qrtly, Acta Applicande Mathematicae, J. Computational and Applied Mathematics, Advances in Modelling and Simulation, Int. J. Engineering Simulation, Neural, Parallel and Scientific Computations, Nonlinear Analysis, Computers and Mathematics with Applications, Mathematical and Computer Modelling, Int. J. Innovative Computing, Information and Control, J. Computational Methods in Sciences and Engineering, and Computers & Mathematics with Applications.
    [Show full text]
  • Three Aspects of the Theory of Complex Multiplication
    Three Aspects of the Theory of Complex Multiplication Takase Masahito Introduction In the letter addressed to Dedekind dated March 15, 1880, Kronecker wrote: - the Abelian equations with square roots of rational numbers are ex­ hausted by the transformation equations of elliptic functions with sin­ gular modules, just as the Abelian equations with integral coefficients are exhausted by the cyclotomic equations. ([Kronecker 6] p. 455) This is a quite impressive conjecture as to the construction of Abelian equations over an imaginary quadratic number fields, which Kronecker called "my favorite youthful dream" (ibid.). The aim of the theory of complex multiplication is to solve Kronecker's youthful dream; however, it is not the history of formation of the theory of complex multiplication but Kronecker's youthful dream itself that I would like to consider in the present paper. I will consider Kronecker's youthful dream from three aspects: its history, its theoretical character, and its essential meaning in mathematics. First of all, I will refer to the history and theoretical character of the youthful dream (Part I). Abel modeled the division theory of elliptic functions after the division theory of a circle by Gauss and discovered the concept of an Abelian equation through the investigation of the algebraically solvable conditions of the division equations of elliptic functions. This discovery is the starting point of the path to Kronecker's youthful dream. If we follow the path from Abel to Kronecker, then it will soon become clear that Kronecker's youthful dream has the theoretical character to be called the inverse problem of Abel.
    [Show full text]
  • The Zeta Quotient $\Zeta (3)/\Pi^ 3$ Is Irrational
    The Zeta Quotient ζ(3)/π3 is Irrational N. A. Carella Abstract: This note proves that the first odd zeta value does not have a closed form formula ζ(3) = rπ3 for any rational number r Q. Furthermore, assuming the irrationality of the second odd zeta6 value ζ(5), it is shown that ζ∈(5) = rπ5 for any rational number r Q. 6 ∈ 1 Introduction The first even zeta value has a closed form formula ζ(2) = π2/6, and the first odd zeta value has a nearly closed formula given by the Lerch representation 7π3 1 ζ(3) = 2 , (1) 180 − n3(e2πn 1) nX≥1 − confer (45) for more general version. This representation is a special case of the Ramanujan formula for odd zeta values, see [6], and other generalized version proved in [11]. However, it is not known if there exists a closed form formula ζ(3) = rπ3 with r Q, see [27, p. 167], [18, p. 3] for related materials. ∈ Theorem 1.1. The odd zeta value ζ(3) = rπ3, (2) 6 for any rational number r Q. ∈ The proof of this result is simply a corollary of Theorem 4.4 in Section 4. The basic technique gen- eralizes to other odd zeta values. As an illustration of the versatility of this technique, conditional on the irrationality of the zeta value ζ(5), in Theorem 5.5 it is shown that ζ(5)/π5 is irrational. The preliminary Section 2 and Section 3 develop the required foundation, and the proofs of the various results are presented in Section 4 and Section 5.
    [Show full text]
  • On Transcendence Theory with Little History, New Results and Open Problems
    On Transcendence Theory with little history, new results and open problems Hyun Seok, Lee December 27, 2015 Abstract This talk will be dealt to a survey of transcendence theory, including little history, the state of the art and some of the main conjectures, the limits of the current methods and the obstacles which are preventing from going further. 1 Introudction Definition 1.1. An algebraic number is a complex number which is a root of a polynomial with rational coefficients. p p p • For example 2, i = −1, the Golden Ration (1 + 5)=2, the roots of unity e2πia=b, the roots of the polynomial x5 − 6x + 3 = 0 are algebraic numbers. Definition 1.2. A transcendental number is a complex number which is not algebraic. Definition 1.3. Complex numbers α1; ··· ; αn are algebraically dependent if there exists a non-zero polynomial P (x1; ··· ; xn) in n variables with rational co- efficients such that P (α1; ··· ; αn) = 0. Otherwise, they are called algebraically independent. The existence of transcendental numbers was proved in 1844 by J. Liouville who gave explicit ad-hoc examples. The transcendence of constants from analysis is harder; the first result was achieved in 1873 by Ch. Hermite who proved the transcendence of e. In 1882, the proof by F. Lindemann of the transcendence of π gave the final (and negative) answer to the Greek problem of squaring the p circle. The transcendence of 2 2 and eπ, which was included in Hilbert's seventh problem in 1900, was proved by Gel'fond and Schneider in 1934.
    [Show full text]
  • Another Proof of ∑
    P1 1 π2 Another Proof of n=1 n2 = 6 Sourangshu Ghosh∗1 1Department of Civil Engineering, Indian Institute of Technology, Kharagpur 2020 Mathematics Subject Classification: 11M06. Keywords: Zeta Function, Pi, Basel Problem. Abstract In this paper we present a new solution to the Basel problem using a complex line log(1+z) integral of z . 1 Introduction The Basel problem is a famous problem in number theory, first posed by Pietro Mengoli in 1644, and solved by Leonhard Euler in 1735. The Problem remained open for 90 years, π2 until Euler found the exact sum to be 6 , in 1734. He would eventually propose three P1 1 separate solutions to the problem during his lifetime for n=1 n2 . The Basel problem asks for the sum of the series: 1 X 1 1 1 1 = + + + :: n2 12 22 32 n=1 The first proof which was given by Euler used the Weierstrass factorization theorem to rep- resent the sine function as an infinite product of linear factors given by its roots [13]. This same approach can be used to find out values of zeta function at even values using formulas obtained from elementary symmetric polynomials [22]. A solution in similar lines was given by Kortram [19]. Many solutions of the Basel problem use double integral representations of ζ(2) [8][24][25]. Proofs using this method are presented in [3][4][1][12][14]. Choe [9] used the power series expansion of the inverse sine function to find a solution to the problem. Many solutions to the problem use extensive trigonometric inequalities and identities, as presented in [6][2][20][15].
    [Show full text]
  • Abstracts for 18 Category Theory; Homological 62 Statistics Algebra 65 Numerical Analysis Syracuse, October 2–3, 2010
    A bstr bstrActs A A cts mailing offices MATHEMATICS and additional of Papers Presented to the Periodicals postage 2010 paid at Providence, RI American Mathematical Society SUBJECT CLASSIFICATION Volume 31, Number 4, Issue 162 Fall 2010 Compiled in the Editorial Offices of MATHEMATICAL REVIEWS and ZENTRALBLATT MATH 00 General 44 Integral transforms, operational calculus 01 History and biography 45 Integral equations Editorial Committee 03 Mathematical logic and foundations 46 Functional analysis 05 Combinatorics 47 Operator theory Robert J. Daverman, Chair Volume 31 • Number 4 Fall 2010 Volume 06 Order, lattices, ordered 49 Calculus of variations and optimal Georgia Benkart algebraic structures control; optimization 08 General algebraic systems 51 Geometry Michel L. Lapidus 11 Number theory 52 Convex and discrete geometry Matthew Miller 12 Field theory and polynomials 53 Differential geometry 13 Commutative rings and algebras 54 General topology Steven H. Weintraub 14 Algebraic geometry 55 Algebraic topology 15 Linear and multilinear algebra; 57 Manifolds and cell complexes matrix theory 58 Global analysis, analysis on manifolds 16 Associative rings and algebras 60 Probability theory and stochastic 17 Nonassociative rings and algebras processes Abstracts for 18 Category theory; homological 62 Statistics algebra 65 Numerical analysis Syracuse, October 2–3, 2010 ....................... 655 19 K-theory 68 Computer science 20 Group theory and generalizations 70 Mechanics of particles and systems Los Angeles, October 9–10, 2010 .................. 708 22 Topological groups, Lie groups 74 Mechanics of deformable solids 26 Real functions 76 Fluid mechanics 28 Measure and integration 78 Optics, electromagnetic theory Notre Dame, November 5–7, 2010 ................ 758 30 Functions of a complex variable 80 Classical thermodynamics, heat transfer 31 Potential theory 81 Quantum theory Richmond, November 6–7, 2010 ..................
    [Show full text]