A Smorgasbord of Applications of Fourier Analysis to Number Theory
|
|
- Anastasia McLaughlin
- 5 years ago
- Views:
Transcription
1 A Smorgasbord of Applications of Fourier Analysis to Number Theory by Daniel Baczkowski Uniform Distribution modulo Definition. Let {x} denote the fractional part of a real number x. A sequence (u n R is uniformly distributed modulo if # { n N : u n [a, b] } = b a N for every a < b. Let U N be a measure with unit masses at the points u n for n N. Then, Û N (k = N e( ku n where e(θ = e πiθ is the notation attributed to Vinogradov. Theorem. (Weyl s Criterion The following are equivalent:. {u n } is uniformly distributed. For every integer k, ÛN(k = o(n as N 3. If F is properly Riemann-integrable on [, ] then N N F (u n = F (xdx. Sometimes the proof of the first two equivalences is called Weyl s Criterion. The proof can be found in numerous books and, in fact, can be found in Michael Filaseta s class notes for Transcendental number theory which will be offered next semester, Spring 8. Now, the last equivalence follows via a standard measure theory type of argument. Note that second equivalence yields the third for F equal to a characteristic function on an interval. Thus, the same holds for a finite sum of characteristic functions, a simple function. Since the simple functions are dense in L [, ] (hence in C[, ], one can easily deduce that the second and third remarks are equivalent. A pertinent result of Weyl s Criterion is that if θ is irrational, then the sequence (nθ is uniformly distributed modulo. This can be easily seen via the summing of a geometric series and applying the above theorem. Indeed, for every k N e(knθ = e ( k(n + θ e ( kθ e ( kθ e(kθ = O k(. The result and notions above, and those listed below, have been extended to the case of sequences of vectors in R m for any m. In what follows, we will be concerned with just real or complex valued sequences. We now give another consequence of Weyl s Criterion which provides many more examples of sequences which are uniformly distribute mod.
2 Theorem. Let ( f(n be a sequence of real numbers such that f(n = f(n + f(n is monotone as n increases. Also, let f(n = and n f(n =. n n Then, the sequence ( f(n is uniformly distributed mod. For a proof of this result, see []. From this one can easily derive Corollary. (Fejér s Theorem Let f(x be a function defined for x that is differentiable for x x. If f (x tends monotonically to as x and if x x f (x =, then the sequence ( f(n is uniformly distributed mod. Indeed, the mean value theorem shows that for sufficiently large n, f(n satisfies the conditions of the previous theorem. From this particular result, one may show uniform distribution of numerous sequences, for example (i. (αn σ log τ n with α, < σ <, τ arbitrary; (ii. (α log τ n with α, τ > ; (iii. (αn log τ n with α, τ <. In the next section in Theorem 5, we show a generalization of the above corollary and dive deeper into the subject by examining some of the available tools. Exponential Sums To little surprise, the theory of exponential sums began with Gauss. Although, it was Weyl s contributions that later accelerated the development of the subject. These special sums are merely finite Fourier series (i.e. a trigonometric polynomial. Throughout we let P denote a polynomial with real coefficients. The following is a type of exponential sum commonly called a Weyl sum: N e ( P (n. In general, one would take any real valued function f in place of P. In this way, exponential sums form a bridge between complex Fourier Analysis and number theory. One exemplary problem is Waring s problem which asks whether for every natural number n there exists an associated positive integer s such that every natural number is the sum of at most s k th powers of natural numbers (for example, every number is the sum of at most 4 squares, or 9 cubes, or 9 fourth powers, etc.. The affirmative answer, known as the Hilbert-Waring theorem, was provided by Hilbert in 99. Perhaps, Weyl ignited the spark by utilizing exponential sums to answer related questions in number theory. Nevertheless, today it appears that an entire branch of number theory is devoted to this topic alone. Again, the usefulness of Weyl s Criterion continues as one can show that P (n is uniformly distributed modulo if P has at least one irrational coefficient. Before proceeding to some major results in the subject, we introduce the idea of what is sometimes called Weyl differencing. Notice that N e ( P (n = = N m= N h= N+ N e ( P (m P (n = n N h n N N n h= n e ( P (n + h P (n e ( P (n + h P (n = N + R N h= e ( P (n + h P (n where R denotes the real part of a complex number. Notice the reasoning behind the name differencing because if P (x has degree d then P (x + h P (x has degree d. Repeating this differencing procedure
3 d times leaves one with a geometric series which can be easily estimated. In this way, Weyl proved that {P (n} was uniformly distributed modulo. Later van der Corput found a way to improve, or perhaps further the study of, Weyl s differencing. The parameter h above going from to N was somewhat disadvantageous. This was alleviated and moreover generalized in what follows. Theorem 3. (van der Corput Let u,..., u N be complex numbers and H an integer such that H N. Then, N N H u n H(N + H u n + (N + H (H hr u n u n+h Proof. Define u n = for n and n > N. Note that So, the Cauchy-Schwarz inequality yields N H u n (N + H By the note, = (N + H N+ h= H N+ N+ u n h = H N u n = N+ h= u n h. u n h = (N + H h= h= h= N+ r= N+ u n h + (N + H R u n r s= s<r u n s u n r u n s N u n. Lastly, the latter double summation contains terms of the form u n u n+h where n N and h H. Since n is uniquely determined and there exists H h choices for each n, the sum equals N (H h u n u n+h = (H h h= h= u n u n+h. Theorem 4. (van der Corput Let {x n } be a sequence of real numbers. If for every positive integer h the sequence {x n+h x n } is uniformly distributed modulo, then {x n } is uniformly distributed modulo. Proof. For all h, we have that {x n+h x n } is uniformly distributed. Fix a nonzero integer m and let u n = e(mx n. By Theorem 3, for any H N we have that where C = N N e(mx n N + H HN + C h= N h e ( m(x n x n+h (N + H (H h(n h H N. By our hypothesis, we now have that sup Since this holds for every positive integer H, N N N e(mx n H. N e(mx n =. Thus, Weyl s Criterion yields that {x n } is uniformly distributed mod which concludes the theorem. 3
4 Theorem 5. Let k be a positive integer and f(x be a function defined for x which is k times differentiable for x x. If f (k (x tends monotonically to as x and if x x f (k (x =, then the sequence ( f(n is uniformly distributed mod. Proof. We use induction on k. For k =, we use the above theorem of Fejér s. Let f be a function satisfying the conditions of the theorem for k replaced by k +. Assume that statement is true for k. For a positive integer h, set g h (x = f(x + h f(x. Then, g (k h (x = f (k (x + h f (k (x for x x. So, the induction hypothesis yields that ( g h (n is uniformly distributed mod. Applying van der Corput s difference theorem above gives the desired result. In the next section, we will adumbrate one of the key role that exponential sums play in analytic number theory. 3 An Application of Exponential Sum Techniques Conjecture. (the Goldbach conjecture Every even integer 4 is the sum of two primes. Conjecture. (the odd Goldbach conjecture Every odd integer 7 is the sum of three primes. Theorem 6. (Vinogradov Every sufficiently large odd integer is the sum of three primes. Notice that the Goldbach Conjecture states that every even integer 4 can be written as the sum of two primes. This conjecture is stronger than the above theorem. Simply note that if the conjecture were true, then adding three to every even integer represented by two primes yields the theorem. Nevertheless, Goldbach s Conjecture is an arduous, mind-boggling task which still remains open today. But, it was Vinogradov who made significant progress on this open problem by proving the aforementioned theorem. Define r(n to be the number of ways to write n as the sum of three primes. Also, let S n (θ = p n e(pθ where the summation runs over all primes p n. Observe that ( Sn (θ 3 = e ( (p + p + p 3 θ p n p n p 3 n which in turn, as e(nxdx is if n = and for other integers n, gives e( nθ ( S n (θ 3 dθ = p n p n p 3 n e ( (p + p + p 3 nθ dθ = r(n. Thus, we have a nice formula for r(n. We do not wish to rigorously prove the remarkable theorem above, but let us merely shed some light on how the above ideas apply to solving such a problem. The idea of Hardy and Littlewood was to analyze the above integral via cleverly dissecting the interval [, ] into say U n, the union of some very small disjoint intervals, and the rest we call V n. In particular, for every θ V n, and moreover for some integer parameter u Letting θ = a q + ɛ q with gcd(a, q = and ɛ (log n u q n (log n u. I = e( nθ ( S n (θ 3 dθ and I = e( nθ ( S n (θ 3 dθ U n V n clearly r(n = I + I. It can be shown that I n /(log n 3 and I = o ( n /(log n 3. In fact, this establishes Theorem 6. The important tool to bound I is a result from analytic number theory: 4
5 Theorem 7. Let π(n; q, a = #{n x : n is prime, n a (mod q}. If q (log n u and gcd(a, q =, then π(n; q, a = n dt φ(q log t + O( ne c log n ( where c > and φ(q is the number of positive integer q that are relatively prime to q (Euler s phi function. (Note Vinogradov s original proof was more complicated because the uniformity of q was not as large as in the above theorem. Utilizing this fact, one may show that for a q (log n u with gcd(a, q = S n (a/q = µ(q φ(q n dt log t + O( ne c log n where µ( denotes the Möbius function. This follows from breaking the sum S n (a/q into two sums, the first over all p n with p q and the second over all p n with p q. The latter is O(log q which easily gets absorbed into the claimed error term. The first turns out to be = e(ma/q π(n; q, m m q gcd(m,q= in which, upon substitution of the fact in (, the result in ( follows. Next, one notes that S n (a/q + β = n e(jβ [ S n (a/q S n (a/q ]. j= Thus, under the above constraints and for β / one sums by parts, utilizes (, and after one more summation by parts obtains that S n (a/q + β = µ(q φ(q j m e(jβ log j + O( n e c log n. Now, the remainder of the estimation for I is straightforward substitution with careful analysis of the error terms. Much more work is required to prove the desired estimation for I. For an excellent expository of the proof, see [4]. Considerable progress on the odd Goldbach conjecture, the easier case of Goldbach s conjecture, has been made throughout the years. First in 93, assuming the Riemann Hypothesis, Hardy and Littlewood showed that it follows for all sufficiently large integers. Then in 937, as discussed above, Vinogradov removed the dependence on the Riemann Hypothesis, and proved that it is true for all sufficiently large odd integers n (but did not quantify sufficiently large. In 956, Borodzkin found such a bound that worked, namely n Further improvements occurred in 989 when Chen and Wang reduced this bound to 43. Nevertheless, the exponent needs to be reduced dramatically before computers are able to aid in the finitely many cases leftover. References [] C. Caldwell, The Prime Glossary, [] L. Kuipers and H. Niederreiter, Uniform Distribution of Sequencesn, John Wiley and Sons, 974. [3] H. L. Montgomery, Harmonic Analysis as found in Analytic Number Theory, Twentieth century harmonic analysis a celebration (Il Ciocco,, p. 7 93, NATO Sci. Ser. II Math. Phys. Chem., 33, Kluwer Acad. Publ., Dordrecht,. [4] S. Wainger On Vinogradov s estimate of Trigonometric sums and the Goldbach-Vinogradov theorem, Mémoires de la S. M. F., tome 5 (97, p ( 5
Discrepancy and Uniform Distribution. by Daniel Baczkowski
Discrepancy and Uniform Distribution by Daniel Baczkowski A sequence (u n ) R is uniformly distributed mod 1 if lim N # { n N : {u n } [a, b] } N = b a for every 0 a < b 1. Weyl s Criterion says TFAE 1.
More informationOn the Uniform Distribution of Certain Sequences
THE RAANUJAN JOURNAL, 7, 85 92, 2003 c 2003 Kluwer Academic Publishers. anufactured in The Netherlands. On the Uniform Distribution of Certain Sequences. RA URTY murty@mast.queensu.ca Department of athematics,
More informationMath Real Analysis
1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationDecoupling course outline Decoupling theory is a recent development in Fourier analysis with applications in partial differential equations and
Decoupling course outline Decoupling theory is a recent development in Fourier analysis with applications in partial differential equations and analytic number theory. It studies the interference patterns
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationNOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials
NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written
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 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 informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationDIGITAL EXPANSION OF EXPONENTIAL SEQUENCES
DIGITAL EXPASIO OF EXPOETIAL SEQUECES MICHAEL FUCHS Abstract. We consider the q-ary digital expansion of the first terms of an exponential sequence a n. Using a result due to Kiss und Tichy [8], we prove
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationON THE RESIDUE CLASSES OF π(n) MODULO t
ON THE RESIDUE CLASSES OF πn MODULO t Ping Ngai Chung Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts briancpn@mit.edu Shiyu Li 1 Department of Mathematics, University
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 informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More informationTopics in Fourier analysis - Lecture 2.
Topics in Fourier analysis - Lecture 2. Akos Magyar 1 Infinite Fourier series. In this section we develop the basic theory of Fourier series of periodic functions of one variable, but only to the extent
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 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 informationMath 259: Introduction to Analytic Number Theory Exponential sums II: the Kuzmin and Montgomery-Vaughan estimates
Math 59: Introduction to Analytic Number Theory Exponential sums II: the Kuzmin and Montgomery-Vaughan estimates [Blurb on algebraic vs. analytical bounds on exponential sums goes here] While proving that
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 informationVan der Corput sets with respect to compact groups
Van der Corput sets with respect to compact groups Michael Kelly and Thái Hoàng Lê Abstract. We study the notion of van der Corput sets with respect to general compact groups. Mathematics Subject Classification
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 informationOn the discrepancy of circular sequences of reals
On the discrepancy of circular sequences of reals Fan Chung Ron Graham Abstract In this paper we study a refined measure of the discrepancy of sequences of real numbers in [0, ] on a circle C of circumference.
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 informationPOLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS
#A40 INTEGERS 16 (2016) POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS Daniel Baczkowski Department of Mathematics, The University of Findlay, Findlay, Ohio
More informationGoldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai
Goldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai balu@imsc.res.in R. Balasubramanian (IMSc.) Goldbach Conjecture 1 / 22 Goldbach Conjecture:
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 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 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 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 informationResearch Problems in Arithmetic Combinatorics
Research Problems in Arithmetic Combinatorics Ernie Croot July 13, 2006 1. (related to a quesiton of J. Bourgain) Classify all polynomials f(x, y) Z[x, y] which have the following property: There exists
More informationSUMS OF SQUARES WUSHI GOLDRING
SUMS OF SQUARES WUSHI GOLDRING 1. Introduction Here are some opening big questions to think about: Question 1. Which positive integers are sums of two squares? Question 2. Which positive integers are sums
More informationCovering Subsets of the Integers and a Result on Digits of Fibonacci Numbers
University of South Carolina Scholar Commons Theses and Dissertations 2017 Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers Wilson Andrew Harvey University of South Carolina
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 information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationOn distribution functions of ξ(3/2) n mod 1
ACTA ARITHMETICA LXXXI. (997) On distribution functions of ξ(3/2) n mod by Oto Strauch (Bratislava). Preliminary remarks. The question about distribution of (3/2) n mod is most difficult. We present a
More informationBernoulli Numbers and their Applications
Bernoulli Numbers and their Applications James B Silva Abstract The Bernoulli numbers are a set of numbers that were discovered by Jacob Bernoulli (654-75). This set of numbers holds a deep relationship
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationLEBESGUE MEASURE AND L2 SPACE. Contents 1. Measure Spaces 1 2. Lebesgue Integration 2 3. L 2 Space 4 Acknowledgments 9 References 9
LBSGU MASUR AND L2 SPAC. ANNI WANG Abstract. This paper begins with an introduction to measure spaces and the Lebesgue theory of measure and integration. Several important theorems regarding the Lebesgue
More informationCONSECUTIVE PRIMES AND BEATTY SEQUENCES
CONSECUTIVE PRIMES AND BEATTY SEQUENCES WILLIAM D. BANKS AND VICTOR Z. GUO Abstract. Fix irrational numbers α, ˆα > 1 of finite type and real numbers β, ˆβ 0, and let B and ˆB be the Beatty sequences B.=
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationStrictly Positive Definite Functions on the Circle
the Circle Princeton University Missouri State REU 2012 Definition A continuous function f : [0, π] R is said to be positive definite on S 1 if, for every N N and every set of N points x 1,..., x N on
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More informationPERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A42 PERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M Artūras Dubickas Department of Mathematics and Informatics, Vilnius University,
More informationarxiv:math/ v2 [math.gm] 4 Oct 2000
On Partitions of Goldbach s Conjecture arxiv:math/000027v2 [math.gm] 4 Oct 2000 Max See Chin Woon DPMMS, Cambridge University, Cambridge CB2 2BZ, UK WatchMyPrice Technologies, 200 West Evelyn Ave, Suite
More informationSpanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
More informationTopics in Harmonic Analysis Lecture 1: The Fourier transform
Topics in Harmonic Analysis Lecture 1: The Fourier transform Po-Lam Yung The Chinese University of Hong Kong Outline Fourier series on T: L 2 theory Convolutions The Dirichlet and Fejer kernels Pointwise
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 for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationADDITIVE COMBINATORICS: WINTER K. Soundararajan. Typeset by AMS-TEX
ADDITIVE COMBIATORICS: WITER 2007 K. Soundararajan 1 Typeset by AMS-TEX 2 K. SOUDARARAJA Introduction The aim of this course is to study additive problems in number theory. Broadly, given a sufficiently
More informationThe exceptional set in the polynomial Goldbach problem
May 3, 200 2:55 WSPC/INSTRCTION FILE gcremarks-ijnt International Journal of Number Theory c World Scientific Publishing Company The exceptional set in the polynomial Goldbach problem Paul Pollack Mathematics
More informationGeneralizing the Hardy-Littlewood Method for Primes
Generalizing the Hardy-Littlewood Method for Primes Ben Green (reporting on joint work with Terry Tao) Clay Institute/University of Cambridge August 20, 2006 Ben Green (Clay/Cambridge) Generalizing Hardy-Littlewood
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 informationA VERY BRIEF REVIEW OF MEASURE THEORY
A VERY BRIEF REVIEW OF MEASURE THEORY A brief philosophical discussion. Measure theory, as much as any branch of mathematics, is an area where it is important to be acquainted with the basic notions and
More informationArithmetic Functions Evaluated at Factorials!
Arithmetic Functions Evaluated at Factorials! Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive integers n and m for which
More informationMath 117: Continuity of Functions
Math 117: Continuity of Functions John Douglas Moore November 21, 2008 We finally get to the topic of ɛ δ proofs, which in some sense is the goal of the course. It may appear somewhat laborious to use
More informationHARMONIC ANALYSIS TERENCE TAO
HARMONIC ANALYSIS TERENCE TAO Analysis in general tends to revolve around the study of general classes of functions (often real-valued or complex-valued) and operators (which take one or more functions
More informationAPPLICATIONS OF UNIFORM DISTRIBUTION THEORY TO THE RIEMANN ZETA-FUNCTION
t m Mathematical Publications DOI: 0.55/tmmp-05-004 Tatra Mt. Math. Publ. 64 (05), 67 74 APPLICATIONS OF UNIFORM DISTRIBUTION THEORY TO THE RIEMANN ZETA-FUNCTION Selin Selen Özbek Jörn Steuding ABSTRACT.
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationIn Z: x + 3 = 2 3x = 2 x = 1 No solution In Q: 3x = 2 x 2 = 2. x = 2 No solution. In R: x 2 = 2 x = 0 x = ± 2 No solution Z Q.
THE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF MATHEMATICS AND STATISTICS MATH 1141 HIGHER MATHEMATICS 1A ALGEBRA. Section 1: - Complex Numbers. 1. The Number Systems. Let us begin by trying to solve various
More informationMath 231E, Lecture 25. Integral Test and Estimating Sums
Math 23E, Lecture 25. Integral Test and Estimating Sums Integral Test The definition of determining whether the sum n= a n converges is:. Compute the partial sums s n = a k, k= 2. Check that s n is a convergent
More informationA Few Primality Testing Algorithms
A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others
More informationA LeVeque-type lower bound for discrepancy
reprinted from Monte Carlo and Quasi-Monte Carlo Methods 998, H. Niederreiter and J. Spanier, eds., Springer-Verlag, 000, pp. 448-458. A LeVeque-type lower bound for discrepancy Francis Edward Su Department
More informationApplication of Ergodic Theory to Uniform distribution mod 1. Oleg Ivrii
Application of Ergodic Theory to Uniform distribution mod 1 Oleg Ivrii February 13, 2008 Chapter 1 Ergodic Theory 1.1 The Setting Our setting will vary, but (, µ) will be some measure space and T a measure
More informationStatistics in elementary number theory
Statistics in elementary number theory Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA CRM Workshop on Statistics and Number Theory 15 19 September, 2014 In this talk we will consider 4 statistical
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
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 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 informationOn Gelfond s conjecture on the sum-of-digits function
On Gelfond s conjecture on the sum-of-digits function Joël RIVAT work in collaboration with Christian MAUDUIT Institut de Mathématiques de Luminy CNRS-UMR 6206, Aix-Marseille Université, France. rivat@iml.univ-mrs.fr
More information1 Structure of Finite Fields
T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained
More informationTHE SUM OF DIGITS OF PRIMES
THE SUM OF DIGITS OF PRIMES Michael Drmota joint work with Christian Mauduit and Joël Rivat Institute of Discrete Mathematics and Geometry Vienna University of Technology michael.drmota@tuwien.ac.at www.dmg.tuwien.ac.at/drmota/
More informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationON UNIVERSAL SUMS OF POLYGONAL NUMBERS
Sci. China Math. 58(2015), no. 7, 1367 1396. ON UNIVERSAL SUMS OF POLYGONAL NUMBERS Zhi-Wei SUN Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn
More informationAn Approach to Goldbach s Conjecture
An Approach to Goldbach s Conjecture T.O. William-west Abstract This paper attempts to prove Goldbach s conjecture. As its major contribution, an alternative perspective to the proof of Goldbach conjecture
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
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 Riddle of Primes
A talk given at Dalian Univ. of Technology (Nov. 16, 2012) and Nankai University (Dec. 1, 2012) The Riddle of Primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationThe dichotomy between structure and randomness. International Congress of Mathematicians, Aug Terence Tao (UCLA)
The dichotomy between structure and randomness International Congress of Mathematicians, Aug 23 2006 Terence Tao (UCLA) 1 A basic problem that occurs in many areas of analysis, combinatorics, PDE, and
More informationSome problems related to Singer sets
Some problems related to Singer sets Alex Chmelnitzki October 24, 2005 Preface The following article describes some of the work I did in the summer 2005 for Prof. Ben Green, Bristol University. The work
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationMATH 220: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY
MATH 22: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY When discussing separation of variables, we noted that at the last step we need to express the inhomogeneous initial or boundary data as
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
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 informationHOW TO LOOK AT MINKOWSKI S THEOREM
HOW TO LOOK AT MINKOWSKI S THEOREM COSMIN POHOATA Abstract. In this paper we will discuss a few ways of thinking about Minkowski s lattice point theorem. The Minkowski s Lattice Point Theorem essentially
More informationDecoupling Lecture 1
18.118 Decoupling Lecture 1 Instructor: Larry Guth Trans. : Sarah Tammen September 7, 2017 Decoupling theory is a branch of Fourier analysis that is recent in origin and that has many applications to problems
More informationSESHADRI CONSTANTS ON SURFACES
SESHADRI CONSTANTS ON SURFACES KRISHNA HANUMANTHU 1. PRELIMINARIES By a surface, we mean a projective nonsingular variety of dimension over C. A curve C on a surface X is an effective divisor. The group
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 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 informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
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#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:
More informationUniformity of the Möbius function in F q [t]
Uniformity of the Möbius function in F q [t] Thái Hoàng Lê 1 & Pierre-Yves Bienvenu 2 1 University of Mississippi 2 University of Bristol January 13, 2018 Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity
More information