DOCSLIB.ORG

1. Basic Sieve Methods and Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
1. Basic Sieve Methods and Applications SIEVE METHODS LECTURE NOTES, SPRING 2020 KEVIN FORD 1. BASIC SIEVE METHODS AND APPLICATIONS A sieve is a technique for bounding the size of a set after the elements with “undesirable properties” (usually of a number theoretic nature) have been removed. The undesirable properties could be divisibility by a prime from a given set, other multiplicative constraints (divisibility by a perfect square for example) or inclusion in a set of residue classes. Inclusion-exclusion yields an exact formula, however for k properties this produces 2k summands which is usually too much to effectively deal with. A sieve is a procedure to estimate the number of “desirable” elements of the set using kOp1q summands. While inexact, oftentimes the sieve is capable of estimating the size very accurately. The original sieve is, of course, the Sieve of Eratosthenes, the familiar process of creating a table of prime numbers by systematically removing those integers divisible by small primes (but keeping the primes them- selves). The modern sieve was created by Viggo Brun in the period 1915-1922 as a way of attacking famous unsolved problems such as Golbach’s Conjecture and the Twin Prime problem (both, so far, unsuccessfully). Sieve methods have since found enormous application in number theory, often used as tools in many other types of problems, e.g. in studying Diophantine equations. 1.1. Notational conventions. τpnq is the number of positive divisors of n !pnq is the number of distinct prime factors of n Ωpnq is the number of prime factors of n counted with multiplicity µpnq is the Mobius’s¨ function; µpnq “ p´1q!pnq if n is squarefree and µpnq “ 0 otherwise. P `pnq is the largest prime factor of n; P `p1q “ 0 by convention P ´pnq is the smallest prime factor of n; P ´p1q “ 8 by convention Ppzq is the set of positive squarefree integers composed only of primes ¤ z Λpnq denotes the von Mangoldt function 1X is the indicator function of the statement X or of the set X the symbol p, with or without subscripts, always denotes a prime πpx; q; aq is the number of primes p ¤ x in the progression a mod q. P denotes probability and E expectation logk x is the k-th iterate of the logarithm of x 1.2. General sieve setup. A sieve problem A is a probability space pΩ; F; Pq, together with a “total mass” quantity M and events Ap, one for each prime p. The “sifting function” is SpA; zq “ M ¨ Ppnot Ap; @p ¤ zq: Oftentimes Ω will be a finite set of integers, with Ppn P Ωq “ 1{|Ω| for each n P Ω (the uniform probability measure), M “ |Ω| and Ap is the event that p|n, that is, Ap “ tn P Ω: p|nu. This is the standard “small 1 2 KEVIN FORD sieve” problem, where SpA; zq is the number of n P Ω with p - n for all p ¤ z; these are called the “unsifted numbers”. In the above definitions, M can be anything, but in practice it has some arithmetical meaning. Some specific examples: ‚ Eratosthenes sieve for primes. Ω “ r1; xs X , uniform probabilities on Ω, M “ |Ω| “ txu, and ? N ? A “ tn P Ω: p|nu. Then SpA; xq “ πpxq ´ πp xq ` 1, as the unsifted elements are the primes p ? in p x; xs together with the number 1. Twin primes. Ω 1; x , A n Ω: p n n 2 . The unsifted numbers are numbers n ‚ “ r s X N p “ t P | p ` qu ? ? such that npn ` 2q has no prime factor ¤ z. In particular, SpA; x ` 2q counts k P p x ` 2; xs for which both k and k ` 2 are prime. Equivalently, Ap is the set of n that avoid the residue classes 0 mod p and ´2 mod p. ‚ Twin primes, weighted version. Ω “ r2; xs X N, and Λpn ` 2q pn P Ωq “ ;M “ Λpn ` 2q; P M 2¤n¤x ¸ Ap “ tn P Ω: p|nu. Here M “ 2¤n¤x Λpn ` 2q „ x by the Prime Number Theorem, and ? SpA; xq “ ř Λpn ` 2q “ Λpp ` 2q ? 2¤n¤x? xăp¤x P ´p¸nq¡ x ¸ “ logpp ` 2q ` Opx1{2q; ? xăp¤x p`2¸prime the error term coming from terms p ` 2 “ qb where q is prime and b ¥ 2. 1 ‚ Prime tuples. Let a1; ¨ ¨ ¨ ; ak P N and b1; : : : ; bk P Z. Put Ω “ r1; xs X N, and Ap “ tn P Ω: p|pa1n ` b1q ¨ ¨ ¨ pakn ` bkqu: ? For an appropriate c ¡ 0, which depends on a1; a2; : : : ; ak; bk, SpA; c xq counts those n ¤ x for which a1n ` b1; : : : ; akn ` bk are simultaneously prime. ‚ Prime values of a polynomial. Let f : Z Ñ Z be an irreducible polynomial of degree h ¥ 1, put h Ω “ r1; xs X Z, Ap “? tn P Ω: p|fpnqu. Let C be large enough so that |hpnq| ¤ Cn for all n ¥ 1. Then, as before, SpA; Cxhq captures values of n for which fpnq is prime. ‚ Goldbach’s problem. Let N be an even, positive integer,? put Ω “ t1; 2;:::;N?´ 1u, M “ |Ω| “ N ´ 1, and Ap “ tk P Ω: p|kpN ´ kqu. Then S?pA; Nq counts numbers k P p N;Ns for which both k and N ´ k are prime. In particular, SpA; Nq ¡ 0 implies that N is the sum of two primes. If one shows this for all N ¥ 4, one deduces Goldbach’s Conjecture. ‚ Primes in an arithmetic progression. Fix coprime positive integers a and q, let Ω “ t1 ¤ n ¤ x : n ” a pmod qqu; ? ? Ap “ tn P Ω: p|nu. Then SpA; xq captures primes in p x; xs that are in the arithmetic progres- sion a mod q. 1Unless otherwise specified, from now on whenever Ω is a finite set, the probability measure on Ω will be the uniform measure, and M will be the number of elements of Ω. SIEVE METHODS LECTURE NOTES, SPRING 2020 3 ‚ Sums of two squares. Ω “ r1; xs X Z, tn P Ω: pe}n for some odd eu p ” 3 pmod 4q Ap “ #H otherwise. Then SpA; xq counts integers n ¤ x, for which we don’t have pe}n for any prime p ” 3 pmod 4q and odd exponent e. That is, SpA; xq is the number of integers n ¤ x which are the sum of two squares. ‚ Sieve by multiple residue classes. Let M; N be two integers, Ω “ tN ` 1;M ` 2;:::;N ` Mu and for each prime p let Ip be some subset (possibly empty) of the residue classes modulo p. Put Ap “ tn P Ω: n mod p R Ipu: Here SpA; zq counts the integers in pN; M ` Ns avoiding all the residue classes Ip for primes p ¤ z. If |Ip| is bounded or bounded on average, then this is a very general sieving problem of “small sieve” type, whereas if |Ip| is unbounded on average, the problem falls under the umbrella of the “large sieve”. The case of prime values of a polynomial, see above, is a special case with Ip “ tn P Z{pZ : fpnq ” 0 pmod pqu: k k ‚ Multivariate polynomial sieve. Let F pxq : Z Ñ Z be a multivariate polynomial of x “ k px1; : : : ; xkq, take any finite Ω P Z , and Ap “ tx P Ω: p|F pxqu. Then SpA; zq counts x P Ω for which F pxq has no prime factor p ¤ z. ‚ The square-free sieve. Let Ω be a finite set of integers and for each prime p let Ap “ tn P Ω: p2|nu. Then SpA; zq, with an appropriately large z, will count the elements of Ω which are squarefree. A famous application is for squarefree values of a polynomial, e.g. Ω “ tfpnq : 1 ¤ n ¤ xu, where f is an irreducible polynomial. One can similarly set up a k-free sieve problem. ‚ Elliptic curve sieve. Fix and elliptic curve E over Q Let Ω be the set of primes q ¤ x. Let A “ tq P Ω: p|#E{ u, where E{ is the reduction of E modulo q. It is known that #E{ ¤ p ? Fq ? Fq Fq q ` 1 ` 2 q, and thus SpA; 2 xq counts those q for which #E{Fq is prime. If d is a square-free integer composed only of primes in P, define (1.1) Ad “ Ap;Ad “ M ¨ PpAdq: p d £| In particular, A1 “ M. In the case where Ω is a finite set of integers with uniform measure, M “ |Ω|, and Ap “ tn P Ω: p|nu, Ad counts the number of n P Ω divisible by d. In this notation, inclusion-exclusion gives (1.2) SpA; zq “ µpdqAd: P ` d z ¸p q¤ 1.3. Legendre’s sieve for primes (Legendre, 1808). Let Ω “ r1; xs X Z, Ap “ tn P Ω: p|nu. Then SpA; zq counts the positive integers n ¤ x with no prime factor ¤ z; in particular, this includes all of the primes between z and x. Also, for each aquarefree d, Ad “ tn P Ω: d|nu and thus Ad “ |Ad| “ tx{du “ x{d ` Op1q: 4 KEVIN FORD By (1.2), x πpxq ´ πpzq ¤ SpA; zq “ µpdq ` Op1q d P ` d z ¸p q¤ ´ ¯ µpdq “ x ` OpτpP qq d P ` d z ¸p q¤ 1 “ x 1 ´ ` O 2πpzq : p p¤z ¹ ˆ ˙ ´ ¯ Taking z “ log x, and using the crude bound πpzq ¤ z together with Mertens’ bound, we conclude that x x πpxq ¤ z ` e´γ ` op1q ` Op2log xq “ O : log z log x ˆ 2 ˙ ` ˘ Remark: We can do better by observing that in fact Ad “ 0 for d ¡ x (cf.
Load more

Recommended publications
  • [Math.NT] 10 May 2005
    Journal de Th´eorie des Nombres de Bordeaux 00 (XXXX), 000–000 Restriction theory of the Selberg sieve, with applications par Ben GREEN et Terence TAO Resum´ e.´ Le crible de Selberg fournit des majorants pour cer- taines suites arithm´etiques, comme les nombres premiers et les nombres premiers jumeaux. Nous demontrons un th´eor`eme de restriction L2-Lp pour les majorants de ce type. Comme ap- plication imm´ediate, nous consid´erons l’estimation des sommes exponentielles sur les k-uplets premiers. Soient les entiers posi- tifs a1,...,ak et b1,...,bk. Ecrit h(θ) := n∈X e(nθ), ou X est l’ensemble de tous n 6 N tel que tousP les nombres a1n + b1,...,akn+bk sont premiers. Nous obtenons les bornes sup´erieures pour h p T , p > 2, qui sont (en supposant la v´erit´ede la con- k kL ( ) jecture de Hardy et Littlewood sur les k-uplets premiers) d’ordre de magnitude correct. Une autre application est la suivante. En utilisant les th´eor`emes de Chen et de Roth et un «principe de transf´erence », nous demontrons qu’il existe une infinit´ede suites arithm´etiques p1 < p2 < p3 de nombres premiers, telles que cha- cun pi + 2 est premier ou un produit de deux nombres premier. Abstract. The Selberg sieve provides majorants for certain arith- metic sequences, such as the primes and the twin primes. We prove an L2–Lp restriction theorem for majorants of this type. An im- mediate application is to the estimation of exponential sums over prime k-tuples.
    [Show full text]
  • On Sufficient Conditions for the Existence of Twin Values in Sieves
    On Sufficient Conditions for the Existence of Twin Values in Sieves over the Natural Numbers by Luke Szramowski Submitted in Partial Fulfillment of the Requirements For the Degree of Masters of Science in the Mathematics Program Youngstown State University May, 2020 On Sufficient Conditions for the Existence of Twin Values in Sieves over the Natural Numbers Luke Szramowski I hereby release this thesis to the public. I understand that this thesis will be made available from the OhioLINK ETD Center and the Maag Library Circulation Desk for public access. I also authorize the University or other individuals to make copies of this thesis as needed for scholarly research. Signature: Luke Szramowski, Student Date Approvals: Dr. Eric Wingler, Thesis Advisor Date Dr. Thomas Wakefield, Committee Member Date Dr. Thomas Madsen, Committee Member Date Dr. Salvador A. Sanders, Dean of Graduate Studies Date Abstract For many years, a major question in sieve theory has been determining whether or not a sieve produces infinitely many values which are exactly two apart. In this paper, we will discuss a new result in sieve theory, which will give sufficient conditions for the existence of values which are exactly two apart. We will also show a direct application of this theorem on an existing sieve as well as detailing attempts to apply the theorem to the Sieve of Eratosthenes. iii Contents 1 Introduction 1 2 Preliminary Material 1 3 Sieves 5 3.1 The Sieve of Eratosthenes . 5 3.2 The Block Sieve . 9 3.3 The Finite Block Sieve . 12 3.4 The Sieve of Joseph Flavius .
    [Show full text]
  • Sieve 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 OBERWOLFACH July 6, 2015 A quick historical overview pn+m − pn ∆m := lim inf Hm := lim inf (pn+m − pn) n!1 log pn n!1 Twin Prime Conjecture: H1 = 2 Prime Tuples Conjecture: Hm ∼ m log m 1896 Hadamard–Vallee´ Poussin ∆1 ≤ 1 1926 Hardy–Littlewood ∆1 ≤ 2=3 under GRH 1940 Rankin ∆1 ≤ 3=5 under GRH 1940 Erdos˝ ∆1 < 1 1956 Ricci ∆1 ≤ 15=16 1965 Bombieri–Davenport ∆1 ≤ 1=2, ∆m ≤ m − 1=2 ········· 1988 Maier ∆1 < 0:2485. 2005 Goldston-Pintz-Yıldırım ∆1 = 0, ∆m ≤ m − 1, EH ) H1 ≤ 16 2013 Zhang H1 < 70; 000; 000 2013 Polymath 8a H1 ≤ 4680 3 4m 2013 Maynard-Tao H1 ≤ 600, Hm m e , EH ) H1 ≤ 12 3:815m 2014 Polymath 8b H1 ≤ 246, Hm e , GEH ) H1 ≤ 6 H2 ≤ 398; 130, H3 ≤ 24; 797; 814,... The prime number theorem in arithmetic progressions Define the weighted prime counting functions1 X X Θ(x) := log p; Θ(x; q; a) := log p: prime p ≤ x prime p ≤ x p ≡ a mod q Then Θ(x) ∼ x (the prime number theorem), and for a ? q, x Θ(x; q; a) ∼ : φ(q) We are interested in the discrepancy between these two quantities. −x x x Clearly φ(q) ≤ Θ(x; q; a) − φ(q) ≤ q + 1 log x, and for any Q < x, X x X 2x log x x max Θ(x; q; a) − ≤ + x(log x)2: a?q φ(q) q φ(q) q ≤ Q q≤Q 1 P One can also use (x) := n≤x Λ(n), where Λ(n) is the von Mangoldt function.
    [Show full text]
  • Explicit Counting of Ideals and a Brun-Titchmarsh Inequality for The
    EXPLICIT COUNTING OF IDEALS AND A BRUN-TITCHMARSH INEQUALITY FOR THE CHEBOTAREV DENSITY THEOREM KORNEEL DEBAENE Abstract. We prove a bound on the number of primes with a given split- ting behaviour in a given field extension. This bound generalises the Brun- Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an application of Selberg’s Sieve in number fields. The main new ingredient is an explicit counting result estimating the number of integral elements with certain properties up to multiplication by units. As a conse- quence of this result, we deduce an explicit estimate for the number of ideals of norm up to x. 1. Introduction and statement of results Let q and a be coprime integers, and let π(x,q,a) be the number of primes not exceeding x which are congruent to a mod q. It is well known that for fixed q, π(x,q,a) 1 lim = . x→∞ π(x) φ(q) A major drawback of this result is the lack of an effective error term, and hence the impossibility to let q tend to infinity with x. The Brun-Titchmarsh inequality remedies the situation, if one is willing to accept a less precise relation in return for an effective range of q. It states that 2 x π(x,q,a) , for any x q. ≤ φ(q) log x/q ≥ While originally proven with 2 + ε in place of 2, the above formulation was proven by Montgomery and Vaughan [16] in 1973. Further improvement on this constant seems out of reach, indeed, if one could prove that the inequality holds with 2 δ arXiv:1611.10103v2 [math.NT] 9 Mar 2017 in place of 2, for any positive δ, one could deduce from this that there are no Siegel− 1 zeros.
    [Show full text]
  • An Introduction to Sieve Methods and Their Applications Alina Carmen Cojocaru , M
    Cambridge University Press 978-0-521-84816-9 — An Introduction to Sieve Methods and Their Applications Alina Carmen Cojocaru , M. Ram Murty Frontmatter More Information An Introduction to Sieve Methods and Their Applications © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-84816-9 — An Introduction to Sieve Methods and Their Applications Alina Carmen Cojocaru , M. Ram Murty Frontmatter More Information LONDON MATHEMATICAL SOCIETY STUDENT TEXTS Managing editor: Professor J. W. Bruce, Department of Mathematics, University of Hull, UK 3 Local fields, J. W. S. CASSELS 4 An introduction to twistor theory: Second edition, S. A. HUGGETT & K. P. TOD 5 Introduction to general relativity, L. P. HUGHSTON & K. P. TOD 8 Summing and nuclear norms in Banach space theory, G. J. O. JAMESON 9 Automorphisms of surfaces after Nielsen and Thurston, A. CASSON & S. BLEILER 11 Spacetime and singularities, G. NABER 12 Undergraduate algebraic geometry, MILES REID 13 An introduction to Hankel operators, J. R. PARTINGTON 15 Presentations of groups: Second edition, D. L. JOHNSON 17 Aspects of quantum field theory in curved spacetime, S. A. FULLING 18 Braids and coverings: selected topics, VAGN LUNDSGAARD HANSEN 20 Communication theory, C. M. GOLDIE & R. G. E. PINCH 21 Representations of finite groups of Lie type, FRANCOIS DIGNE & JEAN MICHEL 22 Designs, graphs, codes, and their links, P. J. CAMERON & J. H. VAN LINT 23 Complex algebraic curves, FRANCES KIRWAN 24 Lectures on elliptic curves, J. W. S CASSELS 26 An introduction to the theory of L-functions and Eisenstein series, H. HIDA 27 Hilbert Space: compact operators and the trace theorem, J.
    [Show full text]
  • A Friendly Intro to Sieves with a Look Towards Recent Progress on the Twin Primes Conjecture
    A FRIENDLY INTRO TO SIEVES WITH A LOOK TOWARDS RECENT PROGRESS ON THE TWIN PRIMES CONJECTURE DAVID LOWRY-DUDA This is an extension and background to a talk I gave on 9 October 2013 to the Brown Graduate Student Seminar, called `A friendly intro to sieves with a look towards recent progress on the twin primes conjecture.' During the talk, I mention several sieves, some with a lot of detail and some with very little detail. I also discuss several results and built upon many sources. I'll provide missing details and/or sources for additional reading here. Furthermore, I like this talk, so I think it's worth preserving. 1. Introduction We talk about sieves and primes. Long, long ago, Euclid famously proved the in- finitude of primes (≈ 300 B.C.). Although he didn't show it, the stronger statement that the sum of the reciprocals of the primes diverges is true: X 1 ! 1; p p where the sum is over primes. Proof. Suppose that the sum converged. Then there is some k such that 1 X 1 1 < : pi 2 i=k+1 Qk Suppose that Q := i=1 pi is the product of the primes up to pk. Then the integers 1 + Qn are relatively prime to the primes in Q, and so are only made up of the primes pk+1;:::. This means that 1 !t X 1 X X 1 ≤ < 2; 1 + Qn pi n=1 t≥0 i>k where the first inequality is true since all the terms on the left appear in the middle (think prime factorizations and the distributive law), and the second inequality is true because it's bounded by the geometric series with ratio 1=2.
    [Show full text]
  • Which Polynomials Represent Infinitely Many Primes?
    Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 1 (2018), pp. 161-180 © Research India Publications http://www.ripublication.com/gjpam.htm Which polynomials represent infinitely many primes? Feng Sui Liu Department of Mathematics, NanChang University, NanChang, China. Abstract In this paper a new arithmetical model has been found by extending both basic operations + and × into finite sets of natural numbers. In this model we invent a recursive algorithm on sets of natural numbers to reformulate Eratosthene’s sieve. By this algorithm we obtain a recursive sequence of sets, which converges to the set of all natural numbers x such that x2 + 1 is prime. The corresponding cardinal sequence is strictly increasing. Test that the cardinal function is continuous with respect to an order topology, we immediately prove that there are infinitely many natural numbers x such that x2 + 1 is prime. Based on the reasoning paradigm above we further prove a general result: if an integer valued polynomial of degree k represents at least k +1 positive primes, then this polynomial represents infinitely many primes. AMS subject classification: Primary 11N32; Secondary 11N35, 11U09,11Y16, 11B37. Keywords: primes in polynomial, twin primes, arithmetical model, recursive sieve method, limit of sequence of sets, Ross-Littwood paradox, parity problem. 1. Introduction Whether an integer valued polynomial represents infinitely many primes or not, this is an intriguing question. Except some obvious exceptions one conjectured that the answer is yes. Example 1.1. Bouniakowsky [2], Schinzel [35], Bateman and Horn [1]. In this paper a recursive algorithm or sieve method adds some exotic structures to the sets of natural numbers, which allow us to answer the question: which polynomials represent infinitely many primes? 2 Feng Sui Liu In 1837, G.L.
    [Show full text]
  • There Are Infinitely Many Mersenne Primes
    Scan to know paper details and author's profile There are Infinitely Many Mersenne Primes Fengsui Liu ZheJiang University Alumnus ABSTRACT From the entire set of natural numbers successively deleting the residue class 0 mod a prime, we retain this prime and possibly delete another one prime retained. Then we invent a recursive sieve method for exponents of Mersenne primes. This is a novel algorithm on sets of natural numbers. The algorithm mechanically yields a sequence of sets of exponents of almost Mersenne primes, which converge to the set of exponents of all Mersenne primes. The corresponding cardinal sequence is strictly increasing. We capture a particular order topological structure of the set of exponents of all Mersenne primes. The existing theory of this structure allows us to prove that the set of exponents of all Mersenne primes is an infnite set . Keywords and phrases: Mersenne prime conjecture, modulo algorithm, recursive sieve method, limit of sequence of sets. Classification: FOR Code: 010299 Language: English LJP Copyright ID: 925622 Print ISSN: 2631-8490 Online ISSN: 2631-8504 London Journal of Research in Science: Natural and Formal 465U Volume 20 | Issue 3 | Compilation 1.0 © 2020. Fengsui Liu. This is a research/review paper, distributed under the terms of the Creative Commons Attribution-Noncom-mercial 4.0 Unported License http://creativecommons.org/licenses/by-nc/4.0/), permitting all noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited. There are Infinitely Many Mersenne Primes Fengsui Liu ____________________________________________ ABSTRACT From the entire set of natural numbers successively deleting the residue class 0 mod a prime, we retain this prime and possibly delete another one prime retained.
    [Show full text]
  • Eureka Issue 61
    Eureka 61 A Journal of The Archimedeans Cambridge University Mathematical Society Editors: Philipp Legner and Anja Komatar © The Archimedeans (see page 94 for details) Do not copy or reprint any parts without permission. October 2011 Editorial Eureka Reinvented… efore reading any part of this issue of Eureka, you will have noticed The Team two big changes we have made: Eureka is now published in full col- our, and printed on a larger paper size than usual. We felt that, with Philipp Legner Design and Bthe internet being an increasingly large resource for mathematical articles of Illustrations all kinds, it was necessary to offer something new and exciting to keep Eu- reka as successful as it has been in the past. We moved away from the classic Anja Komatar Submissions LATEX-look, which is so common in the scientific community, to a modern, more engaging, and more entertaining design, while being conscious not to Sean Moss lose any of the mathematical clarity and rigour. Corporate Ben Millwood To make full use of the new design possibilities, many of this issue’s articles Publicity are based around mathematical images: from fractal modelling in financial Lu Zou markets (page 14) to computer rendered pictures (page 38) and mathemati- Subscriptions cal origami (page 20). The Showroom (page 46) uncovers the fundamental role pictures have in mathematics, including patterns, graphs, functions and fractals. This issue includes a wide variety of mathematical articles, problems and puzzles, diagrams, movie and book reviews. Some are more entertaining, such as Bayesian Bets (page 10), some are more technical, such as Impossible Integrals (page 80), or more philosophical, such as How to teach Physics to Mathematicians (page 42).
    [Show full text]
  • Every Sufficiently Large Even Number Is the Sum of Two Primes
    EVERY SUFFICIENTLY LARGE EVEN NUMBER IS THE SUM OF TWO PRIMES Ricardo G. Barca Abstract The binary Goldbach conjecture asserts that every even integer greater than 4 is the sum of two primes. In this 2 paper, we prove that there exists an integer Kα such that every even integer x>pk can be expressed as the sum of two primes, where pk is the kth prime number and k > Kα. To prove this statement, we begin by introducing a type of double sieve of Eratosthenes as follows. Given a positive even integer x> 4, we sift from [1,x] all those elements that are congruents to 0 modulo p or congruents to x modulo p, where p is a prime less than √x. Therefore, any integer in the interval [√x,x] that remains unsifted is a prime q for which either x q = 1 or x q is also a prime. − − Then, we introduce a new way of formulating a sieve, which we call the sequence of k-tuples of remainders. By means of this tool, we prove that there exists an integer Kα > 5 such that pk/2 is a lower bound for the sifting 2 2 function of this sieve, for every even number x that satisfies pk <x<pk+1, where k > Kα, which implies that 2 x>pk (k > Kα) can be expressed as the sum of two primes. 1 Introduction 1.1 The sieve method and the Goldbach problem In 1742, Goldbach wrote a letter to his friend Euler telling about a conjecture involving prime numbers.
    [Show full text]
  • New Developments on the Twin Prime Problem and Generalizations M
    New developments on the twin prime problem and generalizations M. Ram Murty To cite this version: M. Ram Murty. New developments on the twin prime problem and generalizations. Hardy-Ramanujan Journal, Hardy-Ramanujan Society, 2014, 37, pp.13-19. hal-01128610 HAL Id: hal-01128610 https://hal.archives-ouvertes.fr/hal-01128610 Submitted on 10 Mar 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Hardy-Ramanujan Journal 37 (2014), 13-19 submitted 09/12/2014, accepted 15/12/2014, revised 17/12/2014 New developments on the twin prime problem and generalizations M. Ram Murty Abstract. We give a short survey of some recent remarkable advances on the twin prime problem. Beginning with the breakthrough work of Zhang in May 2013, we trace the developments culminating in the work of Maynard and Tao in November 2013 that led to simplifications and numerical improvements of Zhang's work. Keywords. sieve theory, twin primes, level of distribution 2010 Mathematics Subject Classification. 11N35, 11N36, 11N05 The year 2013 saw two major breakthroughs regarding the twin prime problem in the field of analytic number theory. The first took place in April and the second in October and November.
    [Show full text]
  • Math.NT] 29 Oct 2006 N H Ogunersrcin R Hsns Httoeint Primes
    THE PRINCIPLE OF THE LARGE SIEVE E. KOWALSKI Pour les soixantes ans de J-M. Deshouillers Abstract. We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function fields. The general framework sug- gests new applications. We give some first results on the number of prime divisors of “most” elements of an elliptic divisibility sequence, and we develop in some detail “probabilistic” sieves for random walks on arithmetic groups, e.g., estimating the probability of finding a reducible characteristic polynomial at some step of a random walk on SL(n, Z). In addition to the sieve principle, the applications depend on bounds for a large sieve constant. To prove such bounds involves a variety of deep results, including Property (τ) or expanding properties of Cayley graphs, and the Riemann Hypothesis over finite fields. Contents 1. Introduction 1 2. The principle of the large sieve 5 3. The “dual” sieve 12 4. Group and conjugacy sieves 13 5. Elementary and classical examples 16 6. Coset sieves 21 7. Degrees and sums of degrees of representations of finite groups 25 8. Probabilistic sieves 33 9. Sieving in arithmetic groups 36 10. The elliptic sieve 48 11. Sieving for Frobenius over finite fields 51 Appendix A: small sieves 58 Appendix B: local density computations over finite fields 61 References 64 1. Introduction Classical sieve theory is concerned with the problem of the asymptotic evaluation of averages arXiv:math/0610021v3 [math.NT] 29 Oct 2006 of arithmetic functions over integers constrained by congruence restrictions modulo a set of primes.
    [Show full text]