On some lower bounds of some symmetry integrals. Giovanni Coppola Università di Salerno
|
|
- Susanna Lillian Ryan
- 5 years ago
- Views:
Transcription
1 On some lower bounds of some symmetry integrals Giovanni Coppola Università di Salerno 0
2 We give lower bounds of symmetry integrals I f (, h) def = sgn(n x)f(n) 2 dx n x h of arithmetic functions, abbrev. a.f., f : R. (They will be real, now on). This integral gives an idea of the almost all (abbr. a.a.) f symmetry in the short interval (abbr., s.i.) [x h, x+h]; hereon h = o(x), actually h = [ θ ], where we call θ ]0, 1[ the width (not the length, h) of the s.i. Our lower bounds of I f imply lower bounds of J f, say, J f (, h) def = f(n) M f (x, h) 2 dx, x<n x+h the Selberg integral, of the a.f. f : R, where the expected mean-value of the short sum x<n x+h f(n) is [ x d] ( 1 M f (x, h) h x n x ) f(n) = h x d x g(d) now on g := f µ (Möbius function), i.e. f(n) = d ng(d). Taking support of g inside [1, Q], Q small w.r.t. x M f (x, h) h d x g(d) d = h d Q g(d) d. Say, J f has main term M f (x, h), while I f has none. 1
3 The connection between I f & J f can be made explicit: I f (, h) J f (, h) x h<n x M f (x, h) M f (x h, h) 2 dx+ f(n) M f (x h, h) f(x) 2 + f(x h) 2 dx 2 dx+ and we use the modified Vinogradov notation ( ignores arbitrarily small powers ) F(, h) G(, h) def ε > 0 F(, h) ε ε G(, h), to abbreviate f(x) 2 + f(x h) 2 dx, whenever f is essentiallybounded def ε > 0 f(n) ε n ε (abbrev. f 1, esp. divisor function d(n) 1) Leaving + h 3 terms, negligible, from the above I f (, h) J f (, h) + M f (x, h) M f (x h, h) 2 dx whence J f (, h) I f (, h), whenever M f depends weakly on x, here. 2
4 Hence (in good hypotheses on f 1, real) lower b.ds of I f imply lower bounds for J f, here. ow on focus on I f (instead, J f has more calc.s due to main term: above we used only d dx M f(x, h) is small). In particular, we ll treat the case f = d k of the k divisor function, with generating Dirichlet series ζ k (with the Riemann ζ function). However, we first give fairly general results. Introducing the mixed symmetry integral of f, f 1 : R I f,f1 (, h) def = sgn(n x)f(n) sgn(m x)f 1 (m)dx n x h m x h we have, expanding the square, I f f1 = I f 2I f,f1 + I f1 whence (recall I f f1 (, h) 0) (LB) I f (, h) 2I f,f1 (, h) I f1 (, h). This (LB) is true for any couple of real a.f. and gives a non-trivial lower bd, provided I f1 is small. Here f 1 is an auxiliary function (real, 1). 3
5 The main point, here, keeping in mind application to f = d k & auxiliary f 1 := g 1 1, i.e. f 1 (n) = d n d D 1 (f 1 is a kind of restricted divisor function, here) is to define (L := log, with our main variable) a) the level, λ := log Q L, where f = g 1, supp(g) [1, Q] b) the width, θ := log h L (see above), 0 < θ < 1 2 now on c) the auxiliary level δ := log D L, small, see above g 1, f 1 Introducing δ small is to apply (a kind of) Large Sieve inequality (actually, an elementary Lemma, proved through Cauchy inequality for well-spaced Farey fractions). In this way, we get (in suitable hypotheses for f & f 1 ) I f,f1 (, h) hl c, c > 0 suitable and, from this and I f1 small (say, esp., I f1 (, h) L 3, c > 3), the (LB) inequality above gives the required lower bound for I f (whence, for J f ). 4
6 Before to proceed exposing our results, we ll give some motivation for our lower bounds study. First of all, study of the classical Selberg integral, say J = J Λ : 2 J(, h) = J Λ (, h) := Λ(n) h dx x<n x+h (see that here M f = M Λ doesn t depend at all on x!) { von-mangoldt Λ(n) := log p n = p k, p prime, k 1 0 otherwise is wide-spreaded in the literature. Less known (much less!) is I Λ the symmetry integral of the primes: 2 I(, h) = I Λ (, h) := Λ(n)sgn(n x) dx n x h appearing first time in Kaczorowski-Perelli work (90s). They give (see above) a link J Λ I Λ ( easy, hard). As the case f = Λ is hopeless to study (apart from conditional results), then, I (& Salerno) started to study more general I f (its asymptotic, f =divisor function, etc.). Also, I have given upper bounds (with Iwaniec, esp., treating Hecke eigenvalues f = λ) for I f for many a.f. 1. (Turns out that, studying a fixed a.f. f : R, into a.a.s.i., Perron formula lets I f crop out of calculations! For example, I & Laporta found this general property, see Lemma 1 in ote Mat.). 5
7 We give our results : lower bounds for mixed symmetry integrals. (See that the method may be adapted to give asymptotic formulæ for them). Then, if the auxiliary I f1 is small & M f s weakly x dep., get lower bounds (as above) for J f. As usual, α := min n Z α n is the distance to integers. We state (& give an idea of the proof later) our Lemma. Fix ε 0 > 0 small (say, ε 0 < 10 9 ). Let, h, with h and h 1/2 ε 0. Assume g, g 1 : R with 1 g, g 1 1. Then, on defining as above f := g 1, f 1 := g 1 1 and I f,f1 (, h), we have, D, Q 1, D Q, such that DQ 1 ε 0, with log D log h + ε 0 log, +2C I f,f1 (, h) 2Ch 1<l D t l µ(t) t 2 ht l 2h<q D k D l g(q)g 1 (q) + q g 1 (lk) k n D l n k g(ln) n, where (when ) C R can be chosen as any 0 < C < 1. (The second term on right hand side is 0, here.) 6
8 An easy calculation, then, lets us obtain Theorem. Fix width 0 < θ < 1/2, level 0 < λ < 1 and auxiliary level δ > θ, with δ+λ < 1. Let, h, D, Q, with h = [ θ ], D = [ δ ], Q = [ λ ]. Assume g, g 1 and f, f 1 defined as above. Then, B = o(d/h), log B log 1, I f,f1 (, h) 2Ch d B µ(d) d 2 1<m D d h m 2h<q D k D md g(q)g 1 (q) q g 1 (mdk) k + 2C n D md n k where (as ) we can choose any 0 < C < 1. g(mdn) n, (Again, second term on the right will be neglected, if f = d k.) As told before, can adapt to an asymptotic! Here we will not give general lower bounds for I f since we don t have (still) any hypotheses on I f1 (auxiliary integral), to be able to apply (LB) with a non-trivial final lower bound for I f. (In the future, we plan to do it.) 7
9 ow, we give an idea of how to apply it for f = d k. From a kind of flipping in d k (n) = q n d k 1(q): d k (n) = k 1 j=0 q n d (j) k 1 (q), where j = 0,..., k 1, we define d (j) k 1 (q) := d 1 d k 1 d 1 d k 1 =q d 1,...,d j <( h) 1/k 1 and, calling S ± k (x) def = n x h d k (n)sgn(n x) the symmetry sum of f = d k, we get S ± k (x) g(q)χ q (x) q ( h) 1 1 k (here stands for : leave negligible terms) where g(q) := k 1 j=0 d(j) k 1 (q), 1 g(q) 1 and χ q (x) := sgn(n x). n x h n 0(q) (We abbreviate n a(modq) with n a(q), here). 8
10 Then, we may say: d k has level λ = 1 1 k (from flipping). The main point of our general Theorem is to apply the Large Sieve to get I f,f1 (, h) = diagonalterms +, wtih non-diagonal terms ( off the diagonal ). (Here the diagonal terms are of the kind h apart from a factor of logarithms). Then, in order to squeeze out the diagonal, DQh = δ+λ h is smaller than h, say o(h), provided δ + λ < 1. (For technical reasons, δ < θ has to be assumed.) Up to now, general f. In application, since λ = 1 1 k, choose δ = δ k & θ = θ k such that : θ k < δ k < 1/k. Then, we get the (recall L := log, here) Corollary. Fix k 5 integer. Let, h give, say, width θ = θ k, 0 < θ k < 1/k. Then I dk (, h) k hl k 1, J k (, h) k hl k 1. Remark. Here M f = M k : d dx M k(x, h) small J k I dk. (expected, k 3; we ll improve our lower bounds in near future.) 9
11 Here we write I dk on the line: to avoid confusion with 2k th ζ moment, I k (T) def = T 0 ζ( it ) 2k dt which is strictly entangled with J k (, h) (for certain ranges = (T), h = h(t), here). In fact, in a recent work (see Coppola at J k (, h) h I k (T) T, k > 2 last bound the so-called (weak) 2k th moment problem. (See that cases k = 1, 2 are known, with good asymptotics: Ivić, Jutila, Motohashi, etc.). Here, we are giving lower bounds of J k (for k > 2) of the same order of magnitude (with logs) of the diagonal, matching the required upper bound to give non-trivial upper bounds for I k (T), there. (Actually, see that the link wastes arbitrarily small powers.) However, we are showing only one application of our fairly general result. We hope in the future, to cope with the case of other interesting real, essentially bounded arithmetic functions. 10
12 We give our Lemma proof, a sketch (Th.m s immediate). proof. From additive characters orthogonality χ q (x) = r h r x(q) sgn(r) = j<q with finite Fourier coefficients satisfying whence c j,q := 1 q r h sgn(r)e q (rj) c j,q e q (jx) c dj,dq = 1 d c j,q, d, j, q, χ q (x) = l q l>1 l q j l c j,l e l (jx), with c j,q 2 = 2 h q, j<q j<l c j,l 2 = 2 t l µ(t) t 2 ht l. Then I f, f 1 = q (x) q Qg(q)χ g 1 (d)χ d (x)dx = d D 11
13 = g(q)g 1 (q) q D χ 2 q (x)dx+ + d D g 1 (d) q Q q d g(q) t d t>1 t d r t c r,t l q l>1 l q j l c j,l e(αx)dx where α := j l r t gives 0 l = t & j = r (diag.term) ( ) α 0 e(αx)dx 1 α and α 1 DQ, j l r, t D, l Q t i.e., Farey fractions well-spacing property. isolate diagonal terms, re-arrange off-diagonal, use, q > 2h, χ 2 q (x)dx = x h q m x+h q 1 dx = 2h q + O(h), into I f, f 1 = g 1 (q)g(q) 2h<q D χ 2 q (x)dx+ + 1<l D k D l g 1 (lk) k n D l n k g(ln) n j l c j,l
14 + q 2h g(q)g 1 (q) χ 2 q (x)dx +, say, with non-diagonal terms bounded as 1<t D 1<l Q l t r t c r,t 1 c j,l j l r t j l applying Lemma 2 [C-Salerno, AA] to ( ) QD 1<t D h t 1<l Q h l QDh = o(h), and we used j l c j,l 2 j<l c j,l 2 h l together with h l = 1<l Q 1<l 2h O(1) + h 2h<l Q 1 l h. We explicitly remark that there is a kind of waste, in our lower bounds (skip 0 sums), as we are leaving many terms in our previous analysis. However, this begins already with our Theorem and this, in turn, comes already from our Lemma. 13
15 In fact, we leave (see Lemma Proof) one sum over d 2h for the sake of clarity (otherwise, the relative calculations are cumbersome ). Our Lemma, actually, (whence, our Theorem, too) has an asymptotic version (comprising the quoted sum), that allows us to improve our results, even towards an asymptotic formula for the mixed symmetry integrals. We avoid this for the moment, also, because we are much more focused on the Selberg integral lower bounds (from the stated connection, even an asymptotic of the corresponding pure symmetry integral I f doesn t give asymptotics of J f ). (Actually, the real improvement comes from the terms of the Theorem we neglected, where the Möbius function renders more complicated our estimates.) In passing, we note that the Russian school, see Linnik book on Dispersion Method, has found such kind of asymptotic formulæ, even for f = d k, f 1 = d mixed correlations C f,f1 (a) def = n x f(n)f(n + a), a. (See that my work about these correlations allows to write asymptotics for the Selberg & the symmetry mixed integrals, using asymptotics for these correlations, compare my recent paper on arxiv). 14
16 It is a big hope, for our future work, to be able to give lower bounds to much more interesting integrals (maybe the Selberg classical one, too.). 15
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. 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 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 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 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 informationLarge Sieves and Exponential Sums. Liangyi Zhao Thesis Director: Henryk Iwaniec
Large Sieves and Exponential Sums Liangyi Zhao Thesis Director: Henryk Iwaniec The large sieve was first intruded by Yuri Vladimirovich Linnik in 1941 and have been later refined by many, including Rényi,
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 informationAdvanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43
Advanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43 Public One of the more intricate and tricky proofs concerning reformulations of
More informationEstimates for sums over primes
8 Estimates for sums over primes Let 8 Principles of the method S = n N fnλn If f is monotonic, then we can estimate S by using the Prime Number Theorem and integration by parts If f is multiplicative,
More informationPiatetski-Shapiro primes from almost primes
Piatetski-Shapiro primes from almost primes Roger C. Baker Department of Mathematics, Brigham Young University Provo, UT 84602 USA baker@math.byu.edu William D. Banks Department of Mathematics, University
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
More informationON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,
More informationAdvanced Number Theory Note #8: Dirichlet's theorem on primes in arithmetic progressions 29 August 2012 at 19:01
Advanced Number Theory Note #8: Dirichlet's theorem on primes in arithmetic progressions 29 August 2012 at 19:01 Public In this note, which is intended mainly as a technical memo for myself, I give a 'blow-by-blow'
More informationCOMPLEX ANALYSIS in NUMBER THEORY
COMPLEX ANALYSIS in NUMBER THEORY Anatoly A. Karatsuba Steklov Mathematical Institute Russian Academy of Sciences Moscow, Russia CRC Press Boca Raton Ann Arbor London Tokyo Introduction 1 Chapter 1. The
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 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 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 informationON THE DIVISOR FUNCTION IN SHORT INTERVALS
ON THE DIVISOR FUNCTION IN SHORT INTERVALS Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy danilo.bazzanella@polito.it Autor s version Published in Arch. Math. (Basel) 97 (2011),
More informationErgodic aspects of modern dynamics. Prime numbers in two bases
Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373
More informationLes chiffres des nombres premiers. (Digits of prime numbers)
Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet
More informationAnalytic Number Theory
American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction
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 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 information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
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 informationExact formulae for the prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 19, 013, No. 4, 77 85 Exact formulae for the prime counting function Mladen Vassilev Missana 5 V. Hugo Str, 114 Sofia, Bulgaria e-mail: missana@abv.bg
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 informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
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 informationTHE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION. Aleksandar Ivić
THE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION Aleksandar Ivić Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. (2), 4 48. Abstract. The Laplace transform of ζ( 2 +ix) 4 is investigated,
More informationOn the existence of primitive completely normal bases of finite fields
On the existence of primitive completely normal bases of finite fields Theodoulos Garefalakis a, Giorgos Kapetanakis b, a Department of Mathematics and Applied Mathematics, University of Crete, Voutes
More informationA Diophantine Inequality Involving Prime Powers
A Diophantine Inequality Involving Prime Powers A. Kumchev 1 Introduction In 1952 I. I. Piatetski-Shapiro [8] studied the inequality (1.1) p c 1 + p c 2 + + p c s N < ε where c > 1 is not an integer, ε
More informationDistribution of Fourier coefficients of primitive forms
Distribution of Fourier coefficients of primitive forms Jie WU Institut Élie Cartan Nancy CNRS et Nancy-Université, France Clermont-Ferrand, le 25 Juin 2008 2 Presented work [1] E. Kowalski, O. Robert
More informationThe ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.
The ternary May 2013 The ternary : what is it? What was known? Ternary Golbach conjecture (1742), or three-prime problem: Every odd number n 7 is the sum of three primes. (Binary Goldbach conjecture: every
More informationGOLDBACH S PROBLEMS ALEX RICE
GOLDBACH S PROBLEMS ALEX RICE Abstract. These are notes from the UGA Analysis and Arithmetic Combinatorics Learning Seminar from Fall 9, organized by John Doyle, eil Lyall, and Alex Rice. In these notes,
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 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 informationTHE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS
Annales Univ. Sci. Budaest., Sect. Com. 38 202) 57-70 THE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS J.-M. De Koninck Québec,
More informationarxiv: v1 [math.nt] 24 Mar 2009
A NOTE ON THE FOURTH MOMENT OF DIRICHLET L-FUNCTIONS H. M. BUI AND D. R. HEATH-BROWN arxiv:93.48v [math.nt] 4 Mar 9 Abstract. We prove an asymptotic formula for the fourth power mean of Dirichlet L-functions
More informationOn the second smallest prime non-residue
On the second smallest prime non-residue Kevin J. McGown 1 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093 Abstract Let χ be a non-principal Dirichlet
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 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 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 informationEXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER
EXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER KIM, SUNGJIN DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA, LOS ANGELES MATH SCIENCE BUILDING 667A E-MAIL: 70707@GMAILCOM Abstract
More informationA NOTE ON CHARACTER SUMS IN FINITE FIELDS. 1. Introduction
A NOTE ON CHARACTER SUMS IN FINITE FIELDS ABHISHEK BHOWMICK, THÁI HOÀNG LÊ, AND YU-RU LIU Abstract. We prove a character sum estimate in F q[t] and answer a question of Shparlinski. Shparlinski [5] asks
More informationPart 3.3 Differentiation Taylor Polynomials
Part 3.3 Differentiation 3..3.1 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
More informationOn the Largest Integer that is not a Sum of Distinct Positive nth Powers
On the Largest Integer that is not a Sum of Distinct Positive nth Powers arxiv:1610.02439v4 [math.nt] 9 Jul 2017 Doyon Kim Department of Mathematics and Statistics Auburn University Auburn, AL 36849 USA
More informationNormal bases and primitive elements over finite fields
Normal bases and primitive elements over finite fields Giorgos Kapetanakis Department of Mathematics, University of Crete 11th International Conference on Finite Fields and their Applications Giorgos Kapetanakis
More informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationON THE AVERAGE RESULTS BY P. J. STEPHENS, S. LI, AND C. POMERANCE
ON THE AVERAGE RESULTS BY P J STEPHENS, S LI, AND C POMERANCE IM, SUNGJIN Abstract Let a > Denote by l ap the multiplicative order of a modulo p We look for an estimate of sum of lap over primes p on average
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
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 informationI(n) = ( ) f g(n) = d n
9 Arithmetic functions Definition 91 A function f : N C is called an arithmetic function Some examles of arithmetic functions include: 1 the identity function In { 1 if n 1, 0 if n > 1; 2 the constant
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 informationWaring s problem, the declining exchange rate between small powers, and the story of 13,792
Waring s problem, the declining exchange rate between small powers, and the story of 13,792 Trevor D. Wooley University of Bristol Bristol 19/11/2007 Supported in part by a Royal Society Wolfson Research
More informationShort Kloosterman Sums for Polynomials over Finite Fields
Short Kloosterman Sums for Polynomials over Finite Fields William D Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@mathmissouriedu Asma Harcharras Department of Mathematics,
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 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 informationCarmichael numbers with a totient of the form a 2 + nb 2
Carmichael numbers with a totient of the form a 2 + nb 2 William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Abstract Let ϕ be the Euler function.
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationVinogradov s mean value theorem and its associated restriction theory via efficient congruencing.
Vinogradov s mean value theorem and its associated restriction theory via efficient congruencing. Trevor D. Wooley University of Bristol Oxford, 29th September 2014 Oxford, 29th September 2014 1 / 1. Introduction
More informationMaximal Functions in Analysis
Maximal Functions in Analysis Robert Fefferman June, 5 The University of Chicago REU Scribe: Philip Ascher Abstract This will be a self-contained introduction to the theory of maximal functions, which
More information3.5 Efficiency factors
3.5. EFFICIENCY FACTORS 63 3.5 Efficiency factors For comparison we consider a complete-block design where the variance of each response is σ CBD. In such a design, Λ = rj Θ and k = t, so Equation (3.3)
More informationMath 229: Introduction to Analytic Number Theory Čebyšev (and von Mangoldt and Stirling)
ath 9: Introduction to Analytic Number Theory Čebyšev (and von angoldt and Stirling) Before investigating ζ(s) and L(s, χ) as functions of a complex variable, we give another elementary approach to estimating
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More information64 Garunk»stis and Laurin»cikas can not be satised for any polynomial P. S. M. Voronin [10], [12] obtained the functional independence of the Riemann
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 65 (79), 1999, 63 68 ON ONE HILBERT'S PROBLEM FOR THE LERCH ZETA-FUNCTION R. Garunk»stis and A. Laurin»cikas Communicated by Aleksandar Ivić
More informationPARABOLAS INFILTRATING THE FORD CIRCLES SUZANNE C. HUTCHINSON THESIS
PARABOLAS INFILTRATING THE FORD CIRCLES BY SUZANNE C. HUTCHINSON THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Mathematics in the Graduate College of
More informationPreliminary check: are the terms that we are adding up go to zero or not? If not, proceed! If the terms a n are going to zero, pick another test.
Throughout these templates, let series. be a series. We hope to determine the convergence of this Divergence Test: If lim is not zero or does not exist, then the series diverges. Preliminary check: are
More informationarxiv: v1 [math.nt] 31 Dec 2018
POSITIVE PROPORTION OF SORT INTERVALS CONTAINING A PRESCRIBED NUMBER OF PRIMES DANIELE MASTROSTEFANO arxiv:1812.11784v1 [math.nt] 31 Dec 2018 Abstract. We will prove that for every m 0 there exists an
More informationA numerically explicit Burgess inequality and an application to qua
A numerically explicit Burgess inequality and an application to quadratic non-residues Swarthmore College AMS Sectional Meeting Akron, OH October 21, 2012 Squares Consider the sequence Can it contain any
More informationON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE LIANGYI ZHAO INSTITUTIONEN FÖR MATEMATIK KUNGLIGA TEKNISKA HÖGSKOLAN (DEPT. OF MATH., ROYAL INST. OF OF TECH.) STOCKHOLM SWEDEN Dirichlet
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 informationSums of distinct divisors
Oberlin College February 3, 2017 1 / 50 The anatomy of integers 2 / 50 What does it mean to study the anatomy of integers? Some natural problems/goals: Study the prime factors of integers, their size and
More informationZsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1
Zsigmondy s Theorem Lola Thompson Dartmouth College August 11, 2009 Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, 2009 1 / 1 Introduction Definition o(a modp) := the multiplicative order
More informationDiscrete Mathematics CS October 17, 2006
Discrete Mathematics CS 2610 October 17, 2006 Uncountable sets Theorem: The set of real numbers is uncountable. If a subset of a set is uncountable, then the set is uncountable. The cardinality of a subset
More informationSieve theory and small gaps between primes: Introduction
Sieve theory and small gaps between primes: Introduction Andrew V. Sutherland MASSACHUSETTS INSTITUTE OF TECHNOLOGY (on behalf of D.H.J. Polymath) Explicit Methods in Number Theory MATHEMATISCHES FORSCHUNGSINSTITUT
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
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 informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationMath 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications
Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications An elementary and indeed naïve approach to the distribution of primes is the following argument: an
More informationMULTIPLICATIVE FUNCTIONS IN SHORT INTERVALS
MULTIPLICATIVE FUNCTIONS IN SHORT INTERVALS KAISA MATOMÄKI AND MAKSYM RADZIWI L L Abstract. We introduce a general result relating short averages of a multiplicative function to long averages which are
More informationTHE ARITHMETIC OF THE COEFFICIENTS OF HALF INTEGRAL WEIGHT EISENSTEIN SERIES. H(1, n)q n =
THE ARITHMETIC OF THE COEFFICIENTS OF HALF INTEGRAL WEIGHT EISENSTEIN SERIES ANTAL BALOG, WILLIAM J. MCGRAW AND KEN ONO 1. Introduction and Statement of Results If H( n) denotes the Hurwitz-Kronecer class
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
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 informationSYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS
SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite
More informationA Few New Facts about the EKG Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.2 A Few New Facts about the EKG Sequence Piotr Hofman and Marcin Pilipczuk Department of Mathematics, Computer Science and Mechanics
More informationIrrationality exponent and rational approximations with prescribed growth
Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing
More informationMath 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby
Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique
More informationBILINEAR FORMS WITH KLOOSTERMAN SUMS
BILINEAR FORMS WITH KLOOSTERMAN SUMS 1. Introduction For K an arithmetic function α = (α m ) 1, β = (β) 1 it is often useful to estimate bilinear forms of the shape B(K, α, β) = α m β n K(mn). m n complex
More information1 Positive definiteness and semidefiniteness
Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +
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 informationOn primitive elements in finite fields of low characteristic
On primitive elements in finite fields of low characteristic Abhishek Bhowmick Thái Hoàng Lê September 16, 2014 Abstract We discuss the problem of constructing a small subset of a finite field containing
More informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationUniform Distribution of Zeros of Dirichlet Series
Uniform Distribution of Zeros of Dirichlet Series Amir Akbary and M. Ram Murty Abstract We consider a class of Dirichlet series which is more general than the Selberg class. Dirichlet series in this class,
More informationSimultaneous Prime Values of Two Binary Forms
Peter Cho-Ho Lam Department of Mathematics Simon Fraser University chohol@sfu.ca Twin Primes Twin Prime Conjecture There exists infinitely many x such that both x and x + 2 are prime. Question 1 Are there
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 informationTHE SUM OF DIGITS OF n AND n 2
THE SUM OF DIGITS OF n AND n 2 KEVIN G. HARE, SHANTA LAISHRAM, AND THOMAS STOLL Abstract. Let s q (n) denote the sum of the digits in the q-ary expansion of an integer n. In 2005, Melfi examined the structure
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
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 informationSOLUTIONS FOR THE THIRD PROBLEM SET
SOLUTIONS FOR THE THIRD PROBLEM SET. On the handout about continued fractions, one finds a definition of the function f n (x) for n 0 associated to a sequence a 0,a,... We have discussed the functions
More informationBURGESS BOUND FOR CHARACTER SUMS. 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1].
BURGESS BOUND FOR CHARACTER SUMS LIANGYI ZHAO 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1]. We henceforth set (1.1) S χ (N) = χ(n), M
More information