Recent progress in additive prime number theory

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Recent progress in additive prime number theory University of California, Los Angeles Mahler Lecture Series

2 Additive prime number theory Additive prime number theory is the study of additive patterns in the prime numbers 2, 3, 5, 7,.... Examples of additive patterns include twins p, p + 2, arithmetic progressions a, a + r,..., a + (k 1)r, and prime gaps p n+1 p n. Many open problems regarding these patterns still remain, but there has been some recent progress in some directions.

3 Long arithmetic progressions in the primes I ll first discuss a theorem of Ben Green and myself from 2004: Theorem: The primes contain arbitrarily long arithmetic progressions.

4 It was previously established by van der Corput (1929) that the primes contained infinitely many progressions of length three. In 1981, Heath-Brown showed that there are infinitely many progressions of length four, in which three elements are prime and the fourth is an almost prime (the product of at most two primes). The proof of the full theorem combines three separate ingredients: random models for the primes, sieve theory, and.

5 Prime counting heuristics While we are not able to prove everything we would like to in this subject, we do have a rather convincing set of heuristics with which to predict how to count various patterns in the primes. The starting point is the prime number theorem, which asserts that the number of primes less than a large number N is roughly N/ log N. One can interpret this fact probabilistically: if one picks an integer at random between 1 and N, then it has a probability of about 1/ log N of being prime.

6 Cramér s random model Cramér s random model for the primes asserts that the primes behave as if each integer n had an independent probability of 1/ log n of being prime, in the sense that statistics for the primes asymptotically match statistics for this random model. This model turns out to not be totally accurate, but there are some refinements to this model which give quite convincing predictions. We ll illustrate this with a study of the twin prime conjecture: there are infinitely many pairs p, p + 2 of primes that are a distance 2 apart. This ancient conjecture remains open, despite many partial results.

7 A proof of the twin prime conjecture Let N be a large number, and let n be an integer chosen randomly between 1 and N. From the prime number theorem, n and n + 2 each have a probability about 1/ log N of being prime. Assuming that the events n is prime and n + 2 is prime are independent, we conclude that n, n + 2 are simultaneously prime with probability about 1/ log 2 N. In other words, there are about N/ log 2 N twin primes less than N. Letting N we obtain the twin prime conjecture.

8 Correcting the model This argument is incorrect. One reason to see this is that it would also predict an infinite number of consecutive primes n, n + 1, which is false, as all but one of the primes are odd. However, one can correct for this by refining the model. Right now, we are giving each integer n {1,..., N} an equal chance of 1/ log N of being prime. A smarter model would be to give the odd integers a 2/ log N chance of being prime and the even integers a 0 chance of being prime. (This omits the prime 2, but this is negligible in the grand scheme of things.) With this refined model, consecutive primes are ruled out (as they should), and the expected number of twin primes increases from N/ log 2 N to 2N/ log 2 N.

9 The prime tuples conjecture One can refine the model further, by excluding the multiples of 3 from being prime (and increasing the probability of the remaining numbers of being prime from 2/ log N to 3/ log N). This turns out to adjust the expected number of twin primes downward, to 1.5 N log 2 N. Continuing to add information about small moduli, the expected count given by these models continues to change, but can be easily computed to converge to an asymptotic prediction, which in the case of twin primes N turns out to be Π 2, where Π log 2 N 2 is the twin prime constant 1 Π 2 = 2 (1 (p 1) 2 ) p odd prime

10 This is believed to be the correct asymptotic. More generally, there is a similar asymptotic conjectured for other patterns in the primes; this is basically the Hardy-Littlewood prime tuples conjecture. Roughly speaking, it is asserting that the sequence of adjusted Crámer models discussed earlier is asymptotically accurate for describing the primes.

11 One can think of each of these models as identifying a certain amount of structure in the primes, and then saying that all other aspects of the primes are random. For instance, one could observe the structure that the primes have density about 2/ log N in the odd numbers and 1/ log N in the even numbers, but assert that there is no discernible additional structure on top of this.

12 Viewed in this light, the prime tuples conjecture is asserting that apart from the obvious structure that the primes obey (they are almost all coprime to 2, coprime to 3, etc.), there is no additional pattern or structure to this sequence of integers, and they behave as if they were random relative to the structure already identified. However, we are unable at this time to rigorously rule out a bizarre conspiracy among primes to exhibit an additional layer of structure (e.g. to avoid congregating as twins n, n + 2 after a certain point). How does one disprove a conspiracy?

13 Introduction Now we turn from random models to another aspect of prime number theory, namely sieve theory. One way to approach the primes is to start with all the integers in a given range (e.g. from N/2 to N) and then sift out all the non-primes, for instance by removing the multiples of 2, then the multiples of 3, and so forth up to the multiples of N (the sieve of Eratosthenes). One can hope to count, say, twin primes, by keeping track of the number of twins at each stage of the sifting process.

14 For instance, the number of twins n, n + 2 in the entire range [N/2, N] is N/2 + O(1). After removing the multiples of two, the count drops to N/4 + O(1); after removing the multiples of three, it drops further to N/12 + O(1), and so forth. Unfortunately, the O(1) errors multiple rapidly, and overwhelm the main term long before one reaches the level of multiples of N. One can partially address this problem by smoothing the sieve (rather than eliminating numbers outright, adjust their score upward or downward whenever they are divisible or not divisible by certain numbers), but one still cannot get to N by these techniques alone (there is a specific obstruction to this, known as the parity problem).

15 Almost primes Introduction Nevertheless, it is possible to use sieve theory to control things up to some partial height, e.g. up to multiples of N 1/10. The resulting sifted set consists not only of primes, but also contains almost primes - products of a bounded number (e.g. at most ten) of (large) primes. To summarise several decades of work in sieve theory into a single sentence, these methods can establish analogues of conjectures such as the prime tuples conjecture, but with primes replaced by almost primes. For instance, one can find infinitely many twins of almost primes. [I m glossing over the technical issue here of exactly how to define almost prime.]

16 To put it another way, the almost primes do indeed behave like we expect the primes to, namely that they have no structure beyond the obvious ones (like the primes, the almost primes tend to be coprime to 2, coprime to 3, etc.) On the other hand, there are more almost primes than primes; there are about N/ log N primes less than N, but there are about CN/ log N almost primes less than N (where C is a constant that depends on how exactly one defines almost prime ).

17 To summarise so far: we have conjectures about patterns in the primes, but cannot prove them in general. But if we replace primes with the larger set of almost primes, we can then verify the analogous conjectures for almost primes using sieve theory. For a special type of pattern, namely arithmetic progressions, there is an additional powerful tool available, namely.

18 : Any subset of the A integers of positive upper density (which means that #(A [ N,N]) lim sup N 2N+1 > 0) contains arbitrarily long arithmetic progressions. First proven by Szemerédi in Note that this type of result is false for other patterns, such as twins n, n + 2 (e.g. the multiples of 3 have positive density, but no twins). are more indestructible than other patterns.

19 is difficult to prove. There have been many different proofs, each of which has been very significant in stimulating further research, including: Szemerédi s original combinatorial proof using graph theory (1975); Furstenberg s ergodic theory proof (1977); Gowers proof using generalised Fourier analysis and additive combinatorics (2001); The proofs of Gowers, Nagle-Rödl-Schacht-Skokan, and later authors using graph and hypergraph theory ( ); The combinatorial proof of the Polymath1 collaborative project (2009).

20 The proofs are too technical to describe here, but they all share some features in common. Namely, they all have to address the fact that the dense set A of integers could be very structured (e.g. the multiples of four), very random (e.g. a random subset of integers of density 1/4), or a combination of both (e.g. a random subset of the even integers of density 1/2). In each of these cases, arithmetic progressions can be found, but the reason for the progressions is different in different cases. Accordingly, all of the proofs must at some point split A up into structured and random components.

21 Putting it all together shows that sets of positive density have arbitrarily long progressions. It does not directly apply to the primes, because the primes have zero density. However, the primes have positive relative density with respect to the almost primes. And the almost primes behave quite randomly (in particular, they have plenty of progressions). It is possible to combine these facts to show that the primes have arbitrarily long progressions.

22 Very informal sketch of proof If the primes obeyed the (modified) Cramér random model, we would be done. But they could obey some exotic structure not predicted by this model, e.g. they could be unexpectedly dense on some structured set. If this occurs, we adjust the random model to take this additional structure into account. We repeat this process until no significant additional structure is found. We end up with some exotic random model that models the primes. (Showing the process terminates is non-trivial.)

23 On the other hand, the primes are a dense subset of the almost primes, which behave like a random subset of the entire integers. (Here we use a particular notion of the almost primes, studied by Goldston and Yıldırım in their work on prime gaps. Because of this, one can show that the random model for the primes contain a random subset of a dense subset of integers. Dense subsets of the integers contain lots of arithmetic progressions. Many of them will survive the passage to a random subset. Since the model for the primes is accurate, the primes themselves contain lots of arithmetic progressions.

24 An arithmetic progression of a fixed length k is a sequence of numbers n 1, n 1 + n 2, n 1 + 2n 2,..., n 1 + (k 1)n 2 parameterised in a linear fashion by two integer parameters a, r. One can consider more general linear (or affine) patterns c 11 n c 1d n d + c 1,..., c k1 n c kd n d + c k generated by some integer parameters n 1,..., n d, where the c ij and c i are fixed coefficients. One can then ask whether one can find choices of the parameters in which all of the elements in this pattern are prime; one can also ask the more refined question of how many such choices there are in a given range (e.g. with all n 1,..., n d less than a threshold N).

25 Many classical problems in prime number theory can be viewed as special cases of this problem. For instance: The twin prime conjecture corresponds to the pattern n 1, n The even Goldbach conjecture corresponds to the pattern n 1, N n 1, where N is a fixed even number larger than 2. The odd Goldbach conjecture corresponds to the pattern n 1, n 2, N n 1 n 2, where N is a fixed odd number larger than 5.

26 There are some obvious obstructions to solvability of this problem. Obstructions mod p If it is not possible for all of the linear forms to be simultaneously coprime to a given modulus p, then this presents an obvious obstruction to solvability. For instance, at least one of n, n + 1 has to be even, which makes it hard for both to be prime; similarly, at least one of n, n + 2, n + 4 has to be divisible by 3. Obstructions at infinity If the linear forms can be positive only finitely often, then this of course prevents having more than a finite number of solutions.

27 In a series of papers, Ben Green, Tamar Ziegler and I ( ) established the following result: Theorem. If a family of affine-linear forms has no obstructions mod p and at infinity, and any two forms are affinely independent, then the forms can be simultaneously prime infinitely often. Furthermore, the number of solutions obeys the asymptotic predicted by the Hardy-Littlewood prime tuples conjecture. Thus, for instance, there are infinitely many n 1, n 2 such that n 1, n 2, n 1 + n 2 + 1, n 1 + 2n are all prime (i.e. there are infinitely many progressions of length three whose difference is one less than a prime). The theorem also implies our previous result that the primes contained arbitrarily long arithmetic progressions.

28 Unfortunately, the requirement that no two forms are affinely dependent means that the theorem does not apply to classical problems such as the twin prime problem. (A variant of the result can however be used to recover the famous theorem of Vinogradov that the odd Goldbach conjecture is true for sufficiently large odd numbers.) Indeed, our methods fundamentally rely on having at least two free parameters n 1, n 2 to work with; one-parameter problems such as the twin prime or even Goldbach conjecture remain out of reach.

29 The starting point for the arguments is similar to that used to establish long progressions in primes, namely to locate an accurate dense model for the primes. Previously, one used to generate progressions regardless of whether the primes obeyed the Crámer model or some more exotic model. Here, is not available. Instead, we work to eliminate the possibility of an exotic model, leaving only the Crámer model.

30 Dichotomy between structure and randomness The two key steps in the argument (in addition to the fact that the primes have a dense model) are, roughly speaking, as follows: Proposition 1. If a dense set does not have the expected number of patterns of a certain form, then it must be irregularly distributed with respect to some structured set. Proposition 2. The primes (or more precisely, a proxy for the primes known as the Möbius function) is uniformly distributed with respect to every structured set. Combining these facts with some additional arguments, one obtains the theorem.

31 What is structure? Introduction To formalise this approach, one has to define precisely the type of structured sets that block a set from having the expected number of patterns. To given an example, suppose that a set of integers A had an unusual propensity to congregate in the set P of integers with a last digit of 7. Then one would expect A to have an unusually large number of (say) arithmetic progressions n, n + r, n + 2r of length three, since whenever the first two elements of a progression lie in P, the third element does also.

32 More generally, any infinite arithmetic progression P = {n : n = a mod q} can distort the number of progressions of length three in this manner. A little less obviously, a Bohr set such as P = {n : { 2n} 0.1}, where {x} is the fractional part of n, also distorts progressions of length three. This can be explained using the identity 2n 2 2(n + r) + 2(n + 2r) = 0.

33 Even less obviously, for more complicated patterns such as progressions n, n + r, n + 2r, n + 3r of length four, quadratic Bohr sets such as P = {n : { 2n 2 } 0.1} can distort the number of patterns, ultimately because of identities such as 2n 2 3 2(n + r) (n + 2r) 2 2(n + 3r) 2 = 0.

34 It turns out (with a lot of effort, using some technology of Gowers, of Ratner, and of Leibman) that one can completely classify the types of sets that can distort these sots of patterns, in terms of the dynamics of nilmanifolds G/Γ. One can also show (using some powerful technology of Ratner and of Vinogradov) that the primes behave uniformly with respect to these dynamical systems. These are the two major ingredients used to establish the main theorem.

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS. 1. Introduction. The prime numbers 2, 3, 5, 7,... are one of the oldest topics studied in mathematics.

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.. Introduction The prime numbers 2, 3, 5, 7,... are one of the oldest

Structure and randomness in the prime numbers. Science colloquium January 17, A small selection of results in number theory. Terence Tao (UCLA)

Structure and randomness in the prime numbers A small selection of results in number theory Science colloquium January 17, 2007 Terence Tao (UCLA) 1 Prime numbers A prime number is a natural number larger

The minimum number of monochromatic 4-term progressions

The minimum number of monochromatic 4-term progressions Rutgers University May 28, 2009 Monochromatic 3-term progressions Monochromatic 4-term progressions 1 Introduction Monochromatic 3-term progressions

5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

Series. Chapter Convergence of series

Chapter 4 Series Divergent series are the devil, and it is a shame to base on them any demonstration whatsoever. Niels Henrik Abel, 826 This series is divergent, therefore we may be able to do something

ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

The Fundamental Theorem of Arithmetic

MODULE 3 The Fundamental Theorem of Arithmetic 1. Sieve of Eratosthenes Two is the only odd prime. Every even number > 2 is composite because it is divisible by 2. Similarly, all multiples of 3 6 are composite;

Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

Summer High School 2009 Aaron Bertram. 1. Prime Numbers. Let s start with some notation:

Summer High School 2009 Aaron Bertram 1. Prime Numbers. Let s start with some notation: N = {1, 2, 3, 4, 5,...} is the (infinite) set of natural numbers. Z = {..., 3, 2, 1, 0, 1, 2, 3,...} is the set of

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

Faster deterministic integer factorisation

David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 The obvious mathematical breakthrough would be the development of an easy way to factor large prime numbers

S = k=1 k. ( 1) k+1 N S N S N

Alternating Series Last time we talked about convergence of series. Our two most important tests, the integral test and the (limit) comparison test, both required that the terms of the series were (eventually)

COMPOSITES THAT REMAIN COMPOSITE AFTER CHANGING A DIGIT

COMPOSITES THAT REMAIN COMPOSITE AFTER CHANGING A DIGIT Michael Filaseta Mathematics Department University of South Carolina Columbia, SC 2208-0001 Mark Kozek Department of Mathematics Whittier College

The Alternating Series Test

The Alternating Series Test So far we have considered mostly series all of whose terms are positive. If the signs of the terms alternate, then testing convergence is a much simpler matter. On the other

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 20

CS 70 Discrete Mathematics and Probability Theory Fall 009 Satish Rao, David Tse Note 0 Infinity and Countability Consider a function (or mapping) f that maps elements of a set A (called the domain of

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

Introduction to Series and Sequences Math 121 Calculus II D Joyce, Spring 2013

Introduction to Series and Sequences Math Calculus II D Joyce, Spring 03 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial

Sequences with MS

Sequences 2008-2014 with MS 1. [4 marks] Find the value of k if. 2a. [4 marks] The sum of the first 16 terms of an arithmetic sequence is 212 and the fifth term is 8. Find the first term and the common

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

Limits at Infinity Limits at Infinity for Polynomials Limits at Infinity for the Exponential Function Function Dominance More on Asymptotes

Lecture 5 Limits at Infinity and Asymptotes Limits at Infinity Horizontal Asymptotes Limits at Infinity for Polynomials Limit of a Reciprocal Power The End Behavior of a Polynomial Evaluating the Limit

The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

Session 6 Number Theory

Key Terms in This Session Session 6 Number Theory Previously Introduced counting numbers factor factor tree prime number New in This Session composite number greatest common factor least common multiple

Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 1 9/3/2008 PROBABILISTIC MODELS AND PROBABILITY MEASURES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 1 9/3/2008 PROBABILISTIC MODELS AND PROBABILITY MEASURES Contents 1. Probabilistic experiments 2. Sample space 3. Discrete probability

Cylinder Maps and the Schwarzian

Cylinder Maps and the Schwarzian John Milnor Stony Brook University (www.math.sunysb.edu) Bremen June 16, 2008 Cylinder Maps 1 work with Araceli Bonifant Let C denote the cylinder (R/Z) I. (.5, 1) fixed

ARITHMETIC PROGRESSIONS OF FOUR SQUARES

ARITHMETIC PROGRESSIONS OF FOUR SQUARES KEITH CONRAD 1. Introduction Suppose a, b, c, and d are rational numbers such that a 2, b 2, c 2, and d 2 form an arithmetic progression: the differences b 2 a 2,

A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after.

Fibonacci Problem: A farmer raises rabbits. Each rabbit gives birth when 2 months old and then each month there after. Question: How many rabbits will the farmer have after n months? Try it on small numbers.

CMPSCI611: Primality Testing Lecture 14

CMPSCI611: Primality Testing Lecture 14 One of the most important domains for randomized algorithms is number theory, particularly with its applications to cryptography. Today we ll look at one of the

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

Is n a Prime Number? Manindra Agrawal. March 27, 2006, Delft. IIT Kanpur

Is n a Prime Number? Manindra Agrawal IIT Kanpur March 27, 2006, Delft Manindra Agrawal (IIT Kanpur) Is n a Prime Number? March 27, 2006, Delft 1 / 47 Overview 1 The Problem 2 Two Simple, and Slow, Methods

A REVIEW OF PRIME PATTERNS

A REVIEW OF PRIME PATTERNS JAIME SORENSON UNIVERSITY OF ROCHESTER MTH 391W PROFESSOR HAESSIG FALL 008 1 Introduction The first records of studies of prime numbers come from the Ancient Greeks. Euclid proved

PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

CHAPTER III - MARKOV CHAINS

CHAPTER III - MARKOV CHAINS JOSEPH G. CONLON 1. General Theory of Markov Chains We have already discussed the standard random walk on the integers Z. A Markov Chain can be viewed as a generalization of

Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

COMP 250 Fall Mathematical induction Sept. 26, (n 1) + n = n + (n 1)

COMP 50 Fall 016 9 - Mathematical induction Sept 6, 016 You will see many examples in this course and upcoming courses of algorithms for solving various problems It many cases, it will be obvious that

Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

For the purposes of this course, the natural numbers are the positive integers. We denote by N, the set of natural numbers.

Lecture 1: Induction and the Natural numbers Math 1a is a somewhat unusual course. It is a proof-based treatment of Calculus, for all of you who have already demonstrated a strong grounding in Calculus

1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

FACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE. 1. Introduction Recall that a Carmichael number is a composite number n for which

FACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE THOMAS WRIGHT Abstract. In light of the recent work by Maynard and Tao on the Dickson k-tuples conjecture, we show that with a small improvement

Algebraic and Transcendental Numbers

Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

The distribution of the non-prime numbers - A new Sieve -

Text, methods, sieve and algorithms copyright Fabio Giraldo- Franco The distribution of the non-prime numbers - A new Sieve - FABIO GIRALDO-FRANCO and PHIL DYKE 1. Introduction The aim of this work is

Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

Lecture 6: Approximation via LP Rounding

Lecture 6: Approximation via LP Rounding Let G = (V, E) be an (undirected) graph. A subset C V is called a vertex cover for G if for every edge (v i, v j ) E we have v i C or v j C (or both). In other

1 Die hard, once and for all

ENGG 2440A: Discrete Mathematics for Engineers Lecture 4 The Chinese University of Hong Kong, Fall 2014 6 and 7 October 2014 Number theory is the branch of mathematics that studies properties of the integers.

POSITIVE INTEGERS, INTEGERS AND RATIONAL NUMBERS OBTAINED FROM THE AXIOMS OF THE REAL NUMBER SYSTEM

MAT 1011 TECHNICAL ENGLISH I 03.11.2016 Dokuz Eylül University Faculty of Science Department of Mathematics Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web: http://kisi.deu.edu.tr/engin.mermut/

Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

Section 3.3 Equivalence Relations

1 Section 3.3 Purpose of Section To introduce the concept of an equivalence relation and show how it subdivides or partitions a set into distinct categories. Introduction Classifying objects and placing

MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

2 Sequences and Accumulation Points

2 Sequences and Accumulation Points 2.1 Convergent Sequences Formally, a sequence of real numbers is a function ϕ : N R. For instance the function ϕ(n) = 1 n 2 for all n N defines a sequence. It is customary,

7.1 Introduction. CSci 335 Software Design and Analysis III Chapter 7 Sorting. Prof. Stewart Weiss

Chapter 7 Sorting 7.1 Introduction Insertion sort is the sorting algorithm that splits an array into a sorted and an unsorted region, and repeatedly picks the lowest index element of the unsorted region

Oh Yeah? Well, Prove It.

Oh Yeah? Well, Prove It. MT 43A - Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built

In this chapter, we define continuous functions and study their properties.

Chapter 7 Continuous Functions In this chapter, we define continuous functions and study their properties. 7.1. Continuity Continuous functions are functions that take nearby values at nearby points. Definition

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.

The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write

Solving systems of linear equations over finite fields

Solving systems of linear equations over finite fields June 1, 2007 1 Introduction 2 3 4 Basic problem Introduction x 1 + x 2 + x 3 = 1 x 1 + x 2 = 1 x 1 + x 2 + x 4 = 1 x 2 + x 4 = 0 x 1 + x 3 + x 4 =

Primes from the viewpoint of combinatorics

A talk given at Jiangsu Normal University (March 22, 2012) Workshop in Combinatorics and Graph (Changsha, June 10, 2012) The 5th National Conferfence on Combinatorics and Graph theory (Luoyang, July 18,

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

3. Examples of discrete probability spaces.. Here α ( j)

3. EXAMPLES OF DISCRETE PROBABILITY SPACES 13 3. Examples of discrete probability spaces Example 17. Toss n coins. We saw this before, but assumed that the coins are fair. Now we do not. The sample space

New Zealand Mathematical Olympiad Committee Divisibility and Primes Arkadii Slinko 1 Introduction The theory of numbers is devoted to studying the set N = {1, 2, 3, 4, 5, 6,...} of positive integers, also

Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

Second Project for Math 377, fall, 2003

Second Project for Math 377, fall, 003 You get to pick your own project. Several possible topics are described below or you can come up with your own topic (subject to my approval). At most two people

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

Introduction to Stationary Distributions

13 Introduction to Stationary Distributions We first briefly review the classification of states in a Markov chain with a quick example and then begin the discussion of the important notion of stationary

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is:

CONVERGENCE OF FOURIER SERIES 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is: with coefficients given by: a n = 1 π f(x) a 0 2 + a n cos(nx) + b n sin(nx), n 1 f(x) cos(nx)dx

S = {1, 2,..., n}. P (1, 1) P (1, 2)... P (1, n) P (2, 1) P (2, 2)... P (2, n) P = . P (n, 1) P (n, 2)... P (n, n)

last revised: 26 January 2009 1 Markov Chains A Markov chain process is a simple type of stochastic process with many social science applications. We ll start with an abstract description before moving

ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM

Acta Math. Univ. Comenianae Vol. LXXXI, (01), pp. 03 09 03 ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible

Coding Theory. Kenneth H. Rosen, AT&T Laboratories.

5 Coding Theory Author: Kenneth H. Rosen, AT&T Laboratories. Prerequisites: The prerequisites for this chapter are the basics of logic, set theory, number theory, matrices, and probability. (See Sections

FACTORING SPARSE POLYNOMIALS

FACTORING SPARSE POLYNOMIALS Theorem 1 (Schinzel): Let r be a positive integer, and fix non-zero integers a 0,..., a r. Let F (x 1,..., x r ) = a r x r + + a 1 x 1 + a 0. Then there exist finite sets S

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

2 The Euclidean algorithm

2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In