1 Walking on real numbers David H Bailey, Lawrence Berkeley National Lab, USA Collaborators: Francisco J. Aragon Artacho (Univ. of Newcastle, Australia),

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Mathematical Induction
22C:19 Discrete Structures Induction and Recursion Fall 2014 Sukumar Ghosh.
What is the Prime Number Theorem? The Prime Number Theorem gives an asymptotic answer to the question “How many primes are there less than n (where n is.
Prime Numbers: A Recent Discovery, Secure Communications, and Million Dollar Prizes George T. Gilbert TCU January 29, 2003.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Induction and Recursion. Odd Powers Are Odd Fact: If m is odd and n is odd, then nm is odd. Proposition: for an odd number m, m k is odd for all non-negative.
INFINITE SEQUENCES AND SERIES
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
MCGILL UNIVERSITY SEPTEMBER 21, 2007 COPYRIGHT © 2007 MICHAEL I. SHAMOS Surprises in Experimental Mathematics Michael I. Shamos School of Computer Science.
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
Induction and recursion
Rational and Real Numbers The Rational Numbers are a field Rational Numbers are an integral domain, since all fields are integral domains What other properties.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Real Numbers and Their Properties รายวิชา ค ความรู้พื้นฐานสำหรับแคลคูลัส 1 ภาคเรียนที่ 1 ปีการศึกษา 2552.
Lecture for Week Spring.  Numbers can be represented in many ways. We are familiar with the decimal system since it is most widely used in everyday.
Mathematical Maxims and Minims, 1988
Chapter 6 Mathematical Induction
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
MATH 224 – Discrete Mathematics
Math Review Data Structures & File Management Computer Science Dept Va Tech July 2000 ©2000 McQuain WD 1 Summation Formulas Let N > 0, let A, B, and C.
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
The DYNAMICS & GEOMETRY of MULTIRESOLUTION METHODS Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science Drive 2 Singapore.
Round-off Errors and Computer Arithmetic. The arithmetic performed by a calculator or computer is different from the arithmetic in algebra and calculus.
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
Mathematical Induction
In section 11.9, we were able to find power series representations for a certain restricted class of functions. Here, we investigate more general problems.
MATERI I FUNGSI. Preliminaries REAL NUMBERS A real number may be either rational or irrational; either algebraic or transcendental; and either positive,
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CS1Q Computer Systems Lecture 2 Simon Gay. Lecture 2CS1Q Computer Systems - Simon Gay2 Binary Numbers We’ll look at some details of the representation.
1 Probability and Statistical Inference (9th Edition) Chapter 5 (Part 2/2) Distributions of Functions of Random Variables November 25, 2015.
Lab for Remote Sensing Hydrology and Spatial Modeling Dept of Bioenvironmental Systems Engineering National Taiwan University 1/45 GEOSTATISTICS INTRODUCTION.
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
Section 3.2: Sequences and Summations. Def: A sequence is a function from a subset of the set of integers (usually the set of natural numbers) to a set.
Fundamental Theorems in Mathematics
The Acceptance Problem for TMs
Physics 114: Lecture 13 Probability Tests & Linear Fitting
Francisco Antonio Doria
Standard Representations of Regular Languages
CSE322 PUMPING LEMMA FOR REGULAR SETS AND ITS APPLICATIONS
Handbook of Applied Cryptography - CH4, from 4.1~4.3
X Transcendental. X Transcendental Algebraic numbers are solutions of algebraic equations p(x) = a0 + a1x1 + a2x anxn = 0 with integer coefficients.
Rational and Irrational
Trigonometric Identities
CSCI206 - Computer Organization & Programming
Sum-product theorems over finite fields
Class Notes 9: Power Series (1/3)
Chapter 8: Further Topics in Algebra
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
1.1 Real Numbers.
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Discrete Mathematics and its Applications
STOCHASTIC HYDROLOGY Random Processes
Sampling Distributions
5.1 Power Series Method Section 5.1 p1.
Copyright © Cengage Learning. All rights reserved.
13. The Weak Law and the Strong Law of Large Numbers
Chapter 11: Further Topics in Algebra
9.2 Arithmetic Sequences and Series
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Quantitative Reasoning
Finding Limits Graphically and Numerically
Chapter 11: Further Topics in Algebra
Copyright © Cengage Learning. All rights reserved.
Foundations of Discrete Mathematics
Copyright © Cengage Learning. All rights reserved.
1 Newton’s Method.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
13. The Weak Law and the Strong Law of Large Numbers
Presentation transcript:

1 Walking on real numbers David H Bailey, Lawrence Berkeley National Lab, USA Collaborators: Francisco J. Aragon Artacho (Univ. of Newcastle, Australia), Jonathan M. Borwein (Univ. of Newcastle, Australia) and Peter B. Borwein (Simon Fraser Univ., Canada) This talk is available at:

2 Normal numbers Given an integer b > 1, a real number x is b-normal (or “normal base b”) if every m-long string of digits in the base-b expansion of x appears with precisely the expected limiting frequency b -m. Using measure theory, it is can be shown that almost all real numbers are b- normal for a given integer base b. In fact, almost all reals are b-normal for all integer bases b > 1 simultaneously (i.e., are “absolutely normal”). These are widely believed to be b-normal, for all integer bases b > 1:  = … e = … sqrt(2) = … log(2) = … Every irrational algebraic number (this conjecture is due to Borel). But there are no normality proofs for any of these constants in any base, nor are there any nonnormality results for any of these constants. Until recently, normality proofs were known only for a few relatively contrived examples such as Champernowne’s constant = … (which is 10-normal)

3 A result for algebraic numbers If x is algebraic of degree d > 1, then its binary expansion through position n must have at least C n 1/d 1-bits, for all sufficiently large n and some C that depends on x. Example: The first n binary digits of sqrt(2) must have at least sqrt(n) ones. However, note that these results are still a far cry from full normality, even in the single-digit sense. DHB, J. M. Borwein, R. E. Crandall and C. Pomerance, “On the Binary Expansions of Algebraic Numbers,” Journal of Number Theory Bordeaux, vol. 16 (2004), pg

4 New computer-based approaches to the normality problem In a recent paper to appear in the Mathematical Intelligencer (see below), we applied the following to this problem:  Analyses of Stoneham numbers (with proofs or normality and non- normality), the Erdos-Borwein constants and other classes.  High-resolution computer graphics.  Representation of digits as a “random” walk.  Statistical studies based on the random walk data.  Fractal dimension analysis.  “Strong” normality versus ordinary normality.  Applying these techniques to analyses of genome sequences. Francisco J. Aragon Artacho, David H. Bailey, Jonathan M. Borwein and Peter B. Borwein, “Walking on real numbers,” Mathematical Intelligencer, to appear (Jan 2013), available at

5 A class of provably normal constants DHB and Richard Crandall have shown that an infinite class of constants is b- normal (and thus b m -normal for any positive integer m), for instance: This particular constant was proven 2-normal by Stoneham in We extended this to the case where (2,3) are any pair (b,c) of relatively prime integers > 1, and also to an uncountable class (here r n is n-th bit of r in [0,1)): More recently, DHB and Michal Misiurewich established the  2,3 result more simply by means of a “hot spot” lemma proved using ergodic theory. DHB and M. Misiurewicz, “A Strong Hot Spot Theorem," Proceedings of the American Mathematical Society, vol. 134 (2006), no. 9, pg DHB and R. E. Crandall, “Random Generators and Normal Numbers,” Experimental Mathematics, vol. 11, no. 4 (2002), pg

6 A nonnormality result Although  2,3 is provably 2-normal, surprisingly enough it is NOT 6-normal. Note that we can write The first portion of this expression is zero, since all of the terms in the summation are integers. When n = 3 m, the second portion is accurately approximated by the first term of the series. Thus, Because this is so small for large m, this means the base-6 expansion of  2,3 has long stretches of zeroes beginning at positions 3 m + 1. This observation can be fashioned into a rigorous proof of nonnormality. DHB and J. M. Borwein, “Normal Numbers and Pseudorandom Generators,” to appear in Heinz Bauschke, ed., Proceedings of the Workshop on Computational and Analytical Mathematics in Honour of Jonathan Borwein's 60th Birthday, Springer, 2011,

7  2,3 in base-6 digits

8 General nonnormality results for the Stoneham alpha constants Given co-prime integers b > 1 and c > 1, and integers p, q, r > 0, with neither b nor c dividing r, let B = b p c q r, and assume this condition holds: Then the constant is not B-normal. Thus, for example,  b,c is b-normal but not bc-normal. If  b,c and  d,e are two Stoneham constants both nonnormal to base B, as given in the previous result, with c and e multiplicatively independent, then the sum is also nonnormal base B. Ref: DHB and J. M. Borwein, “Nonnormality of the Stoneham constants, Ramanujan Journal, to appear, available at

9 Walk on the first 100 billion base-4 digits of pi (0: up; 1: right; 2: down; 3: left)

10  2,3 as a “random” walk: base 2 (normal) vs base 6 (nonnormal)

11 Champernowne’s number C 4 (normal base 4)

12 Horizontal color maps of the digits of pi versus pseudorandom digits

13 Color map of  23 base 6 (nonnormal)

14 For additional details This talk is available at For full details, see: 1.Francisco J. Aragon Artacho, David H. Bailey, Jonathan M. Borwein and Peter B. Borwein, “Walking on real numbers,” Mathematical Intelligencer, to appear (Jan 2013), available at 2.David H. Bailey and Jonathan M. Borwein, “Nonnormality of Stoneham constants,” Ramanujan Journal, to appear, available at 3.David H. Bailey, Jonathan M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu and Alex Yee, “An empirical approach to the normality of pi,” Experimental Mathematics, vol. 21 (2012), pg , available at