The Prime Number Theorem
|
|
- Angela West
- 5 years ago
- Views:
Transcription
1 The Prime Number Theorem
2 We study the distribution of primes via the function π(x) = the number of primes x
3 It s easier to draw this way: π(x) = the number of primes x
4 Clearly, π(x) < x (not every number is prime) and lim x π(x) = (there are infinitely many primes) How many primes are there among the first integers? By brute force, π( ) = Can we approximate π(x) using elementary functions? 4
5 Gauss s Prime Number Conjecture (792) π(x) x log(x) for large x. x π(x) x log(x) π(x) x log(x) π(x) x/ log(x) π(x)
6 In terms of limits, we may write Gauss s 792 conjecture as π(x) x/ log(x) lim x π(x) = 0 or lim x x/ log(x) π(x) =. Gauss s Conjecture of 849 or For large x, π(x) x 2 dt log t lim x x dt log t π(x) 2 =. Aside: Li(x) def = x µ dt log t. 6
7 ( x ) Exercise: lim x log(x) dt log t x 2 =. (Hint: l Hôpital) Corollary: lim x If either lim x ( ) x log(x) π(x) ( x ) log(x) π(x) or lim x x 2 dt log(t) π(x) = is equivalent to lim x exists, then x 2 dt log(t) π(x) =. 7
8 The Prime Number Theorem 40 lim x π(x) ( ) =. x log(x) The convergence is very slow: At x = 0 6, π(x)/(x/ log(x)) At x = 0 9, π(x)/(x/ log(x)) At x = 0 2, π(x)/(x/ log(x))
9 It s also messy. y = π(x) ( ) x log(x)
10 The first proofs of the Prime Number Theorem (896) use the Riemann Zeta Function ζ(s) = n= n s = s + 2 s + 3 s + From calculus, we know Vallée-Poussin ζ() = ζ(2) = ζ(4) = diverges π2 converges to 6 π4 converges to 90 Hadamard 0
11 The function ζ(s) is defined for 2 all s = x + iy in C, with a simple pole at s = What s the connection with primes? Riemann
12 Fix a number M. Let Let Λ M P M = {p, p 2,..., p r : p i M} = set of primes M. = { n Z + : prime factors of n are in P M }. Note that Λ M is infinite and Example: M = 8. Then P 8 = {2, 3, 5, 7} and Λ 8 = {, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 4, 5, 6,...} = {2 α 3 α 2 5 α 3 7 α 4 : each α i is a non-negative integer} contains {, 2, 3,..., M}. 2
13 Recall that P 8 = {2, 3, 5, 7}. Consider the product ( ) ( ) 3 + ( ) ( ) Each term in the expansion has the form 2 α 3 α 2 5 α 3 7 α 4 where p P 8 ( α, α 2, α 3, α 4 are are non-negative integers These denominators are exactly the elements of Λ 8, and we get ( p + 0 p + ) p + = 2 n. n Λ 8 ) 3
14 Furthermore, by the geometric series theorem, we know that ( p + 0 p + ) ( ) r p + = = 2 p. p So we get n Λ 8 n = p P 8 r=0 ( p + 0 p + ) p + 2 = p P 8 p ( ) ( ) ( ) ( ) = =
15 More generally, we have Lemma: p P M p = n Λ M n Extension of Lemma: = n p s s all p n= = ζ(s) Now Λ M {, 2, 3,..., M}, so This gives us the n Λ M n > Corollary: M n= p P M p n. > M n= n 5
16 As M, p P M p all primes p and M n= n so that all primes p, and we get Corollary: all p ( ) p = 0 That is, can be made arbitrarily small. 6
17 A small digression: Claim: all primes ( ) p = 0 implies p prime p is divergent Remark: This gives another proof of the fact that there are infinitely many primes. The proof of the claim itself follows from a Lemma: Let > a > a 2 > a 3 > be a decreasing sequence of positive numbers such that a n converges. Then. ( a n ) 0 n= 7
18 Proof sketch Because a n converges, we can find N so that Write S = n= a n = a + a a N }{{} >S 2 ( a n ) = n= N ( a n ) n= a n < 2. n=n + a N + a N+ + }{{} < 2 ( a n ). n=n It will suffice to show that the second factor is non-zero. 8
19 Write ( a n ) = ( a N )( a N+ )( a N+2 ) n=n = i a i + i<j a i a j a i a j a k i<j<k + where all the indices start at N. 9
20 We can then show that a i < 2, a i a j < 2 2, i and i i<j That is, the right side of a i > i<j n=n( a n ) = i i<j<k a i a j > a i + i<j a i a j a k < 2 3, i<j<k a i a j a k > a i a j i<j<k satisfies the hypotheses of the Alternating Series Test. and so on, a i a j a k + By the AST, the series (and therefore the product) converges to a number between and i non-zero. a i. Since i a i <, we know that this number is 2 20
21 Old Stuff: n is divergent. New Stuff: p is divergent = = The harmonic series diverges slowly: It takes about a million terms to get to a sum of The /p series diverges very slowly: A million terms gets you only to about But with either series, if you add up enough terms, you can make the sum as large as you want. 2
22 Estimating π(x) Using Probability Pick a random X with X > M and X near M. What s the probability that you get a prime? Pr(X is not divisible by 2) = 2 = ( 2 Pr(X is not divisible by 3) = 2 3 = ( ) 3 Pr(X is not divisible by 5) = 4 5 = ( ) 5. Pr(X is not divisible by any prime in P M ) )?? M?????? = p P M ( ) p =. n n Λ M 22
23 Heuristic : Among the numbers between M and M + M, the proportion of primes is about. n n Λ M There are approximately M n Λ M n primes in the interval Example and 00 n Λ n π( ) π( ) = 4. [M, M + M]. 23
24 Heuristic 2: We can approximate In fact, n with M n Λ M n= n Λ M n = M n= n + n. n Λ M n > M n. What happens to the second summation on the right as M? The number M n= n is called the M th harmonic number. 24
25 Heuristic + Heuristic 2: There are approximately M M n n= in the interval primes [M, M + M]. Example and 00 ( n= ) n π( ) π( ) = 6. 25
26 Heuristic 3: 0.8 M n log(m + ) n= 4 The picture shows that is equal to dx, which is log(5), plus the n n= x dark red steps, whose total area is less than In fact, we have [ M ] lim log(m + ) M n n= where γ γ So for large M, M n= n log(m + ) + γ. 26
27 Heuristic + Heuristic 2 + Heuristic 3: There are approximately [M, M + M]. M log(m + ) + γ primes in the interval That is, π(m + M) π(m) π(m + M) π(m) M or M log(m + ) + γ log(m + ) + γ or d dm [π(m)] log(m + ) + γ. 27
28 Calculus? In a Number Theory talk? Now that we know (approximately) the derivative of π(x), we can use the Fundamental Theorem of Calculus to find π(x) itself. Using the fact that π(2) =, we get 40 π(x) π(2) so that π(x) + x 2 x 2 dt log(t + ) + γ dt log(t + ) + γ
29 Comparing the approximations 50 π(x) + x 2 x log(x) log(t + ) + γ dt
30 Our approximation can be simplified to π(x) + x 2 log(t + ) + γ dt e γ [Ei(log(x + ) + γ) Ei(log(3) + γ)], where Ei is the exponential integral function, Ei(z) = z e t t dt. But it can t be written in terms of elementary functions. 30
31 The good news is that you can use l Hôpital s rule to show that ( x ) + 2 log(t + ) + γ dt lim ( ) =, x x log(x) so by the real Prime Number Theorem, our heuristic approximation also works. That is, lim x ( x + 2 π(x) log(t + ) + γ dt ) =. 3
32 Some numbers x x log(x) + x 2 (log(x + ) + γ) dt π(x) ??? 32
ζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1.
Problem Sheet 3. From Theorem 3. we have ζ (s) = + s s {u} u+sdu, (45) valid for Res > 0. i) Deduce that for Res >. [u] ζ (s) = s u +sdu ote the integral contains [u] in place of {u}. ii) Deduce that for
More information1 Euler s idea: revisiting the infinitude of primes
8.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The prime number theorem Most of my handouts will come with exercises attached; see the web site for the due dates. (For example, these are
More informationPrime Number Theory and the Riemann Zeta-Function
5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no
More informationCalculus II : Prime suspect
Calculus II : Prime suspect January 31, 2007 TEAM MEMBERS An integer p > 1 is prime if its only positive divisors are 1 and p. In his 300 BC masterpiece Elements Euclid proved that there are infinitely
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationMath 229: Introduction to Analytic Number Theory The product formula for ξ(s) and ζ(s); vertical distribution of zeros
Math 9: Introduction to Analytic Number Theory The product formula for ξs) and ζs); vertical distribution of zeros Behavior on vertical lines. We next show that s s)ξs) is an entire function of order ;
More informationNeedles and Numbers. The Buffon Needle Experiment
eedles and umbers This excursion into analytic number theory is intended to complement the approach of our textbook, which emphasizes the algebraic theory of numbers. At some points, our presentation lacks
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationGod may not play dice with the universe, but something strange is going on with the prime numbers.
Primes: Definitions God may not play dice with the universe, but something strange is going on with the prime numbers. P. Erdös (attributed by Carl Pomerance) Def: A prime integer is a number whose only
More informationA Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis
A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis Jonathan Sondow 209 West 97th Street New York, NY 0025 jsondow@alumni.princeton.edu The Riemann Hypothesis (RH) is the greatest
More informationThe Prime Number Theorem
Chapter 3 The Prime Number Theorem This chapter gives without proof the two basic results of analytic number theory. 3.1 The Theorem Recall that if f(x), g(x) are two real-valued functions, we write to
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationRiemann s Zeta Function and the Prime Number Theorem
Riemann s Zeta Function and the Prime Number Theorem Dan Nichols nichols@math.umass.edu University of Massachusetts Dec. 7, 2016 Let s begin with the Basel problem, first posed in 1644 by Mengoli. Find
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationPRIME NUMBER THEOREM
PRIME NUMBER THEOREM RYAN LIU Abstract. Prime numbers have always been seen as the building blocks of all integers, but their behavior and distribution are often puzzling. The prime number theorem gives
More informationThe Riemann Hypothesis
University of Hawai i at Mānoa January 26, 2016 The distribution of primes Euclid In ancient Greek times, Euclid s Elements already answered the question: Q: How many primes are there? Euclid In ancient
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationPrimes in arithmetic progressions
(September 26, 205) Primes in arithmetic progressions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/mfms/notes 205-6/06 Dirichlet.pdf].
More informationSolutions to Problem Sheet 4
Solutions to Problem Sheet 4 ) From Theorem 4.0 we have valid for Res > 0. i) Deduce that for Res >. ζ(s) = + s s [u] ζ(s) = s u +sdu ote the integral contains [u] in place of. ii) Deduce that for 0
More informationSECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS
(Chapter 9: Discrete Math) 9.11 SECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS PART A: WHAT IS AN ARITHMETIC SEQUENCE? The following appears to be an example of an arithmetic (stress on the me ) sequence:
More informationFirst, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x
8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.
More information(Infinite) Series Series a n = a 1 + a 2 + a a n +...
(Infinite) Series Series a n = a 1 + a 2 + a 3 +... + a n +... What does it mean to add infinitely many terms? The sequence of partial sums S 1, S 2, S 3, S 4,...,S n,...,where nx S n = a i = a 1 + a 2
More informationAlan Turing and the Riemann hypothesis. Andrew Booker
Alan Turing and the Riemann hypothesis Andrew Booker Introduction to ζ(s) and the Riemann hypothesis The Riemann ζ-function is defined for a complex variable s with real part R(s) > 1 by ζ(s) := n=1 1
More informationSynopsis of Complex Analysis. Ryan D. Reece
Synopsis of Complex Analysis Ryan D. Reece December 7, 2006 Chapter Complex Numbers. The Parts of a Complex Number A complex number, z, is an ordered pair of real numbers similar to the points in the real
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More informationHere is another characterization of prime numbers.
Here is another characterization of prime numbers. Theorem p is prime it has no divisors d that satisfy < d p. Proof [ ] If p is prime then it has no divisors d that satisfy < d < p, so clearly no divisor
More informationDirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:
Dirichlet s Theorem Martin Orr August 1, 009 1 Introduction The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Theorem 1.1. If m, a N are coprime, then there
More information8.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
8. Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = Examples: 6. Find a formula for the general term a n of the sequence, assuming
More informationFormulae for Computing Logarithmic Integral Function ( )!
Formulae for Computing Logarithmic Integral Function x 2 ln t Li(x) dt Amrik Singh Nimbran 6, Polo Road, Patna, INDIA Email: simnimas@yahoo.co.in Abstract: The prime number theorem states that the number
More informationWe start with a simple result from Fourier analysis. Given a function f : [0, 1] C, we define the Fourier coefficients of f by
Chapter 9 The functional equation for the Riemann zeta function We will eventually deduce a functional equation, relating ζ(s to ζ( s. There are various methods to derive this functional equation, see
More informationEvaluating ζ(2m) via Telescoping Sums.
/25 Evaluating ζ(2m) via Telescoping Sums. Brian Sittinger CSU Channel Islands February 205 2/25 Outline 2 3 4 5 3/25 Basel Problem Find the exact value of n= n 2 = 2 + 2 2 + 3 2 +. 3/25 Basel Problem
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More information16.4. Power Series. Introduction. Prerequisites. Learning Outcomes
Power Series 6.4 Introduction In this Section we consider power series. These are examples of infinite series where each term contains a variable, x, raised to a positive integer power. We use the ratio
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationNotes on the Riemann Zeta Function
Notes on the Riemann Zeta Function March 9, 5 The Zeta Function. Definition and Analyticity The Riemann zeta function is defined for Re(s) > as follows: ζ(s) = n n s. The fact that this function is analytic
More informationProbabilistic Aspects of the Integer-Polynomial Analogy
Probabilistic Aspects of the Integer-Polynomial Analogy Kent E. Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu Zhou Dong Department
More informationMATH 162. Midterm 2 ANSWERS November 18, 2005
MATH 62 Midterm 2 ANSWERS November 8, 2005. (0 points) Does the following integral converge or diverge? To get full credit, you must justify your answer. 3x 2 x 3 + 4x 2 + 2x + 4 dx You may not be able
More informationRiemann Hypotheses. Alex J. Best 4/2/2014. WMS Talks
Riemann Hypotheses Alex J. Best WMS Talks 4/2/2014 In this talk: 1 Introduction 2 The original hypothesis 3 Zeta functions for graphs 4 More assorted zetas 5 Back to number theory 6 Conclusion The Riemann
More informationVerbatim copying and redistribution of this document. are permitted in any medium provided this notice and. the copyright notice are preserved.
New Results on Primes from an Old Proof of Euler s by Charles W. Neville CWN Research 55 Maplewood Ave. West Hartford, CT 06119, U.S.A. cwneville@cwnresearch.com September 25, 2002 Revision 1, April, 2003
More informationMATH3500 The 6th Millennium Prize Problem. The 6th Millennium Prize Problem
MATH3500 The 6th Millennium Prize Problem RH Some numbers have the special property that they cannot be expressed as the product of two smaller numbers, e.g., 2, 3, 5, 7, etc. Such numbers are called prime
More informationRandom matrices and the Riemann zeros
Random matrices and the Riemann zeros Bruce Bartlett Talk given in Postgraduate Seminar on 5th March 2009 Abstract Random matrices and the Riemann zeta function came together during a chance meeting between
More informationHeuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn
Heuristics for Prime Statistics Brown Univ. Feb., 2006 K. Conrad, UConn Two quotes about prime numbers Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers,
More informationPrime Numbers. Prime Numbers. Ramesh Sreekantan ISI, Bangalore. December 1, 2014
Prime Numbers Prime Numbers Ramesh Sreekantan ISI, Bangalore December 1, 2014 Introduction - Prime Numbers Prime numbers are the numbers 2,3,5,7... These are natural numbers which cannot be divided by
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
More informationTHE RIEMANN HYPOTHESIS: IS TRUE!!
THE RIEMANN HYPOTHESIS: IS TRUE!! Ayman MACHHIDAN Morocco Ayman.mach@gmail.com Abstract : The Riemann s zeta function is defined by = for complex value s, this formula have sense only for >. This function
More informationMath 162: Calculus IIA
Math 62: Calculus IIA Final Exam ANSWERS December 9, 26 Part A. (5 points) Evaluate the integral x 4 x 2 dx Substitute x 2 cos θ: x 8 cos dx θ ( 2 sin θ) dθ 4 x 2 2 sin θ 8 cos θ dθ 8 cos 2 θ cos θ dθ
More informationRiemann Zeta Function and Prime Number Distribution
Riemann Zeta Function and Prime Number Distribution Mingrui Xu June 2, 24 Contents Introduction 2 2 Definition of zeta function and Functional Equation 2 2. Definition and Euler Product....................
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationPower series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
More informationECE 301 Fall 2011 Division 1. Homework 1 Solutions.
ECE 3 Fall 2 Division. Homework Solutions. Reading: Course information handout on the course website; textbook sections.,.,.2,.3,.4; online review notes on complex numbers. Problem. For each discrete-time
More information1 The functional equation for ζ
18.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The functional equation for the Riemann zeta function In this unit, we establish the functional equation property for the Riemann zeta function,
More informationConvergence of Some Divergent Series!
Convergence of Some Divergent Series! T. Muthukumar tmk@iitk.ac.in 9 Jun 04 The topic of this article, the idea of attaching a finite value to divergent series, is no longer a purely mathematical exercise.
More informationNOTES ON RIEMANN S ZETA FUNCTION. Γ(z) = t z 1 e t dt
NOTES ON RIEMANN S ZETA FUNCTION DRAGAN MILIČIĆ. Gamma function.. Definition of the Gamma function. The integral Γz = t z e t dt is well-defined and defines a holomorphic function in the right half-plane
More informationDivergent Series: why = 1/12. Bryden Cais
Divergent Series: why + + 3 + = /. Bryden Cais Divergent series are the invention of the devil, and it is shameful to base on them any demonstration whatsoever.. H. Abel. Introduction The notion of convergence
More informationSome Interesting Properties of the Riemann Zeta Function
Some Interesting Properties of the Riemann Zeta Function arxiv:822574v [mathho] 2 Dec 28 Contents Johar M Ashfaque Introduction 2 The Euler Product Formula for ζ(s) 2 3 The Bernoulli Numbers 4 3 Relationship
More informationPrimes, queues and random matrices
Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationPrime Numbers and Shizits
Prime Numbers and Shizits Nick Handrick, Chris Magyar University of Wisconsin Eau Claire March 7, 2017 Book IX: Proposition 20 Euclid, cerca 300 BCE Prime numbers are more than any assigned multitude of
More informationUnderstanding the Prime Number Theorem
Understanding the Prime Number Theorem Misunderstood Monster or Beautiful Theorem? Liam Fowl September 5, 2014 Liam Fowl Understanding the Prime Number Theorem 1/20 Outline 1 Introduction 2 Complex Plane
More informationarxiv: v1 [math.nt] 19 May 2011
FUN WITH VERY LARGE NUMBERS ROBERT BAILLIE Dedicated to Professor Jon Borwein on the occasion of his sixtieth birthday. arxiv:5.3943v [math.nt] 9 May 2 Abstract. We give an example of a formula involving
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationWarm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov
Writing more proofs Misha Lavrov ARML Practice 3/16/2014 and 3/23/2014 Warm-up Using the quantifier notation on the reference sheet, and making any further definitions you need to, write the following:
More informationThe Riemann Hypothesis
The Riemann Hypothesis by Pedro Pablo Pérez Velasco, 2011 Introduction Consider the series of questions: How many prime numbers (2, 3, 5, 7,...) are there less than 100, less than 10.000, less than 1.000.000?
More informationInfinite Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Infinite Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background Consider the repeating decimal form of 2/3. 2 3 = 0.666666 = 0.6 + 0.06 + 0.006 + 0.0006 + = 6(0.1)
More informationTHE GAMMA FUNCTION AND THE ZETA FUNCTION
THE GAMMA FUNCTION AND THE ZETA FUNCTION PAUL DUNCAN Abstract. The Gamma Function and the Riemann Zeta Function are two special functions that are critical to the study of many different fields of mathematics.
More informationGauss and Riemann versus elementary mathematics
777-855 826-866 Gauss and Riemann versus elementary mathematics Problem at the 987 International Mathematical Olympiad: Given that the polynomial [ ] f (x) = x 2 + x + p yields primes for x =,, 2,...,
More informationChapter 8. Infinite Series
8.4 Series of Nonnegative Terms Chapter 8. Infinite Series 8.4 Series of Nonnegative Terms Note. Given a series we have two questions:. Does the series converge? 2. If it converges, what is its sum? Corollary
More informationMATH 311: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE
MATH 3: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE Recall the Residue Theorem: Let be a simple closed loop, traversed counterclockwise. Let f be a function that is analytic on and meromorphic inside. Then
More informationProof of Lagarias s Elementary Version of the Riemann Hypothesis.
Proof of Lagarias s Elementary Version of the Riemann Hypothesis. Stephen Marshall 27 Nov 2018 Abstract The Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative
More informationSolutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00
Solutions to 8.78 Problem Set 4 - Fall 008 Due Tuesday, Oct. 7 at :00. (a Prove that for any arithmetic functions f, f(d = f ( n d. To show the relation, we only have to show this equality of sets: {d
More informationA PROBABILISTIC PROOF OF WALLIS S FORMULA FOR π. ( 1) n 2n + 1. The proof uses the fact that the derivative of arctan x is 1/(1 + x 2 ), so π/4 =
A PROBABILISTIC PROOF OF WALLIS S FORMULA FOR π STEVEN J. MILLER There are many beautiful formulas for π see for example [4]). The purpose of this note is to introduce an alternate derivation of Wallis
More informationIntroduction to Series and Sequences Math 121 Calculus II Spring 2015
Introduction to Series and Sequences Math Calculus II Spring 05 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial of infinite
More informationMATH 216T TOPICS IN NUMBER THEORY
California State University, Fresno MATH 6T TOPICS IN NUMBER THEORY Spring 00 Instructor : Stefaan Delcroix Chapter Diophantine Equations Definition. Let f(x,..., x n ) be a polynomial with integral coefficients
More informationMATHEMATICAL PRELIMINARIES
CHAPTER MATHEMATICAL PRELIMINARIES This introductory chapter surveys a number of mathematical techniques that are needed throughout the book. Some of the topics (e.g., complex variables) are treated in
More informationRelationship Between Integration and Differentiation
Relationship Between Integration and Differentiation Fundamental Theorem of Calculus Philippe B. Laval KSU Today Philippe B. Laval (KSU) FTC Today 1 / 16 Introduction In the previous sections we defined
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationContent. CIMPA-ICTP Research School, Nesin Mathematics Village The Riemann zeta function Michel Waldschmidt
Artin L functions, Artin primitive roots Conjecture and applications CIMPA-ICTP Research School, Nesin Mathematics Village 7 http://www.rnta.eu/nesin7/material.html The Riemann zeta function Michel Waldschmidt
More informationTerminology Notation Definition Big oh notation f(s) = O(g(s)) (s S) There exists a constant c such that f(s) c g(s) for all s S
Chapter 2 Asymptotic notations 2.1 The oh notations Terminology Notation Definition Big oh notation f(s) = O(g(s)) (s S) There exists a constant c such that f(s) c g(s) for all s S nota- Vinogradov tion
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationn=1 ( 2 3 )n (a n ) converges by direct comparison to
. (a) n = a n converges, so we know that a n =. Therefore, for n large enough we know that a n
More informationRational Functions. Elementary Functions. Algebra with mixed fractions. Algebra with mixed fractions
Rational Functions A rational function f (x) is a function which is the ratio of two polynomials, that is, Part 2, Polynomials Lecture 26a, Rational Functions f (x) = where and are polynomials Dr Ken W
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationTwin primes (seem to be) more random than primes
Twin primes (seem to be) more random than primes Richard P. Brent Australian National University and University of Newcastle 25 October 2014 Primes and twin primes Abstract Cramér s probabilistic model
More informationFRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS
FRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS HUNDUMA LEGESSE GELETA, ABDULKADIR HASSEN Both authors would like to dedicate this in fond memory of Marvin Knopp. Knop was the most humble and exemplary teacher
More informationStudy of some equivalence classes of primes
Notes on Number Theory and Discrete Mathematics Print ISSN 3-532, Online ISSN 2367-8275 Vol 23, 27, No 2, 2 29 Study of some equivalence classes of primes Sadani Idir Department of Mathematics University
More informationDistribution of Prime Numbers Prime Constellations Diophantine Approximation. Prime Numbers. How Far Apart Are They? Stijn S.C. Hanson.
Distribution of How Far Apart Are They? June 13, 2014 Distribution of 1 Distribution of Behaviour of π(x) Behaviour of π(x; a, q) 2 Distance Between Neighbouring Primes Beyond Bounded Gaps 3 Classical
More informationThe Prime Number Theorem and the Zeros of the Riemann Zeta Function
The Prime Number Theorem and the Zeros of the Riemann Zeta Function John Nicolas Treuer Advisor: Adam Fieldsteel A thesis in Mathematics submitted to the faculty of Wesleyan University in partial fulfillment
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationInfinite series, improper integrals, and Taylor series
Chapter Infinite series, improper integrals, and Taylor series. Determine which of the following sequences converge or diverge (a) {e n } (b) {2 n } (c) {ne 2n } (d) { 2 n } (e) {n } (f) {ln(n)} 2.2 Which
More informationLecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method. Daniel Goldston
Lecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method Daniel Goldston π(x): The number of primes x. The prime number theorem: π(x) x log x, as x. The average
More informationMAT137 - Term 2, Week 2
MAT137 - Term 2, Week 2 This lecture will assume you have watched all of the videos on the definition of the integral (but will remind you about some things). Today we re talking about: More on the definition
More informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
More informationComplex Analysis for F2
Institutionen för Matematik KTH Stanislav Smirnov stas@math.kth.se Complex Analysis for F2 Projects September 2002 Suggested projects ask you to prove a few important and difficult theorems in complex
More information1. (25 points) Consider the region bounded by the curves x 2 = y 3 and y = 1. (a) Sketch both curves and shade in the region. x 2 = y 3.
Test Solutions. (5 points) Consider the region bounded by the curves x = y 3 and y =. (a) Sketch both curves and shade in the region. x = y 3 y = (b) Find the area of the region above. Solution: Observing
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationSome Thoughts on Benford s Law
Some Thoughts on Benford s Law Steven J. Miller ovember, 004 Abstract For many systems, there is a bias in the distribution of the first digits. For example, if one looks at the first digit of n in base
More informationMORE CONSEQUENCES OF CAUCHY S THEOREM
MOE CONSEQUENCES OF CAUCHY S THEOEM Contents. The Mean Value Property and the Maximum-Modulus Principle 2. Morera s Theorem and some applications 3 3. The Schwarz eflection Principle 6 We have stated Cauchy
More informationSeries. Definition. a 1 + a 2 + a 3 + is called an infinite series or just series. Denoted by. n=1
Definition a 1 + a 2 + a 3 + is called an infinite series or just series. Denoted by a n, or a n. Chapter 11: Sequences and, Section 11.2 24 / 40 Given a series a n. The partial sum is the sum of the first
More information