DOCSLIB.ORG

Sophisticated Limits with Focus on Mathematical Olympiad Problems by Tetyana Darian a Thesis Submitted to The

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sophisticated Limits with Focus on Mathematical Olympiad Problems by Tetyana Darian a Thesis Submitted to The sophisticated limits with focus on mathematical olympiad problems By tetyana darian A thesis submitted to the Graduate School-Camden Rutgers, The State University of New Jersey In partial fulfillment of the requirements For the degree of Master of Science Graduate Program in Pure Mathematics Written under the direction of Gabor Toth And approved by Gabor Toth Camden, New Jersey October 2019 thesis abstract Sophisticated Limits with Focus on Mathematical Olympiad Problems by tetyana darian Thesis Director: Gabor Toth The purpose of this thesis is to derive a variety of sophisticated limits, some in Mathematical Olympiad Problems, without using mathematically advanced concepts. In fact, this thesis requires only basic calculus and the Stolz-Ces`arotheorems. The latter will be presented without proofs but with all the necessary ingredients and formulas needed in this work. The thesis is written for a mathematically mature student with a certain level of preparation to tackle these beautiful limits. ii Acknowledgements I would like to thank my thesis advisor, Professor Gabor Toth, for his thoughtful guidance, support, and intuition. I truly appreciate and have enjoyed all of our meetings, discussions, and classroom time together. Thank you for introducing me to the beautiful and complex world of mathematics and mathematical research. A separate thank you and appreciation goes to my husband, Steven, who supported me through thick and thin during my mathematical journey. iii Contents Thesis Abstract ii Acknowledgements iii 1 Introduction 1 1.1 Completeness of the Real Numbers . 1 1.2 Neighborhoods and Limit Points . 2 1.3 The Limit of a Sequence . 2 2 Stolz-Ces`aroTheorems and the Stirling Formula 4 2.1 The Stolz-Ces`aroTheorem . 4 2.2 The Stolz-Ces`aroTheorem . 5 2.3 The Stirling Formula . 7 3 Examples of Sophisticated Limits 8 3.1 Preliminaries . 8 3.2 Example 1 . 9 3.3 Example 2 . 13 3.4 Example 3 . 17 3.5 Example 4 . 20 3.6 Example 5 . 21 3.7 Example 6 . 23 Bibliography 25 iv 1 Chapter 1 Introduction This chapter is a brief look at what this thesis is all about. To aid us in our discussion, we will be including some definitions and results which will be stated without proof. Important: All definitions, propositions, and theorems presented in this chapter will be reintroduced, and elaborated upon throughout the course of the thesis. The results of this chapter will be used without any explicit references. To further emphasize this, we will not number the definitions, propositions, and theorems of this chapter. 1.1 Completeness of the Real Numbers Definition. A nonempty set S of real numbers is said to be bounded above if there exists some real number M such that x ≤ M for every x in S. In this case M is said to be an upper bound for S. Likewise, S is said to be bounded below if there exists some number m such that m ≤ x for all x in S; m is called a lower bound for S. We call S bounded if it is bounded both above and below. Definition. Let S be a nonempty set of real numbers that is bounded above. A supremum or least upper bound of S, denoted sup S, is a real number µ such that 2 1. x ≤ µ, for all x in S; 2. If M is an upper bound for S, then µ ≤ M. Definition. Let S be a nonempty set of real numbers that is bounded below. An infimum or greatest lower bound of S, denoted inf S, is a real number ν such that 1. ν ≤ x, for all x in S; 2. If m is any lower bound for S, then ν ≥ m. Axiom (The Completeness Axiom for R). If S is a nonempty set of real numbers that is bounded above, then sup S exists in R. 1.2 Neighborhoods and Limit Points Definition. Let x be any real number. The neighborhood of x with positive radius r is the set N(x; r) = fy in R : jy − xj < rg Definition. A deleted neighborhood of x in R, denoted N 0(x; r), is the neighborhood N(x; r) with the point x itself removed. Definition. Given a nonempty set S in R, a point x in R is said to be a limit point of S if, for each " > 0, the deleted neighborhood N(x; ") contains at least one point of S. Theorem (Bolzano-Weierstrass Theorem). If S is a bounded, infinite subset of R, then S has a limit point in R. 1.3 The Limit of a Sequence Definition. The point c is a cluster point of the sequence fxkg if, for every " > 0 and every k in N, there is a k1 > k such that xk1 is in N(c; "). 3 Definition. The sequence fxkg converges to x0 and we say x0 is the limit of fxkg if, for each neighborhood N(x0; "), there exists an index k0 such that, whenever k > k0, xk is in N(x0; "). We write limk!1 xk = x0. If a sequence fxkg fails to converge, for whatever reason, then we say that the sequence diverges. Theorem. The limit of a convergent sequence in R is unique. Theorem. A convergent sequence is bounded. Theorem. If a sequence is unbounded, then it must diverge. Theorem. A bounded, monotonic sequence of real numbers converges. Definition. Let fxkg be any sequence. Choose any strictly monotonic increasing sequence k1 < k2 < k3 < ::: of natural numbers. For each j in N, let yj = xkj . The sequence fyjg = fxkj g is called a subsequence of fxkg. Theorem. The point c is a cluster point of fxkg if and only if there exists a subsequence xkj that converges to c. Theorem. Any bounded sequence has a cluster point. Theorem. A sequence xkj converges to x0 if and only if every subsequence of xkj converges to x0. Theorem. A bounded sequence converges if and only if it has exactly one cluster point. 4 Chapter 2 Stolz-Ces`aroTheorems and the Stirling Formula In this chapter, we discuss powerful criteria for convergence of sequences, all due to Otto Stolz and Ernesto Ces`aro. 2.1 The Stolz-Ces`aroTheorem Let (a ) and (b ) be real sequences such that (b ) is strictly increasing n n2N0 n n2N0 n n2N0 with limn!1 bn = 1. Then, we have a − a a a a − a lim inf n n−1 ≤ lim inf n ≤ lim sup n ≤ lim sup n n−1 : n!1 bn − bn−1 n!1 bn n!1 bn n!1 bn − bn−1 In particular a − a a lim n n−1 = lim n ; n!1 bn − bn−1 n!1 bn provided that the limit on the left-hand side exists. 5 2.2 The Stolz-Ces`aroTheorem (Equivalent Formulation) Let (a ) and (b ) be real sequences such that b > 0; n 2 and n n2N0 n n2N0 n N0 limn!1 bn = 1. Then, we have a a + ··· + a a + ··· + a a lim inf n ≤ lim inf 1 n ≤ lim sup 1 n ≤ lim sup n : n!1 bn n!1 b1 + ··· + bn n!1 b1 + ··· + bn n!1 bn In particular a a + ··· + a lim n = lim 1 n ; n!1 bn n!1 b1 + ··· + bn provided that the limit on the left-hand side exists. Proof. This follows directly from the previous by the substitution an 7! a0 + ··· + an and bn 7! b0 + ··· + bn, n 2 N0. Letting bn = n; n 2 N, we obtain the following special cases valid for any real sequence (a ) : n n2N a1 + ··· + an a1 + ··· + an lim inf an ≤ lim inf ≤ lim sup ≤ lim sup an; n!1 n!1 n n!1 n n!1 and an an lim inf (an − an−1) ≤ lim inf ≤ lim sup ≤ lim sup (an − an−1) : n!1 n!1 n n!1 n n!1 In particular, a1 + ··· + an lim an = lim ; n!1 n!1 n and an lim (an − an−1) = lim ; n!1 n!1 n provided that the limits on the left-hand sides exist. 6 We call these the additive Stolz-Ces`aro formulas. Let (a ) be a real sequence with positive members. For n 2 , let b = log (a ), n n2N N n 2 n bn or equivalently, an = 2 . Applying the exponential identities, we obtain b1+···+bn p n 2 n = a1 : : : an: Using the monotonicity of the exponentiation, and the Stolz-Ces`arolimit formulas above for the sequence (b ) , we obtain n n2N p p n n lim inf an ≤ lim inf a1 : : : an ≤ lim sup a1 : : : an ≤ lim sup an; n!1 n!1 n!1 n!1 and a p p a n n n n lim inf ≤ lim inf an ≤ lim sup an ≤ lim inf : n!1 an−1 n!1 n!1 n!1 an−1 In particular p n lim an = lim a1 : : : an; n!1 n!1 and a p n n lim = lim an; an−1 n!1 provided that the limits on the left-hand sides exist. We call these the multiplicative Stolz-Ces`aro formulas. 7 2.3 The Stirling Formula An alternative approach for deriving some of the limits that follow in Chapter 3 is to first derive the Stirling Formula. However, the Stirling Formula is much more involved, compared to the more elementary Stolz-Ces`aroformulas, and would require elaborate proofs that are not within the scope of this work. 8 Chapter 3 Examples of Sophisticated Limits 3.1 Preliminaries We begin with a preliminary example: n (1) lim p = e: n!1 n n! n Indeed, letting an = n!=n , n 2 N, we calculate n n an+1 (n + 1)! n n 1 1 lim = lim n+1 · = lim n = lim n = ; n!1 an n!1 (n + 1) n! n!1 (n + 1) n!1 (1 + 1=n) e where we use the Euler's limit relation.
Load more

Recommended publications
  • 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) ..
    [Show full text]
  • Survey of Math: Chapter 21: Consumer Finance Savings Page 1
    Survey of Math: Chapter 21: Consumer Finance Savings Page 1 Geometric Series Consider the following series: 1 + x + x2 + x3 + ··· + xn−1. We need to figure out a way to write this without the ···. Here’s how: s = 1 + x + x2 + x3 + ··· + xn−1 subtract xs = x + x2 + x3 + ··· + xn−1 + xn s − sx = 1 − 0 − 0 − 0 − · · · − 0 − xn s − sx = 1 − xn Now solve for s: 1 − xn xn − 1 s(1 − x) = 1 − xn ⇒ s = = . 1 − x x − 1 xn − 1 Therefore, a geometric series has the following sum: 1 + x + x2 + x3 + ··· + xn−1 = . x − 1 Exponential and Natural Logarithms As we have seen, some of our equations involve exponents. To effectively deal with exponents, we need to be able to work with exponentials and logarithms. The exponential and natural logarithm functions are inverse functions, and related by the following rules 1 m e = 1 + for m large m e = 2.71828 ... ln(eA) = A where A is a constant eln(A) = A If the base of the exponent is not e, we can use the following rule: ln(bA) = A ln(b) where A and b are constants ln(2A) = A ln(2) ln((1 + r)A) = A ln(1 + r) Note: • The natural logarithm acts on a number, so we read ln(2) as “The natural logarithm of 2”. • We would never write ln(2) = 2 ln, since this loses the fact that the natural logarithm must act on something. It is a functional evaluation, not a multiplication. • This is similar to trigonometric functions, like sin(π).
    [Show full text]
  • Calculating Logs Manually
    calculating logs manually File Name: calculating logs manually.pdf Size: 2113 KB Type: PDF, ePub, eBook Category: Book Uploaded: 3 May 2019, 12:21 PM Rating: 4.6/5 from 561 votes. Status: AVAILABLE Last checked: 10 Minutes ago! In order to read or download calculating logs manually ebook, you need to create a FREE account. Download Now! eBook includes PDF, ePub and Kindle version ✔ Register a free 1 month Trial Account. ✔ Download as many books as you like (Personal use) ✔ Cancel the membership at any time if not satisfied. ✔ Join Over 80000 Happy Readers Book Descriptions: We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with calculating logs manually . To get started finding calculating logs manually , you are right to find our website which has a comprehensive collection of manuals listed. Our library is the biggest of these that have literally hundreds of thousands of different products represented. Home | Contact | DMCA Book Descriptions: calculating logs manually And let’s start with the logarithm of 2. As a kid I always wanted to know how to calculate log 2 and nobody was able to tell me. Can we guess the logarithm of 19,683.Let’s follow the chain. We are looking for 1225, so to account for the difference let’s round 3.0876 up to 3.088. How to calculate log 11. Here is a way to do this. We can take the geometric mean of 10 and 12.
    [Show full text]
  • 1 Introduction
    1 Introduction Definition 1. A rational number is a number which can be expressed in the form a/b where a and b are integers with b > 0. Theorem 1. A real number α is a rational number if and only if it can be expressed as a repeating decimal, that is if and only if α = m.d1d2 . dkdk+1dk+2 . dk+r, where m = [α] if α ≥ 0 and m = −[|α|] if α < 0, where k and r are non-negative integers with r ≥ 1, and where the dj are digits. Proof. If α = m.d1d2 . dkdk+1dk+2 . dk+r, then (10k+r − 10k)α ∈ Z and it easily follows that α is rational. If α = a/b with a and b integers and b > 0, then α = m.d1d2 ... for some digits dj. If {x} denotes the fractional part of x, then j {10 |α|} = 0.dj+1dj+2 .... (1) On the other hand, {10j|α|} = {10ja/b} = u/b for some u ∈ {0, 1, . , b − 1}. Hence, by the pigeon-hole principle, there exist non-negative integers k and r with r ≥ 1 and {10k|α|} = {10k+r|α|}. From (1), we deduce that 0.dk+1dk+2 ··· = 0.dk+r+1dk+r+2 ... so that α = m.d1d2 . dkdk+1dk+2 . dk+r, and the result follows. Definition 2. A number is irrational if it is not rational. Theorem 2. A real number α which can be expressed as a non-repeating decimal is irrational. Proof 1. From the argument above, if α = m.d1d2 ..
    [Show full text]
  • Introducing Mathematica
    Introducing Mathematica John H. Lowenstein Preface This informal introduction to Mathematica®(a product of Wolfram Research, Inc.) is offered as a downloadable resource for users of the textbook Essentials of Hamiltonian Dynamics (Cambridge University Press, 2012). The aim is to familiarize the student with the core concepts and functions of Mathematica programming, so that he or she can very quickly become comfortable with computational methods in dealing with the illustrative examples and exercises in the textbook. The scope of Mathematica obviously greatly exceeds what can be covered in these few pages, and so it is highly recommended that the student take full advantage of the excellent documentation which is included with the software (accessible via the Help menu). 1. Getting started Mathematica conducts a dialogue with the user: you type in a mathematical expression, press Enter , and Mathemat- ica evaluates the expression according to rules which are either built-in or have been prescribed by you, displaying the result as output. The input/output alternation continues until you quit the session, with all steps recorded in the cells of your notebook. The simplest expressions involve ordinary numbers (e.g. 1, 2, 3, . , 1/2, 2/3, . , 3.14159), and the familiar operations and relations of arithmetic and logic. Elementary numerical operations: + (plus), - (minus), * (times), / (divided by), ^ (to the power) Elementary numerical relations: == (is equal to), != (is not equal to), < (is less than), > (is greater than), <= (is less than or equal to), >= (is greater than or equal to) Elementary logical relations: || (or), && (and), ! (not) For example, 2+2 evaluates to 4 , 1<2 evaluates to True , and !(2>1) evaluates to False .
    [Show full text]
  • ON the GENESIS of BBP FORMULAS 3 Where R0 and R1 Are Rational Numbers
    ON THE GENESIS OF BBP FORMULAS DANIEL BARSKY, VICENTE MUNOZ,˜ AND RICARDO PEREZ-MARCO´ Abstract. We present a general procedure to generate infinitely many BBP and BBP-like formu- las for the simplest transcendental numbers. This provides some insight and a better understanding into their nature. In particular, we can derive the main known BBP formulas for π. We can under- stand why many of these formulas are rearrangements of each other. We also understand better where some null BBP formulas representing 0 come from. We also explain what is the observed re- lation between some BBP formulas for log 2 and π, that are obtained by taking real and imaginary parts of a general complex BBP formula. Our methods are elementary, but motivated by transal- gebraic considerations, and offer a new way to obtain and to search many new BBP formulas and, conjecturally, to better understand transalgebraic relations between transcendental constants. 1. Introduction More than 20 years ago, D.H. Bailey, P. Bowein and S. Plouffe ([5]) presented an efficient algorithm to compute deep binary or hexadecimal digits of π without the need to compute the previous ones. Their algorithm is based on a series representation for π given by a formula discovered by S. Plouffe, +∞ 1 4 2 1 1 π = . (1) 16k 8k +1 − 8k +4 − 8k +5 − 8k +6 kX=0 Formulas of similar form for other transcendental constants were known from long time ago, like the classical formula for log 2, that was known to J. Bernoulli, +∞ 1 1 log 2 = . 2k k Xk=1 arXiv:1906.09629v3 [math.NT] 22 Jul 2020 The reader can find in [4] an illustration of the way to extract binary digits from this type of formulae.
    [Show full text]
  • Little Q-Legendre Polynomials and Irrationality of Certain Lambert Series
    Little q-Legendre polynomials and irrationality of certain Lambert series Walter Van Assche ∗ Katholieke Universiteit Leuven and Georgia Institute of Technology October 26, 2018 Abstract Certain q-analogs hp(1) of the harmonic series, with p = 1/q an integer greater than one, were shown to be irrational by Erd˝os [9]. In 1991–1992 Peter Borwein [4] [5] used Pad´eapproximation and complex analysis to prove the irrationality of these q-harmonic series and of q-analogs lnp(2) of the natural logarithm of 2. Recently Amdeberhan and Zeilberger [1] used the qEKHAD symbolic package to find q-WZ pairs that provide a proof of irrationality similar to Ap´ery’s proof of irrationality of ζ(2) and ζ(3). They also obtain an upper bound for the measure of irrationality, but better upper bounds were earlier given by Bundschuh and V¨a¨an¨anen [8] and recently also by Matala-aho and V¨a¨an¨anen [14] (for lnp(2)). In this paper we show how one can obtain rational approximants for hp(1) and lnp(2) (and many other similar quantities) by Pad´eapproximation using little q-Legendre polynomials and we show that properties of these orthogonal polynomials indeed prove the irrationality, with an upper bound of the measure of irrationality which is as sharp as the upper bound given by Bundschuh and V¨a¨an¨anen for hp(1) and a better upper bound as the one given by Matala-aho and V¨a¨an¨anen for lnp(2). 1 Introduction Most important special functions, in particular hypergeometric functions, have q-exten- arXiv:math/0101187v1 [math.CA] 23 Jan 2001 sions, usually obtained by replacing Pochhammer symbols (a)n = a(a +1) (a + n 1) by their q-analog (a; q) = (1 a)(1 aq)(1 aq2) (1 aqn−1).
    [Show full text]
  • Tombstone. the Tombstone of Ludolph Van Ceulen in Leiden, the Netherlands, Is Engraved with His Amazing 35-Digit Approximation to Pi
    Tombstone. The tombstone of Ludolph van Ceulen in Leiden, the Netherlands, is engraved with his amazing 35-digit approximation to pi. Notice that, in keeping with the tradition started by Archimedes, the upper and lower limits are given as fractions rather than decimals. (Photo courtesy of Karen Aardal. c Karen Aardal. All rights reserved.) 28 What’s Happening in the Mathematical Sciences Digits of Pi BarryCipra he number π—the ratio of any circle’s circumference to its diameter, or, if you like, the ratio of its area to In 2002, Yasumasa Tthe square of its radius—has fascinated mathematicians Kanada and a team of for millennia. Its decimal expansion, 3.14159265 ..., has been computer scientists at studied for hundreds of years. More recently its binary expan- the University of Tokyo sion, 11.001001 ..., has come under scrutiny. Over the last decade, number theorists have discovered some surprising computed a record new algorithms for computing digits of pi, together with new 1.2411 trillion decimal theorems regarding the apparent randomness of those digits. digits of π,breaking In 2002, Yasumasa Kanada and a team of computer scien- tists at the University of Tokyo computed a record 1.2411 tril- their own previous lion decimal digits of π, breaking their own previous record record of 206 billion of 206 billion digits, set in 1999. The calculation was a shake- digits, set in 1999. down cruise of sorts for a new supercomputer. That’s one of the main reasons for undertaking such massive computations: Calculating π to high accuracy requires a range of numerical methods, such as the fast Fourier transform, that test a com- puter’s ability to store, retrieve, and manipulate large amounts of data.
    [Show full text]
  • This Is a Collection of Mathematical Constants Evaluated to Many Digits
    This is a collection of mathematical constants evaluated to many digits. by Simon Plouffe 1995. ----------------------------------------------------------------------------- Contents -------- 1-6/(Pi^2) to 5000 digits. 1/log(2) the inverse of the natural logarithm of 2 to 2000 places. 1/sqrt(2*Pi) to 1024 digits. sum(1/2^(2^n),n=0..infinity). to 1024 digits. 3/(Pi*Pi) to 2000 digits. arctan(1/2) to 1000 digits. The Artin's Constant = product(1-1/(p**2-p),p=prime) The Backhouse constant The Berstein Constant The Catalan Constant The Champernowne Constant Copeland-Erdos constant cos(1) to 15000 digits. The cube root of 3 to 2000 places. 2**(1/3) to 2000 places Zeta(1,2) ot the derivative of Zeta function at 2. The Dubois-Raymond constant exp(1/e) to 2000 places. Gompertz (1825) constant exp(2) to 5000 digits. exp(E) to 2000 places. exp(-1)**exp(-1) to 2000 digits. The exp(gamma) to 1024 places. exp(-exp(1)) to 1024 digits. exp(-gamma) to 500 digits. exp(-1) = exp(Pi) to 5000 digits. exp(-Pi/2) also i**i to 2000 digits. exp(Pi/4) to 2000 digits. exp(Pi)-Pi to 2000 digits. exp(Pi)/Pi**E to 1100 places. Feigenbaum reduction parameter Feigenbaum bifurcation velocity constant Fransen-Robinson constant. gamma or Euler constant GAMMA(1/3) to 256 digits. GAMMA(1/4) to 512 digits. The Euler constant squared to 2000 digits. GAMMA(2/3) to 256 places gamma cubed. to 1024 digits. GAMMA(3/4) to 256 places. gamma**(exp(1) to 1024 digits.
    [Show full text]
  • Dataflow Blocks Reference
    2020/05/09 15:05 1/8 Dataflow Blocks Reference Dataflow Blocks Reference Various blocks are available for creating your dataflow model. When you open the dataflow view, the blocks palette appears at the left of the dataflow window and contains blocks available to your dataflow model. Variables These blocks hold values. Block Icon Description String Holds values as a sequence of characters Number Holds values that describe a measurable quantity as a number Boolean Holds values that can be only TRUE or FALSE Holds values that describe a solid, gradient, or image fill that can be set with a DGLux5 fill Color pop-up. Table Holds values as a set of records Data Services Data Services blocks. Block Icon Description List Node Returns metadata about a node and its children Returns the default parameters and parameter values associated with a Get Default Parameters data action. Accesses a URL, and either returns the string located in that file or String Loader performs other actions based on HTTP request methods String Uploader Saves a string as a new file in this project List Files Returns a table that lists the contents of a project directory Get Children Returns a table that lists the children of a data node Get Node Returns metadata about a data node Returns information about the current user's session and the current Project Info project Converts a full file path to a relative file path, and manages changes to Relativize the non-relativized part of the path Retrieves a table of information about the value histories of multiple Multi-Histories data nodes DGLogik - http://wiki.dglogik.com/ 2020/05/09 15:05 2/8 Dataflow Blocks Reference Block Icon Description Adds, into the specified folder, all of the files from a ZIP file that is Zip Upload specified as binary Returns, as binary, a ZIP file that combines the files at the specified Zip Download paths Takes a ZIP file as input and returns a table that contains the ZIP file’s Zip Parser contents.
    [Show full text]
  • On the Genesis of BBP Formulas Daniel Barsky, Vicente Muñoz, Ricardo Pérez-Marco
    On the genesis of BBP formulas Daniel Barsky, Vicente Muñoz, Ricardo Pérez-Marco To cite this version: Daniel Barsky, Vicente Muñoz, Ricardo Pérez-Marco. On the genesis of BBP formulas. Acta Arith- metica, Instytut Matematyczny PAN, In press. hal-02164612 HAL Id: hal-02164612 https://hal.archives-ouvertes.fr/hal-02164612 Submitted on 25 Jun 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. ON THE GENESIS OF BBP FORMULAS DANIEL BARSKY, VICENTE MUNOZ,~ AND RICARDO PEREZ-MARCO´ Abstract. We present a general procedure to generate infinitely many BBP and BBP-like formu- las for the simplest transcendental numbers. This provides some insight and a better understanding into their nature. In particular, we can derive the main known BBP formulas for π. We can under- stand why many of these formulas are rearrangements of each other. We also understand better where some null BBP formulas representing 0 come from. We also explain what is the observed re- lation between some BBP formulas for log 2 and π, that are obtained by taking real and imaginary parts of a general complex BBP formula. Our methods are elementary, but motivated by transal- gebraic considerations, and offer a new way to obtain and to search many new BBP formulas and, conjecturally, to better understand transalgebraic relations between transcendental constants.
    [Show full text]
  • Riemannhypothesis
    Numbers are three dimensional, as nature Surajit Ghosh, Kolkata, India 30th June, 2019 Abstract Riemann hypothesis stands proved in three different ways.To prove Riemann hypothesis from the functional equation concept of Delta function is introduced similar to Gamma and Pi function. Other two proofs are derived using Eulers formula and elementary algebra. Analytically continuing gamma and zeta function to an extended domain, poles and zeros of zeta values are redefined. Keywords| Primes, zeta function, gamma function, analytic continuation of zeta function, Riemann hypothesis iemannHypothesis R ! s (s−1) πs ζ(s) = 2 π sin 2 Γ(1 − s)ζ(1 − s) 2 Contents 9 Proof of other unsolved problems 22 9.1 Legendre's prime conjecture..... 22 1 Introduction4 9.2 Sophie Germain prime conjecture.. 22 1.1 Euler the grandfather of zeta function4 9.3 Landau's prime conjecture...... 23 1.2 Riemann the father of zeta function.4 9.4 Brocard's prime conjecture...... 23 9.5 Opperman's prime conjecture.... 24 2 Proof of Riemann Hypothesis5 9.6 Collatz conjecture........... 25 2.1 An exhaustive proof using Riemanns functional equation..........5 10 Complex logarithm simplified 25 2.1.1 Introduction of Delta function6 10.1 Difficulties faced in present concept of 2.1.2 Alternate functional equation8 Complex logarithm.......... 25 2.2 An elegant proof using Eulers original 10.2 Eulers formula, the unit circle, the unit product form.............9 sphere................. 25 2.3 An elementary proof using alternate 10.3 Introduction of Quaternions for closure product form............. 11 of logarithmic operation....... 26 10.4 Properties of Real and simple (RS) 3 Infinite product of zeta values 12 Logarithm..............
    [Show full text]