DOCSLIB.ORG

Numbers and Functions from a Classical- Experimental Mathematician’S Point of View

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

STUDENT MATHEMATICAL LIBRARY Volume 65 Numbers and Functions From a classical- experimental mathematician’s point of view Victor H. Moll http://dx.doi.org/10.1090/stml/065 Numbers and Functions From a classical- experimental mathematician’s point of view STUDENT MATHEMATICAL LIBRARY Volume 65 Numbers and Functions From a classical- experimental mathematician’s point of view Victor H. Moll American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov 2010 Mathematics Subject Classification. Primary 05A05, 05C05, 11A07, 11A41, 11A55, 11B39, 11B65, 33B10, 33B15, 33F10. For additional information and updates on this book, visit www.ams.org/bookpages/stml-65 Library of Congress Cataloging-in-Publication Data Moll, Victor H., 1956– Numbers and functions : from a classical-experimental mathematician’s point of view / Victor H. Moll. p. cm. Includes bibliographical references and index. ISBN 978-0-8218-8795-0 (alk. paper) 1. Functions—Textbooks. 2. Calculus—Textbooks. I. Title. QA331.M72 2012 515.25–dc23 2012014772 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. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904- 2294 USA. Requests can also be made by e-mail to [email protected]. c 2012 by the author. All rights reserved. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at http://www.ams.org/ 10987654321 171615141312 Dedicated to Olivier Espinosa Contents Preface xiii Chapter 1. The Number Systems 1 §1.1. The natural numbers 1 §1.2. An automatic approach to finite sums 3 §1.3. Elementary counting 8 §1.4. The integers and divisibility 11 §1.5. The Euclidean algorithm 12 §1.6. Modular arithmetic 19 §1.7. Prime numbers 20 §1.8. The rational numbers 29 §1.9. The set of real numbers 40 §1.10. Fundamental sequences and completions 52 §1.11. Complex numbers 54 Chapter 2. Factorials and Binomial Coefficients 57 §2.1. The definitions 57 §2.2. A counting argument 60 §2.3. The generating function of binomial coefficients 61 §2.4. An extension of the binomial theorem to noninteger exponents 63 vii viii Contents §2.5. Congruences for factorials and binomial coefficients 66 §2.6. The prime factorization of n!76 §2.7. The central binomial coefficients 82 §2.8. Bertrand’s postulate 88 §2.9. Some generating functions involving valuations 91 §2.10. The asymptotics of factorials: Stirling’s formula 94 §2.11. The trinomial coefficients 96 Chapter 3. The Fibonacci Numbers 105 §3.1. Introduction 105 §3.2. What do they count? 106 §3.3. The generating function 108 §3.4. A family of related numbers 110 §3.5. Some arithmetical properties 112 §3.6. Modular properties of Fibonacci numbers 120 §3.7. Continued fractions of powers of Fibonacci quotients 123 §3.8. Fibonacci polynomials 124 §3.9. Series involving Fibonacci numbers 129 Chapter 4. Polynomials 133 §4.1. Introduction 133 §4.2. Examples of polynomials 134 §4.3. The division algorithm 139 §4.4. Roots of polynomials 141 §4.5. The fundamental theorem of algebra 144 §4.6. The solution of polynomial equations 146 §4.7. Cubic polynomials 151 §4.8. Quartic polynomials 155 Chapter 5. Binomial Sums 159 §5.1. Introduction 159 §5.2. Power sums 160 §5.3. Moment sums 167 Contents ix §5.4. Recurrences for powers of binomials 171 §5.5. Calkin’s identity 173 Chapter 6. Catalan Numbers 179 §6.1. The placing of parentheses 179 §6.2. A recurrence 179 §6.3. The generating function 180 §6.4. Arithmetical properties 186 §6.5. An integral expression 190 Chapter 7. The Stirling Numbers of the Second Kind 191 §7.1. Introduction 191 §7.2. A recurrence 192 §7.3. An explicit formula 194 §7.4. The valuations of Stirling numbers 197 Chapter 8. Rational Functions 211 §8.1. Introduction 211 §8.2. The method of partial fractions 213 §8.3. Rational generating functions 217 §8.4. The operator point of view 219 §8.5. A dynamical system 221 §8.6. Sums of four squares 225 §8.7. The integration of rational functions 229 §8.8. Symbolic integration. The methods of Hermite and Rothstein-Trager 237 Chapter 9. Wallis’ Formula 245 §9.1. An experimental approach 245 §9.2. A proof based on recurrences 247 §9.3. A proof based on generating functions 248 §9.4. A trigonometric version 249 §9.5. An automatic proof 252 x Contents Chapter 10. Farey Fractions 255 §10.1. Introduction 255 §10.2. Farey fractions and the Stern-Brocot tree 255 §10.3. The distribution of denominators 262 Chapter 11. The Exponential Function 269 §11.1. Introduction 269 §11.2. Elementary properties of the exponential function 272 §11.3. The constant e 274 §11.4. The series representation of e 275 §11.5. Arithmetical properties of e 278 §11.6. Continued fractions connected to e 284 §11.7. Derangements: The presence of e in combinatorics 288 §11.8. The natural logarithm 293 §11.9. The binary expansion of ln 2 294 §11.10. The irrationality of ln 2 295 §11.11. Harmonic numbers 302 Chapter 12. Trigonometric Functions 309 §12.1. Introduction 309 §12.2. The notion of angle 309 §12.3. Sine and cosine 311 §12.4. The additional trigonometric functions 314 §12.5. The addition theorem 320 §12.6. Stirling’s formula and π 323 §12.7. The continued fraction of π 325 §12.8. The digits of π in base 16 330 §12.9. Special values of trigonometric functions 331 §12.10. The roots of a cubic polynomial 335 §12.11. A special trigonometric integral 339 §12.12. The infinite product for sin x 343 Contents xi §12.13. The irrationality of π 346 §12.14. Arctangent sums and a dynamical system 349 Chapter 13. Bernoulli Polynomials 355 §13.1. Introduction 355 §13.2. The exponential generating function 356 §13.3. Elementary properties of Bernoulli numbers 357 §13.4. Integrals involving Bernoulli polynomials 366 §13.5. A relation to Stirling numbers 369 §13.6. Arithmetic properties of Bernoulli numbers 371 §13.7. The Euler-MacLaurin summation formula 376 §13.8. Bernoulli numbers and solitons 383 §13.9. The Giuga-Agoh conjectured criterion for primality 384 Chapter 14. A Sample of Classical Polynomials: Legendre, Chebyshev, and Hermite 387 §14.1. Introduction 387 §14.2. Legendre polynomials 387 §14.3. Chebyshev polynomials 400 §14.4. Hermite polynomials 403 Chapter 15. Landen Transformations 411 §15.1. Introduction 411 §15.2. An elementary example 413 §15.3. The case of rational integrands 415 §15.4. The evaluation of a quartic integral 417 §15.5. An integrand of degree six 435 §15.6. The original elliptic case 438 Chapter 16. Three Special Functions: Γ,ψ,and ζ 445 §16.1. Introduction 445 §16.2. The gamma function 446 xii Contents §16.3. Elementary properties of the gamma function 447 §16.4. Special values of the gamma function 449 §16.5. The infinite product for the gamma function 450 §16.6. The beta function 455 §16.7. The digamma function 458 §16.8. The Riemann zeta function 460 §16.9. The values of ζ(2n) 461 §16.10. Ap´ery’s constant ζ(3) 463 Bibliography 473 Index 493 Preface In the process of writing a mathematics book, an author has to make a variety of decisions. The central theme of the book must be followed by deciding on a potential audience to whom the book is directed, and then a choice of style for presenting the material must be made. This book began as a collection of additional notes given to stu- dents participating in the courses taught by the author at Tulane University. These courses included: • The calculus sequence. This is the typical two-semester course on differential and integral calculus. The standard book used at Tulane is J. Stewart [281]. The author has used M. Spivak [277]for the Honor section, which is slightly more advanced than the regular one. • Discrete mathematics. This course introduces students to mathematical induction and provides a glimpse of number theory. This is the first time where the students are exposed to proofs. The books used in the past include M. Aigner [4]andK.Rosen[256]. • Combinatorics. This is a one-semester course that includes basic counting techniques, recurrences, combinatorial identities, and the ideas behind bijective proofs. The author has used a selection of texts, including T. Andreescu and Z. Feng [17], A. Benjamin and J. Quinn [46], M. Bona [58], and R. Brualdi [82]. xiii xiv Preface • Number theory. This is also a one-semester course covering the basics of the subject: primality and factorization, congruences, diophantine equations, continued fractions, primitive roots, and qua- dratic reciprocity. The texts used by the author include G. H. Hardy and E. M. Wright [160], K. Ireland and M. Rosen [178], K. Rosen [257], and J. H. Silverman [274]. • Real analysis. This is one of the few required courses for a mathematics major. It introduces the student to the real line and all of its properties. Sequences and completeness, the study of the real line, continuity, and compactness form the bulk of the course.
Recommended publications
  • Generalizations of Euler Numbers and Polynomials 1

    Generalizations of Euler Numbers and Polynomials 1

    GENERALIZATIONS OF EULER NUMBERS AND POLYNOMIALS QIU-MING LUO AND FENG QI Abstract. In this paper, the concepts of Euler numbers and Euler polyno- mials are generalized, and some basic properties are investigated. 1. Introduction It is well-known that the Euler numbers and polynomials can be defined by the following definitions. Definition 1.1 ([1]). The Euler numbers Ek are defined by the following expansion t ∞ 2e X Ek = tk, |t| ≤ π. (1.1) e2t + 1 k! k=0 In [4, p. 5], the Euler numbers is defined by t/2 ∞ n 2n 2e t X (−1) En t = sech = , |t| ≤ π. (1.2) et + 1 2 (2n)! 2 n=0 Definition 1.2 ([1, 4]). The Euler polynomials Ek(x) for x ∈ R are defined by xt ∞ 2e X Ek(x) = tk, |t| ≤ π. (1.3) et + 1 k! k=0 It can also be shown that the polynomials Ei(t), i ∈ N, are uniquely determined by the following two properties 0 Ei(t) = iEi−1(t),E0(t) = 1; (1.4) i Ei(t + 1) + Ei(t) = 2t . (1.5) 2000 Mathematics Subject Classification. 11B68. Key words and phrases. Euler numbers, Euler polynomials, generalization. The authors were supported in part by NNSF (#10001016) of China, SF for the Prominent Youth of Henan Province, SF of Henan Innovation Talents at Universities, NSF of Henan Province (#004051800), Doctor Fund of Jiaozuo Institute of Technology, China. This paper was typeset using AMS-LATEX. 1 2 Q.-M. LUO AND F. QI Euler polynomials are related to the Bernoulli numbers. For information about Bernoulli numbers and polynomials, please refer to [1, 2, 3, 4].
  • Arxiv:1301.0252V1 [Math.NT]

    Arxiv:1301.0252V1 [Math.NT]

    VARIATIONS OF LUCAS’ THEOREM MODULO PRIME POWERS ROMEO MESTROVIˇ C´ Abstract. Let p be a prime, and let k,n,m,n0 and m0 be nonnegative integers such that k ≥ 1, and 0 and m0 are both less than p. K. Davis and W. Webb established that for a prime p ≥ 5 the following variation of Lucas’ Theorem modulo prime powers holds k ⌊(k−1)/3⌋ np + n0 np n0 k k ≡ ⌊(k−1)/3⌋ (mod p ). mp + m0 mp m0 In the proof the authors used their earlier result that present a general- ized version of Lucas’ Theorem. In this paper we present a a simple inductive proof of the above con- gruence. Our proof is based on a classical congruence due to Jacobsthal, and we additionally use only some well known identities for binomial coefficients. Moreover, we prove that the assertion is also true for p =2 and p = 3 if in the above congruence one replace ⌊(k − 1)/3⌋ by ⌊k/2⌋, and by ⌊(k − 1)/2⌋, respectively. As an application, in terms of Lucas’ type congruences, we obtain a new characterization of Wolstenholme primes. 1. INTRODUCTION AND MAIN RESULTS In 1878, E.´ Lucas proved a remarkable result which provides a simple a way to compute the binomial coefficient b modulo a prime p in terms of the binomial coefficients of the base-p digits of nonnegative integers a and b with b ≤ a. Namely, if p is a prime, and n, m, n0 and m0 are nonnegative integers with n0, m0 ≤ p − 1, then a beautiful theorem of Lucas ([11]; also see [6]) states that for every prime p, arXiv:1301.0252v1 [math.NT] 29 Dec 2012 np + n n n 0 ≡ 0 (mod p) (1) mp + m0 mm0 1991 Mathematics Subject Classification.
  • An Identity for Generalized Bernoulli Polynomials

    An Identity for Generalized Bernoulli Polynomials

    1 2 Journal of Integer Sequences, Vol. 23 (2020), 3 Article 20.11.2 47 6 23 11 An Identity for Generalized Bernoulli Polynomials Redha Chellal1 and Farid Bencherif LA3C, Faculty of Mathematics USTHB Algiers Algeria [email protected] [email protected] [email protected] Mohamed Mehbali Centre for Research Informed Teaching London South Bank University London United Kingdom [email protected] Abstract Recognizing the great importance of Bernoulli numbers and Bernoulli polynomials in various branches of mathematics, the present paper develops two results dealing with these objects. The first one proposes an identity for the generalized Bernoulli poly- nomials, which leads to further generalizations for several relations involving classical Bernoulli numbers and Bernoulli polynomials. In particular, it generalizes a recent identity suggested by Gessel. The second result allows the deduction of similar identi- ties for Fibonacci, Lucas, and Chebyshev polynomials, as well as for generalized Euler polynomials, Genocchi polynomials, and generalized numbers of Stirling. 1Corresponding author. 1 1 Introduction Let N and C denote, respectively, the set of positive integers and the set of complex numbers. (α) In his book, Roman [41, p. 93] defined generalized Bernoulli polynomials Bn (x) as follows: for all n ∈ N and α ∈ C, we have ∞ tn t α B(α)(x) = etx. (1) n n! et − 1 Xn=0 The Bernoulli numbers Bn, classical Bernoulli polynomials Bn(x), and generalized Bernoulli (α) numbers Bn are, respectively, defined by (1) (α) (α) Bn = Bn(0), Bn(x)= Bn (x), and Bn = Bn (0). (2) The Bernoulli numbers and the Bernoulli polynomials play a fundamental role in various branches of mathematics, such as combinatorics, number theory, mathematical analysis, and topology.
  • Solving Solvable Quintics

    Solving Solvable Quintics

    mathematics of computation volume 57,number 195 july 1991, pages 387-401 SOLVINGSOLVABLE QUINTICS D. S. DUMMIT Abstract. Let f{x) = x 5 +px 3 +qx 2 +rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if and only if f(x) is solvable by radicals (i.e., when its Galois group is contained in the Frobenius group F20 of order 20 in the symmetric group S5). When f(x) is solvable by radicals, formulas for the roots are given in terms of p, q, r, s which produce the roots in a cyclic order. 1. Introduction It is well known that an irreducible quintic with coefficients in the rational numbers Q is solvable by radicals if and only if its Galois group is contained in the Frobenius group F20 of order 20, i.e., if and only if the Galois group is isomorphic to F20 , to the dihedral group DXQof order 10, or to the cyclic group Z/5Z. (More generally, for any prime p, it is easy to see that a solvable subgroup of the symmetric group S whose order is divisible by p is contained in the normalizer of a Sylow p-subgroup of S , cf. [1].) The purpose here is to give a criterion for the solvability of such a general quintic in terms of the existence of a rational root of an explicit associated resolvent sextic polynomial, and when this is the case, to give formulas for the roots analogous to Cardano's formulas for the general cubic and quartic polynomials (cf.
  • Casus Irreducibilis and Maple

    Casus Irreducibilis and Maple

    48 Casus irreducibilis and Maple Rudolf V´yborn´y Abstract We give a proof that there is no formula which uses only addition, multiplication and extraction of real roots on the coefficients of an irreducible cubic equation with three real roots that would provide a solution. 1 Introduction The Cardano formulae for the roots of a cubic equation with real coefficients and three real roots give the solution in a rather complicated form involving complex numbers. Any effort to simplify it is doomed to failure; trying to get rid of complex numbers leads back to the original equation. For this reason, this case of a cubic is called casus irreducibilis: the irreducible case. The usual proof uses the Galois theory [3]. Here we give a fairly simple proof which perhaps is not quite elementary but should be accessible to undergraduates. It is well known that a convenient solution for a cubic with real roots is in terms of trigono- metric functions. In the last section we handle the irreducible case in Maple and obtain the trigonometric solution. 2 Prerequisites By N, Q, R and C we denote the natural numbers, the rationals, the reals and the com- plex numbers, respectively. If F is a field then F [X] denotes the ring of polynomials with coefficients in F . If F ⊂ C is a field, a ∈ C but a∈ / F then there exists a smallest field of complex numbers which contains both F and a, we denote it by F (a). Obviously it is the intersection of all fields which contain F as well as a.
  • Sums of Powers and the Bernoulli Numbers Laura Elizabeth S

    Sums of Powers and the Bernoulli Numbers Laura Elizabeth S

    Eastern Illinois University The Keep Masters Theses Student Theses & Publications 1996 Sums of Powers and the Bernoulli Numbers Laura Elizabeth S. Coen Eastern Illinois University This research is a product of the graduate program in Mathematics and Computer Science at Eastern Illinois University. Find out more about the program. Recommended Citation Coen, Laura Elizabeth S., "Sums of Powers and the Bernoulli Numbers" (1996). Masters Theses. 1896. https://thekeep.eiu.edu/theses/1896 This is brought to you for free and open access by the Student Theses & Publications at The Keep. It has been accepted for inclusion in Masters Theses by an authorized administrator of The Keep. For more information, please contact [email protected]. THESIS REPRODUCTION CERTIFICATE TO: Graduate Degree Candidates (who have written formal theses) SUBJECT: Permission to Reproduce Theses The University Library is rece1v1ng a number of requests from other institutions asking permission to reproduce dissertations for inclusion in their library holdings. Although no copyright laws are involved, we feel that professional courtesy demands that permission be obtained from the author before we allow theses to be copied. PLEASE SIGN ONE OF THE FOLLOWING STATEMENTS: Booth Library of Eastern Illinois University has my permission to lend my thesis to a reputable college or university for the purpose of copying it for inclusion in that institution's library or research holdings. u Author uate I respectfully request Booth Library of Eastern Illinois University not allow my thesis
  • Higher Order Bernoulli and Euler Numbers

    Higher Order Bernoulli and Euler Numbers

    David Vella, Skidmore College [email protected] Generating Functions and Exponential Generating Functions • Given a sequence {푎푛} we can associate to it two functions determined by power series: • Its (ordinary) generating function is ∞ 풏 푓 풙 = 풂풏풙 풏=ퟏ • Its exponential generating function is ∞ 풂 품 풙 = 풏 풙풏 풏! 풏=ퟏ Examples • The o.g.f and the e.g.f of {1,1,1,1,...} are: 1 • f(x) = 1 + 푥 + 푥2 + 푥3 + ⋯ = , and 1−푥 푥 푥2 푥3 • g(x) = 1 + + + + ⋯ = 푒푥, respectively. 1! 2! 3! The second one explains the name... Operations on the functions correspond to manipulations on the sequence. For example, adding two sequences corresponds to adding the ogf’s, while to shift the index of a sequence, we multiply the ogf by x, or differentiate the egf. Thus, the functions provide a convenient way of studying the sequences. Here are a few more famous examples: Bernoulli & Euler Numbers • The Bernoulli Numbers Bn are defined by the following egf: x Bn n x x e 1 n1 n! • The Euler Numbers En are defined by the following egf: x 2e En n Sech(x) 2x x e 1 n0 n! Catalan and Bell Numbers • The Catalan Numbers Cn are known to have the ogf: ∞ 푛 1 − 1 − 4푥 2 퐶 푥 = 퐶푛푥 = = 2푥 1 + 1 − 4푥 푛=1 • Let Sn denote the number of different ways of partitioning a set with n elements into nonempty subsets. It is called a Bell number. It is known to have the egf: ∞ 푆 푥 푛 푥푛 = 푒 푒 −1 푛! 푛=1 Higher Order Bernoulli and Euler Numbers th w • The n Bernoulli Number of order w, B n is defined for positive integer w by: w x B w n xn x e 1 n1 n! th w • The n Euler Number of
  • Handbook of Number Theory Ii

    Handbook of Number Theory Ii

    HANDBOOK OF NUMBER THEORY II by J. Sändor Babes-Bolyai University ofCluj Department of Mathematics and Computer Science Cluj-Napoca, Romania and B. Crstici formerly the Technical University of Timisoara Timisoara Romania KLUWER ACADEMIC PUBLISHERS DORDRECHT / BOSTON / LONDON Contents PREFACE 7 BASIC SYMBOLS 9 BASIC NOTATIONS 10 1 PERFECT NUMBERS: OLD AND NEW ISSUES; PERSPECTIVES 15 1.1 Introduction 15 1.2 Some historical facts 16 1.3 Even perfect numbers 20 1.4 Odd perfect numbers 23 1.5 Perfect, multiperfect and multiply perfect numbers 32 1.6 Quasiperfect, almost perfect, and pseudoperfect numbers 36 1.7 Superperfect and related numbers 38 1.8 Pseudoperfect, weird and harmonic numbers 42 1.9 Unitary, bi-unitary, infinitary-perfect and related numbers 45 1.10 Hyperperfect, exponentially perfect, integer-perfect and y-perfect numbers 50 1.11 Multiplicatively perfect numbers 55 1.12 Practical numbers 58 1.13 Amicable numbers 60 1.14 Sociable numbers 72 References 77 2 GENERALIZATIONS AND EXTENSIONS OF THE MÖBIUS FUNCTION 99 2.1 Introduction 99 1 CONTENTS 2.2 Möbius functions generated by arithmetical products (or convolutions) 106 1 Möbius functions defined by Dirichlet products 106 2 Unitary Möbius functions 110 3 Bi-unitary Möbius function 111 4 Möbius functions generated by regulär convolutions .... 112 5 K-convolutions and Möbius functions. B convolution . ... 114 6 Exponential Möbius functions 117 7 l.c.m.-product (von Sterneck-Lehmer) 119 8 Golomb-Guerin convolution and Möbius function 121 9 max-product (Lehmer-Buschman) 122 10 Infinitary
  • Mathematical Constants and Sequences

    Mathematical Constants and Sequences

    Mathematical Constants and Sequences a selection compiled by Stanislav Sýkora, Extra Byte, Castano Primo, Italy. Stan's Library, ISSN 2421-1230, Vol.II. First release March 31, 2008. Permalink via DOI: 10.3247/SL2Math08.001 This page is dedicated to my late math teacher Jaroslav Bayer who, back in 1955-8, kindled my passion for Mathematics. Math BOOKS | SI Units | SI Dimensions PHYSICS Constants (on a separate page) Mathematics LINKS | Stan's Library | Stan's HUB This is a constant-at-a-glance list. You can also download a PDF version for off-line use. But keep coming back, the list is growing! When a value is followed by #t, it should be a proven transcendental number (but I only did my best to find out, which need not suffice). Bold dots after a value are a link to the ••• OEIS ••• database. This website does not use any cookies, nor does it collect any information about its visitors (not even anonymous statistics). However, we decline any legal liability for typos, editing errors, and for the content of linked-to external web pages. Basic math constants Binary sequences Constants of number-theory functions More constants useful in Sciences Derived from the basic ones Combinatorial numbers, including Riemann zeta ζ(s) Planck's radiation law ... from 0 and 1 Binomial coefficients Dirichlet eta η(s) Functions sinc(z) and hsinc(z) ... from i Lah numbers Dedekind eta η(τ) Functions sinc(n,x) ... from 1 and i Stirling numbers Constants related to functions in C Ideal gas statistics ... from π Enumerations on sets Exponential exp Peak functions (spectral) ..
  • MASON V(Irtual) Mid-Atlantic Seminar on Numbers March 27–28, 2021

    MASON V(Irtual) Mid-Atlantic Seminar on Numbers March 27–28, 2021

    MASON V(irtual) Mid-Atlantic Seminar On Numbers March 27{28, 2021 Abstracts Amod Agashe, Florida State University A generalization of Kronecker's first limit formula with application to zeta functions of number fields The classical Kronecker's first limit formula gives the polar and constant term in the Laurent expansion of a certain two variable Eisenstein series, which in turn gives the polar and constant term in the Laurent expansion of the zeta function of a quadratic imaginary field. We will recall this formula and give its generalization to more general Eisenstein series and to zeta functions of arbitrary number fields. Max Alekseyev, George Washington University Enumeration of Payphone Permutations People's desire for privacy drives many aspects of their social behavior. One such aspect can be seen at rows of payphones, where people often pick an available payphone most distant from already occupied ones.Assuming that there are n payphones in a row and that n people pick payphones one after another as privately as possible, the resulting assignment of people to payphones defines a permutation, which we will refer to as a payphone permutation. It can be easily seen that not every permutation can be obtained this way. In the present study, we consider different variations of payphone permutations and enumerate them. Kisan Bhoi, Sambalpur University Narayana numbers as sum of two repdigits Repdigits are natural numbers formed by the repetition of a single digit. Diophantine equations involving repdigits and the terms of linear recurrence sequences have been well studied in literature. In this talk we consider Narayana's cows sequence which is a third order liner recurrence sequence originated from a herd of cows and calves problem.
  • A Short History of Complex Numbers

    A Short History of Complex Numbers

    A Short History of Complex Numbers Orlando Merino University of Rhode Island January, 2006 Abstract This is a compilation of historical information from various sources, about the number i = √ 1. The information has been put together for students of Complex Analysis who − are curious about the origins of the subject, since most books on Complex Variables have no historical information (one exception is Visual Complex Analysis, by T. Needham). A fact that is surprising to many (at least to me!) is that complex numbers arose from the need to solve cubic equations, and not (as it is commonly believed) quadratic equations. These notes track the development of complex numbers in history, and give evidence that supports the above statement. 1. Al-Khwarizmi (780-850) in his Algebra has solution to quadratic equations of various types. Solutions agree with is learned today at school, restricted to positive solutions [9] Proofs are geometric based. Sources seem to be greek and hindu mathematics. According to G. J. Toomer, quoted by Van der Waerden, Under the caliph al-Ma’mun (reigned 813-833) al-Khwarizmi became a member of the “House of Wisdom” (Dar al-Hikma), a kind of academy of scientists set up at Baghdad, probably by Caliph Harun al-Rashid, but owing its preeminence to the interest of al-Ma’mun, a great patron of learning and scientific investigation. It was for al-Ma’mun that Al-Khwarizmi composed his astronomical treatise, and his Algebra also is dedicated to that ruler 2. The methods of algebra known to the arabs were introduced in Italy by the Latin transla- tion of the algebra of al-Khwarizmi by Gerard of Cremona (1114-1187), and by the work of Leonardo da Pisa (Fibonacci)(1170-1250).
  • ON the CASUS IRREDUCIBILIS of SOLVING the CUBIC EQUATION Jay Villanueva Florida Memorial University Miami, FL 33055 Jvillanu@Fmu

    ON the CASUS IRREDUCIBILIS of SOLVING the CUBIC EQUATION Jay Villanueva Florida Memorial University Miami, FL 33055 Jvillanu@Fmu

    ON THE CASUS IRREDUCIBILIS OF SOLVING THE CUBIC EQUATION Jay Villanueva Florida Memorial University Miami, FL 33055 [email protected] I. Introduction II. Cardan’s formulas A. 1 real, 2 complex roots B. Multiple roots C. 3 real roots – the casus irreducibilis III. Examples IV. Significance V. Conclusion ******* I. Introduction We often need to solve equations as teachers and researchers in mathematics. The linear and quadratic equations are easy. There are formulas for the cubic and quartic equations, though less familiar. There are no general methods to solve the quintic and other higher order equations. When we deal with the cubic equation one surprising result is that often we have to express the roots of the equation in terms of complex numbers although the roots are real. For example, the equation – 4 = 0 has all roots real, yet when we use the formula we get . This root is really 4, for, as Bombelli noted in 1550, and , and therefore This is one example of the casus irreducibilis on solving the cubic equation with three real roots. 205 II. Cardan’s formulas The quadratic equation with real coefficients, has the solutions (1) . The discriminant < 0, two complex roots (2) ∆ real double root > 0, two real roots. The (monic) cubic equation can be reduced by the transformation to the form where (3) Using the abbreviations (4) and , we get Cardans’ formulas (1545): (5) The complete solutions of the cubic are: (6) The roots are characterized by the discriminant (7) < 0, one real, two complex roots = 0, multiple roots > 0, three real roots.