Harmonic sets and the harmonic prime number theorem
|
|
- Shavonne Hudson
- 5 years ago
- Views:
Transcription
1 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 We restrict primes and prime powers to sets H() = ( 2n, 2n ]. Let θ H () = p H() log p. Then the error in θ H() has, unconditionally, the epected order of magnitude θ H () = log 2 + O ( ). However, if ψ H () = p m H() log p then ψ H() = log 2 + O(log ). Some reasons for and consequences of these sharp results are eplored. A proof is given of the harmonic prime number theorem, π H ()/π() log 2.. INTRODUCTION ( 2n ) a good estimate for the square full part of the binomial coefficient nusing derived by [4] it was shown in [] that, if an is the square-free part of n!, then log a n = n log 2+O( n). Of course log a n is the sum of the logarithms of primes which appear to odd powers in the prime factorization of n!, and includes, according to the given result, more than half of the primes up to n. If n < p n then these primes are easy to describe: p divides the square-free part of n! if and only if [n/p] is odd, or in other words for some whole number m n 2m < p n 2m. This shows that, at least for primes sufficiently large, dividing the square free part of n! has an alternative description as membership in the union of a finite set of half open intervals. As the primes get smaller the description of the intervals becomes more comple. For eample if n /3 < p n /2, p divides the square-free part of n! if and only if for some j N n j + < p n j and [n ] has opposite parity to j. p
2 2 BROUGHAN,CASEY (To see this consider p α n! such that α = [n/p] + [n/p 2 ] with j = [n/p 2 ].) The net level would be n /4 < p n /3 with an even more comple description in terms of intervals. So, instead of proceeding in this manner a restricted sum of logarithms of primes is defined assuming all of the intervals have the first form leading to the set H() = ( 2n, 2n ] and restricted sums θ H () = p H() log p, ψ H() = m,p m H() log p, and π H () = p H(). By bridging across to log a n we derive θ H () = log 2 + O( ). After getting a better epression for log a n we are able to obtain a lower bound π H () log 2/ log + O( / log ). One suspects this lower bound is also an upper bound as evidenced by the first approimation π H ()/π() log 2 which is proved. Quite independent of log a n, by rewriting ψ H () = and using Chebychev s result log([]!) = ( ) n+ ψ( n ) ψ( n ), N the natural error for these sums, ψ H () = log 2 + O(log ), is derived. An eplanation for the unepected regularity of these sums comes from an integral epression for ψ H () in terms of the Riemann zeta function: ψ H () does not depend on the non-trivial zeros of ζ(s), whereas ψ() ψ H () depends on all of them. A study of arithmetic progressions in the contet of the sets H() shows that no restricted analogue of Dirichlet s theorem (for primes in an arithmetic progression) can be true. 2. RESTRICTED FORMS OF CHEBYCHEV S FUNCTIONS Definition 2.. Let > 0 be a real number. Then the harmonic set with parameter is defined to be H() = ( 2n, 2n ].
3 HARMONIC SETS 3 Definition 2.2. For R, > 0 let θ H () = log p = log p, where p is any prime. p H() p, /p odd Theorem 2.. As, θ H () = log 2 + O ( ). Proof. Let 4 and N = By [, Theorem ], if a N is the square free part of N! ( ) () log a N = N log 2 + O N, where the implied constant is absolute. Let n N, let k = 2n be odd and 2N p N a rational prime with p k N!. Then k = N/p and k(k + ) N. Therefore, by [, Lemma ], N 2n < p N 2n Conversely, if p satisfies this inequality for some n N and 2N p N, k = 2n, then 2N p N/k which implies 2k N so k(k + ) N. Hence k is odd and p k N!. Now split the sum which defines θ H (): θ H () = n 2N 2n <p 2n = + 2 log p + By what has been shown, ( ) 2 = a N + O 2N ( ) = N log 2 + O N = log 2 + O ( ) 2N<n N 2n <p 2n log p Also = O 2 p O( )(log p) = O ( )
4 4 BROUGHAN,CASEY so the result follows. Definition 2.3. ψ H () = log p 2n <pm 2n Since 0 ψ H () θ H () log 2 2 log 2 we can write ψ H () = log 2 log + O( log 2 ). However it is easy to derive a more accurate error estimate. Theorem 2.2. As,ψ H () = log 2 log + O(log ) Proof. Let T () := log([]!) when N and T (n) = (T (n+) + T (n ))/2 for n N. Then [2, Page 282] From the definition T () = ψ H () = ψ( n ). ( ) n+ ψ( n ). Therefore T () ψ H () = 2T (/2). Using Stirling s approimation T () = log + O(log ), the given epression for ψ H () follows directly. Definition 2.4. π H () = 2n <p 2n Since when p, log p/ log we see π H () θ H() log = log 2 log + O( log ). However we have not been able to verify the conjecture that this lower bound is also an upper bound. This would deliver the epected error bound in what might be called the harmonic prime number theorem. Below the asymptotic form is derived. Some numerical evidence seems to indicate that Li() log 2 is not as good an approimation to π H () as Li() is to π(). See Figure.
5 HARMONIC SETS FIG.. Comparison of Li() log 2 (top), π H () (middle), log 2/ log (bottom). Theorem 2.3. lim inf π H () π() log 2. Proof. First using Theorem 2. write θ H () θ() Then use the integral formula log 2 + O( ) log 2 + o() = = log 2. + o() + o() π() = θ() log + θ(t) 2 t log 2 t dt and the lower bound for π H () given above to write π H () π() = θ H ()/ log θ() log + θ(t) 2 t log 2 t dt θ H ()/θ() + log θ() 2 θ(t) t log 2 t dt. and the second term in the denominator tends to zero.
6 6 BROUGHAN,CASEY To derive the asymptotic form of the upper bound for the ratio π H ()/π() we use the theorem of Heath-Brown [3], namely uniformly for 7/2 y. Theorem 2.4. π() π( y) = y log + O( y log 45/44 ) π H () lim = log 2. π() Proof. First we find an upper bound for the ratio in terms of integrals and error terms, then show that four of the terms in the ratio tend to zero. Finally we show that lim sup π H ()/π() log 2 so the theorem follows from this inequality and the previous theorem. We use the notation I(a, b) := b (/ log t)dt. a () π H () π() = 7/2 I( 2n, 2n ) + O( 7/2 I(2, ) + O( 2n(2n ) log 45/44 ( 2n log 2 ) )) + O( 7/2 log ) 7/2 I( 2n, 2n ) O( 7/2 2n(2n ) log I(2,) + 45/44 ( 2n ) ) I(2,) + O(7/2 / log ) I(2,) + O(/ log2 ) I(2,). (2) The last term in the denominator: O( log 2 ) I(2, ) (3) The last term in the numerator: = O( log ) + O( log ) 0. 7/2 log I(2, ) = O( 5/2 ) + O( log ) 0. (4) The second term in the numerator:
7 HARMONIC SETS 7 7/2 log + O( 2n(2n ) log 45/44 ( 2n ) log 2 ) log 7/2 log /44 2n(2n ) (log log ) 45/44 + O( log ) 7/2 2n(2n ) + O( log ) 0. (5) Finally we show that lim sup 7/2 I( 2n, 2n ) log 2 : I(2, ) Firstly, by L Hôpital s rule, for each n N, I( lim 2n, 2n ) I(2, ) Let > 4 2/5 and N < /4. Then = 2n(2n ). so 7/2 I( 2n, I(2, ) 2n ) /4 I( 2n, I(2, ) 2n ) I(2, ) I( 3, 2 ) I( I(2, ) 2N+, 2N ) lim sup 7/2 I( 2n, I(2, ) 2n ) 2.3 2N.(2N + ). But this is true for all N so therefore lim sup 7/2 I( 2n, I(2, ) 2n ) log ARITHMETIC PROGRESSIONS Definition 3.. If > 0 let K() := [(2n ), 2n).
8 8 BROUGHAN,CASEY Lemma 3.. If, y R are positive, then y H() K(y). Lemma 3.2. Let {q,..., q m } N be odd, q = q... q m, and r = min{q,..., q m }. Then if [(2n )q, (2n )q + r) we have {q,..., q m } H(). Proof. Let n N be such that [(2n )q, (2n )q + r). Then for j m, (2n )q... q m (2n )q < + r (2n )q + q j q j q j q j q j Hence q j = (2n )q... ˆq j... q m is odd so q j H(). Note: This shows, for eample, that each finite subset of odd primes {p,..., p m } H( j ) for a sequence j. Lemma 3.3. If α R then as #(N + α) H() = log 2 + O ( ) where the implied constant is absolute. ( Proof. For n N and > 0 let I n = H() = 2n, I n ] 2n so and for n, (N + α) I n has at most one point. For n >, #(N + α) I n = and hence 2n(2n ) #(N + α) H() = 2n(2n ) = log 2 + O ( ). + O ( )
9 HARMONIC SETS 9 Lemma 3.4. Let A(h, k) = {mk + h : m = 0,, 2,...} be an arithmetic progression with h, k Z and k > 0. Then, as #{A(h, k) H()} = log 2 k where the implied constant is absolute. ( ) + O /k Proof. The term km + h A(h, k) H() if and only if for some n 2n < km + h 2n if and only if /k 2n < m + h k /k 2n the result follows directly from Lemma 3.3 with α replaced by n/k and replaced by /k. Theorem 3.. Let h and k Z be such that (h, k) =. Then there eists a sequence m in R such that #A(h, k) P H ( m ). Proof. Number the infinite sequence of distinct primes in A(h,k) as {p, p 2,...}. Then, by Lemma 3.2, there is a number m m such that {p,..., p m } A(h, k) P H ( m ). It might be thought that with the same notation as in the theorem above, for all #{A(h, k) P H ()}. However if we let m = 2p... p m n i = p... ˇp i... p m then m [2n i p i, (2n i + ) p i ) But this last set has an empty intersection with K(p i ), so therefore p i / H ( m ) so A(h, k) P H ( m ) =. It follows that p h mod k,p H( m ) log p p = 0 log 2 φ(k) log m + O() so the natural version of Dirichlet s theorem is false. 4. MORE ACCURATE EXPRESSIONS
10 0 BROUGHAN,CASEY Lemma 4.. For all n N let a n be the square free part of n!. Let ɛ > 0 be given. Then for all n n ɛ, log a 2n = 2n log 2 c n + A n where A n ɛ n + 2 log(4n π ) + 2n + 5n 2. if Proof. By Stirling s formula there eists an n such that for all n n R n R n < := log n! (n log n n + log(2πn)), then 2 44n 2. If θ n is the square free part of n + then log θ n log(n + ) so for all n if T n := log θ 2n 2 log(a 2n, θ 2n ), then T n < log(2n + ). It follows from these bounds that, for n n ɛ, log a 2n = (2n + 2 ) log 2 c n 2 log(2πn) + R 2n + R n + S n + T n and R 2n + R n + S n + T n < ɛ n + log(2n + ) +, so therefore 5n2 log a 2n = 2n log 2 c n + A n, where A n ɛ n + 2 log(4n π ) + 2n + 5n 2. If n is odd then the value of a n is the same as that of a n ecept for n prime in which case an etra error of log n is incurred leading to: Lemma 4.2. Let ɛ > 0 be given. Then for all n n ɛ, log a 2n+ = 2n log 2 c n + B n
11 HARMONIC SETS where B n ɛ n + 2 log(8n3 π ) + n + 5n 2. Since these epressions are valid for all ɛ > 0, by first using, say, ɛ/2 and adjusting n ɛ, we can make the uniform statement Theorem 4.. Let ɛ > 0 be given. Then for all n n ɛ, where n log a n = n log 2 c 2 + C n C n ɛ n. 5. CONNECTION WITH THE RIEMANN ZETA FUNCTION Theorem 5.. Let Z be the non-trivial zeros of ζ(s). Then ρ Z ρ ρ 2 ( ) n+ n ρ ( ) = O 3/4 log 2. Proof. The von Mangoldt formula is ψ() = ρ Z ρ ρ ( 2 log ) 2 log 2π for > 0 and where the conditionally convergent sum is taken with increasing Imρ. Hence θ() = ρ Z ρ ρ + O ( log 2 ). Write θ H () = n θ( 2n ) θ( 2n ) + O ( )
12 2 BROUGHAN,CASEY so, by Theorem 2., 2 ( ) n+ log 2 = ρ [ n ρ ρ + O ( ) + O n log 2 ( n ( ( )) = log 2 O ρ ( ) +O 3/4 log 2 (2n ) ρ (2n) ρ ρ ρ ) [ (2n ) ρ ] (2n) ρ ] Therefore ρ ρ ρ 2 ( ) n+ n ρ ( ) = O 3/4 log 2. Theorem 5.2. Let a > and > 0. Then ψ H () = ( ζ (s))( 2 s ) s ds 2πi s. (a) Proof. Since [2, Section 3.2] it follows that ψ() = ( ζ (s)) ds s 2πi (a) ζ(s) s T () = ψ( n ) = 2πi = 2πi (a) (a) ( ζ (s)) ζ(s) s [ n s ]ds s ( ζ (s)) s ds s. (The interchange of integration and summation in the second line is justified by the finiteness of the sum and vanishing of the integral for all but a
13 HARMONIC SETS 3 finite number of terms.) Therefore ψ H () = T () 2T ( 2 ) = ( ζ (s))( s 2( 2πi 2 )s ) ds s = 2πi (a) (a) ( ζ (s))( 2 s ) s ds s. This representation shows that ψ H () depends only on the (double) pole of ζ (s) at s = and the value ζ (0). Since ( ) n+ η(s) := n s = ( 2 s )ζ(s), we can write ψ K () := p m H() log p = ψ() ψ H () = ( ζ (s) ds )(η(s) )s 2πi (a) ζ(s) s. This epression shows that the complimentary function ψ K () depends on (all of) the non-trivial zeros of ζ(s), and this dichotomy thus offers an eplanation for the unepected regularity of ψ H (). REFERENCES. Broughan, K. A. Asymptotic order of the squarefree part of n!. Integers: Electronic Journal of Combinatorial Number Theory, 2 A0, (2002), p Edwards, T.M. Riemann s zeta function. New York: Dover, Heath-Brown, D.R. Sieve identities and gaps between primes., Journèes Arithmètiques, Metz, (98), p Sárközy, A. On divisors of binomial coefficients I, J. Number Theory 20 (985), p70-80.
= 1 2 x (x 1) + 1 {x} (1 {x}). [t] dt = 1 x (x 1) + O (1), [t] dt = 1 2 x2 + O (x), (where the error is not now zero when x is an integer.
Problem Sheet,. i) Draw the graphs for [] and {}. ii) Show that for α R, α+ α [t] dt = α and α+ α {t} dt =. Hint Split these integrals at the integer which must lie in any interval of length, such as [α,
More informationFlat primes and thin primes
Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes
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 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 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 informationOn the Subsequence of Primes Having Prime Subscripts
3 47 6 3 Journal of Integer Sequences, Vol. (009, Article 09..3 On the Subsequence of Primes Having Prime Subscripts Kevin A. Broughan and A. Ross Barnett University of Waikato Hamilton, New Zealand kab@waikato.ac.nz
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 informationTHE DENSITY OF PRIMES OF THE FORM a + km
THE DENSITY OF PRIMES OF THE FORM a + km HYUNG KYU JUN Abstract. The Dirichlet s theorem on arithmetic progressions states that the number of prime numbers less than of the form a + km is approimately
More informationBefore giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before
More informationGeneralized Euler constants
Math. Proc. Camb. Phil. Soc. 2008, 45, Printed in the United Kingdom c 2008 Cambridge Philosophical Society Generalized Euler constants BY Harold G. Diamond AND Kevin Ford Department of Mathematics, University
More informationPrimes in arithmetic progressions to large moduli
CHAPTER 3 Primes in arithmetic progressions to large moduli In this section we prove the celebrated theorem of Bombieri and Vinogradov Theorem 3. (Bombieri-Vinogradov). For any A, thereeistsb = B(A) such
More informationLINNIK S THEOREM MATH 613E UBC
LINNIK S THEOREM MATH 63E UBC FINAL REPORT BY COLIN WEIR AND TOPIC PRESENTED BY NICK HARLAND Abstract This report will describe in detail the proof of Linnik s theorem regarding the least prime in an arithmetic
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 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 informationAPPROXIMATIONS FOR SOME FUNCTIONS OF PRIMES
APPROXIMATIONS FOR SOME FUNCTIONS OF PRIMES Fataneh Esteki B. Sc., University of Isfahan, 2002 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge in Partial Fulfillment
More informationas x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7.1 The Prime number theorem Denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.1. We have π( log as. Before
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 informationTWO PROOFS OF THE PRIME NUMBER THEOREM. 1. Introduction
TWO PROOFS OF THE PRIME NUMBER THEOREM PO-LAM YUNG Introduction Let π() be the number of primes The famous prime number theorem asserts the following: Theorem (Prime number theorem) () π() log as + (This
More informationChapter One. Introduction 1.1 THE BEGINNING
Chapter One Introduction. THE BEGINNING Many problems in number theory have the form: Prove that there eist infinitely many primes in a set A or prove that there is a prime in each set A (n for all large
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 informationMath 680 Fall A Quantitative Prime Number Theorem I: Zero-Free Regions
Math 68 Fall 4 A Quantitative Prime Number Theorem I: Zero-Free Regions Ultimately, our goal is to prove the following strengthening of the prime number theorem Theorem Improved Prime Number Theorem: There
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 almost all short intervals and the distribution of the zeros of the Riemann zeta-function
Primes in almost all short intervals and the distribution of the zeros of the Riemann zeta-function Alessandro Zaccagnini Dipartimento di Matematica, Università degli Studi di Parma, Parco Area delle Scienze,
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
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 informationDirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007
Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).
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 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 informationTHE CONVEX HULL OF THE PRIME NUMBER GRAPH
THE CONVEX HULL OF THE PRIME NUMBER GRAPH NATHAN MCNEW Abstract Let p n denote the n-th prime number, and consider the prime number graph, the collection of points n, p n in the plane Pomerance uses the
More informationMath 259: Introduction to Analytic Number Theory How small can disc(k) be for a number field K of degree n = r 1 + 2r 2?
Math 59: Introduction to Analytic Number Theory How small can disck be for a number field K of degree n = r + r? Let K be a number field of degree n = r + r, where as usual r and r are respectively the
More informationTake-Home Final Examination of Math 55a (January 17 to January 23, 2004)
Take-Home Final Eamination of Math 55a January 17 to January 3, 004) N.B. For problems which are similar to those on the homework assignments, complete self-contained solutions are required and homework
More informationζ (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 informationLINEAR LAW FOR THE LOGARITHMS OF THE RIEMANN PERIODS AT SIMPLE CRITICAL ZETA ZEROS
MATHEMATICS OF COMPUTATION Volume 75, Number 54, Pages 89 90 S 005-578(05)0803-X Article electronically published on November 30, 005 LINEAR LAW FOR THE LOGARITHMS OF THE RIEMANN PERIODS AT SIMPLE CRITICAL
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 informationSmall prime gaps. Kevin A. Broughan. December 7, University of Waikato, Hamilton, NZ
Small prime gaps Kevin A. Broughan University of Waikato, Hamilton, NZ kab@waikato.ac.nz December 7, 2017 Abstract One of the more spectacular recent advances in analytic number theory has been the proof
More informationSolutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such
More informationThe incomplete gamma functions. Notes by G.J.O. Jameson. These notes incorporate the Math. Gazette article [Jam1], with some extra material.
The incomplete gamma functions Notes by G.J.O. Jameson These notes incorporate the Math. Gazette article [Jam], with some etra material. Definitions and elementary properties functions: Recall the integral
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 informationMTH598A Report The Vinogradov Theorem
MTH598A Report The Vinogradov Theorem Anurag Sahay 11141/11917141 under the supervision of Dr. Somnath Jha Dept. of Mathematics and Statistics 4th November, 2015 Abstract The Goldbach conjecture is one
More informationThe Prime Number Theorem
The Prime Number Theorem We study the distribution of primes via the function π(x) = the number of primes x 6 5 4 3 2 2 3 4 5 6 7 8 9 0 2 3 4 5 2 It s easier to draw this way: π(x) = the number of primes
More informationOn the low-lying zeros of elliptic curve L-functions
On the low-lying zeros of elliptic curve L-functions Joint Work with Stephan Baier Liangyi Zhao Nanyang Technological University Singapore The zeros of the Riemann zeta function The number of zeros ρ of
More informationAnswer Key 1973 BC 1969 BC 24. A 14. A 24. C 25. A 26. C 27. C 28. D 29. C 30. D 31. C 13. C 12. D 12. E 3. A 32. B 27. E 34. C 14. D 25. B 26.
Answer Key 969 BC 97 BC. C. E. B. D 5. E 6. B 7. D 8. C 9. D. A. B. E. C. D 5. B 6. B 7. B 8. E 9. C. A. B. E. D. C 5. A 6. C 7. C 8. D 9. C. D. C. B. A. D 5. A 6. B 7. D 8. A 9. D. E. D. B. E. E 5. E.
More informationThe Convolution Square Root of 1
The Convolution Square Root of 1 Harold G. Diamond University of Illinois, Urbana. AMS Special Session in Honor of Jeff Vaaler January 12, 2018 0. Sections of the talk 1. 1 1/2, its convolution inverse
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
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 informationBIASES IN PRIME FACTORIZATIONS AND LIOUVILLE FUNCTIONS FOR ARITHMETIC PROGRESSIONS
BIASES IN PRIME FACTORIZATIONS AND LIOUVILLE FUNCTIONS FOR ARITHMETIC PROGRESSIONS PETER HUMPHRIES, SNEHAL M. SHEKATKAR, AND TIAN AN WONG Abstract. We introduce a refinement of the classical Liouville
More informationAVERAGE RECIPROCALS OF THE ORDER OF a MODULO n
AVERAGE RECIPROCALS OF THE ORDER OF a MODULO n KIM, SUNGJIN Abstract Let a > be an integer Denote by l an the multiplicative order of a modulo integers n We prove that l = an Oa ep 2 + o log log, n,n,a=
More informationTwo problems in combinatorial number theory
Two problems in combinatorial number theory Carl Pomerance, Dartmouth College Debrecen, Hungary October, 2010 Our story begins with: Abram S. Besicovitch 1 Besicovitch showed in 1934 that there are primitive
More informationExtension of Summation Formulas involving Stirling series
Etension of Summation Formulas involving Stirling series Raphael Schumacher arxiv:6050904v [mathnt] 6 May 06 Abstract This paper presents a family of rapidly convergent summation formulas for various finite
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 informationPRIMES IN TUPLES I arxiv:math/ v1 [math.nt] 10 Aug 2005
PRIMES IN TUPLES I arxiv:math/050885v [math.nt] 0 Aug 2005 D. A. GOLDSTON, J. PINTZ, AND C. Y. YILDIRIM Abstract. We introduce a method for showing that there exist prime numbers which are very close together.
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 informationProblems for Chapter 3.
Problems for Chapter 3. Let A denote a nonempty set of reals. The complement of A, denoted by A, or A C is the set of all points not in A. We say that belongs to the interior of A, Int A, if there eists
More information1, for s = σ + it where σ, t R and σ > 1
DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,
More informationON THE LOGARITHMIC DERIVATIVES OF DIRICHLET L-FUNCTIONS AT s = 1
ON THE LOGARITHMIC DERIVATIVES OF DIRICHLET L-FUNCTIONS AT s = YASUTAKA IHARA, V. KUMAR MURTY AND MAHORO SHIMURA Abstract. We begin the study of how the values of L (χ, )/L(χ, ) are distributed on the
More informationAn Introduction to the Gamma Function
UNIVERSITY OF WARWICK Second Year Essay An Introduction to the Gamma Function Tutor: Dr. Stefan Adams April 4, 29 Contents 1 Introduction 2 2 Conve Functions 3 3 The Gamma Function 7 4 The Bohr-Möllerup
More informationDan Buchanan. Master of Science. in the. Mathematics Program. YOUNGSTOWN STATE UNIVERSITY May, 2018
Analytic Number Theory and the Prime Number Theorem by Dan Buchanan Submitted in Partial Fulllment of the Requirements for the Degree of Master of Science in the Mathematics Program YOUNGSTOWN STATE UNIVERSITY
More informationTOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne
TOPICS IN NUMBER THEORY - EXERCISE SHEET I École Polytechnique Fédérale de Lausanne Exercise Non-vanishing of Dirichlet L-functions on the line Rs) = ) Let q and let χ be a Dirichlet character modulo q.
More informationThe Average Order of the Dirichlet Series of the gcd-sum Function
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.4. The Average Order of the Dirichlet Series of the gcd-sum Function Kevin A. Broughan University of Waikato Hamilton, New Zealand
More informationPATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationMathematical Tripos Part III Michaelmas 2017 Distribution Theory & Applications, Example sheet 1 (answers) Dr A.C.L. Ashton
Mathematical Tripos Part III Michaelmas 7 Distribution Theory & Applications, Eample sheet (answers) Dr A.C.L. Ashton Comments and corrections to acla@damtp.cam.ac.uk.. Construct a non-zero element of
More informationThe Kernel Function and Applications to the ABC Conjecture
Applied Mathematical Sciences, Vol. 13, 2019, no. 7, 331-338 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2019.9228 The Kernel Function and Applications to the ABC Conjecture Rafael Jakimczuk
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More informationELEMENTARY PROOF OF DIRICHLET THEOREM
ELEMENTARY PROOF OF DIRICHLET THEOREM ZIJIAN WANG Abstract. In this expository paper, we present the Dirichlet Theorem on primes in arithmetic progressions along with an elementary proof. We first show
More informationSolution to Review Problems for Midterm #1
Solution to Review Problems for Midterm # Midterm I: Wednesday, September in class Topics:.,.3 and.-.6 (ecept.3) Office hours before the eam: Monday - and 4-6 p.m., Tuesday - pm and 4-6 pm at UH 080B)
More informationAn Exploration of the Arithmetic Derivative
An Eploration of the Arithmetic Derivative Alaina Sandhu Final Research Report: Summer 006 Under Supervision of: Dr. McCallum, Ben Levitt, Cameron McLeman 1 Introduction The arithmetic derivative is a
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
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 informationSieve weight smoothings and moments
Sieve weight smoothings and moments Andrew Granville, with Dimitris Koukoulopoulos & James Maynard Université de Montréal & UCL Workshop in Number Theory and Function Fields Exeter, Friday, January 21,
More informationProblem Set 9 Solutions
8.4 Problem Set 9 Solutions Total: 4 points Problem : Integrate (a) (b) d. ( 4 + 4)( 4 + 5) d 4. Solution (4 points) (a) We use the method of partial fractions to write A B (C + D) = + +. ( ) ( 4 + 5)
More informationMahler measure as special values of L-functions
Mahler measure as special values of L-functions Matilde N. Laĺın Université de Montréal mlalin@dms.umontreal.ca http://www.dms.umontreal.ca/~mlalin CRM-ISM Colloquium February 4, 2011 Diophantine equations
More information18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions
18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions 1 Dirichlet series The Riemann zeta function ζ is a special example of a type of series we will
More informationExistence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets
Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R
More information7.3 Adding and Subtracting Rational Expressions
7.3 Adding and Subtracting Rational Epressions LEARNING OBJECTIVES. Add and subtract rational epressions with common denominators. 2. Add and subtract rational epressions with unlike denominators. 3. Add
More informationThe zeros of the derivative of the Riemann zeta function near the critical line
arxiv:math/07076v [mathnt] 5 Jan 007 The zeros of the derivative of the Riemann zeta function near the critical line Haseo Ki Department of Mathematics, Yonsei University, Seoul 0 749, Korea haseoyonseiackr
More informationOn the missing values of n! mod p
On the missing values of n! mod p Kevin A. Broughan and A. Ross Barnett University of Waikato, Hamilton, New Zealand Version: 15th Jan 2009 E-mail: kab@waikato.ac.nz, arbus@math.waikato.ac.nz We show that
More informationSome Fun with Divergent Series
Some Fun with Divergent Series 1. Preliminary Results We begin by examining the (divergent) infinite series S 1 = 1 + 2 + 3 + 4 + 5 + 6 + = k=1 k S 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + = k=1 k 2 (i)
More informationEuler s ϕ function. Carl Pomerance Dartmouth College
Euler s ϕ function Carl Pomerance Dartmouth College Euler s ϕ function: ϕ(n) is the number of integers m [1, n] with m coprime to n. Or, it is the order of the unit group of the ring Z/nZ. Euler: If a
More information782: Analytic Number Theory (Instructor s Notes)*
Math 782: Analytic Number Theory Instructor s Notes)* Analytic Versus Elementary: Terminology Analytic Number Theory makes use of Comple Analysis and Elementary Number Theory does not; but it isn t so
More informationOn the Number of Divisors of n 2 1
On the Number of Divisors of n 2 arxiv:507.08893v [math.nt] 30 Jul 205 Adrian W. Dudek Mathematical Sciences Institute The Australian National University adrian.dudek@anu.edu.au Abstract We prove an asymptotic
More informationψ(y + h; q, a) ψ(y; q, a) Λ(n), (1.2) denotes a sum over a set of reduced residues modulo q. We shall assume throughout x 2, 1 q x, 1 h x, (1.
PRIMES IN SHORT SEGMENTS OF ARITHMETIC PROGRESSIONS D. A. Goldston and C. Y. Yıldırım. Introduction In this paper we study the mean suare distribution of primes in short segments of arithmetic progressions.
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationAn arithmetic extension of van der Waerden s theorem on arithmetic progressions
An arithmetic extension of van der Waerden s theorem on arithmetic progressions Kevin A. Broughan University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz A short proof is given of a new
More informationCHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS
Journal of Algebra, Number Theory: Advances and Applications Volume 8, Number -, 0, Pages 4-55 CHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS ADEL ALAHMADI, MICHEL PLANAT and PATRICK SOLÉ 3 MECAA
More informationSOME FORMULAS OF RAMANUJAN INVOLVING BESSEL FUNCTIONS. Henri Cohen
SOME FORMULAS OF RAMANUJAN INVOLVING BESSEL FUNCTIONS by Henri Cohen Abstract. We generalize a number of summation formulas involving the K-Bessel function, due to Ramanujan, Koshliakov, and others. Résumé.
More informationAnalytic Number Theory
University of Cambridge Mathematics Tripos Part III Analytic Number Theory Lent, 209 Lectures by T. F. Bloom Notes by Qiangru Kuang Contents Contents 0 Introduction 2 Elementary techniques 3. Arithmetic
More informationProblem Sheet 1. 1) Use Theorem 1.1 to prove that. 1 p loglogx 1
Problem Sheet ) Use Theorem. to prove that p loglog for all real 3. This is a version of Theorem. with the integer N replaced by the real. Hint Given 3 let N = [], the largest integer. Then, importantly,
More informationMath 259: Introduction to Analytic Number Theory Primes in arithmetic progressions: Dirichlet characters and L-functions
Math 259: Introduction to Analytic Number Theory Primes in arithmetic progressions: Dirichlet characters and L-functions Dirichlet extended Euler s analysis from π(x) to π(x, a mod q) := #{p x : p is a
More informationThe Riemann Hypothesis
The Riemann Hypothesis Matilde N. Laĺın GAME Seminar, Special Series, History of Mathematics University of Alberta mlalin@math.ualberta.ca http://www.math.ualberta.ca/~mlalin March 5, 2008 Matilde N. Laĺın
More informationOn a diophantine inequality involving prime numbers
ACTA ARITHMETICA LXI.3 (992 On a diophantine inequality involving prime numbers by D. I. Tolev (Plovdiv In 952 Piatetski-Shapiro [4] considered the following analogue of the Goldbach Waring problem. Assume
More informationLECTURES ON ANALYTIC NUMBER THEORY
LECTURES ON ANALYTIC NUBER THEORY J. R. QUINE Contents. What is Analytic Number Theory? 2.. Generating functions 2.2. Operations on series 3.3. Some interesting series 5 2. The Zeta Function 6 2.. Some
More informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More informationHarmonic Analysis Homework 5
Harmonic Analysis Homework 5 Bruno Poggi Department of Mathematics, University of Minnesota November 4, 6 Notation Throughout, B, r is the ball of radius r with center in the understood metric space usually
More informationLarge gaps in sets of primes and other sequences II. New bounds for large gaps between primes Random methods and weighted sieves
Large gaps in sets of primes and other sequences II. New bounds for large gaps between primes Random methods and weighted sieves Kevin Ford University of Illinois at Urbana-Champaign May, 2018 Large gaps
More informationSmall gaps between primes
CRM, Université de Montréal Princeton/IAS Number Theory Seminar March 2014 Introduction Question What is lim inf n (p n+1 p n )? In particular, is it finite? Introduction Question What is lim inf n (p
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationOn Integers for Which the Sum of Divisors is the Square of the Squarefree Core
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 15 (01), Article 1.7.5 On Integers for Which the Sum of Divisors is the Square of the Squarefree Core Kevin A. Broughan Department of Mathematics University
More information