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 fork properties this produces2 k summands which is usually too much to effectively deal with. A sieve is a procedure to O 1 estimate the number of “desirable” elements of the set usingk p q 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.τ n is the number of positive divisors ofn p q ω n is the number of distinct prime factors ofn p q Ω n is the number of prime factors ofn counted with multiplicity p q µ n is the Mobius’s¨ function;µ n 1 ω n ifn is squarefree andµ n 0 otherwise. p q p q “ p´ q p q p q “ P n is the largest prime factor ofn;P 1 0 by convention `p q `p q “ P n is the smallest prime factor ofn;P 1 by convention ´p q ´p q “ 8 P z is the set of positive squarefree integers composed only of primes z p q ď Λ n denotes the von Mangoldt function p q � n is the indicator function of the statementX or of the setX X p q the symbolp, with or without subscripts, always denotes a prime π x;q,a is the number of primesp x in the progressiona modq. p q ď P denotes probability andE expectation general 1.2. General sieve setup.A sieve problem is a probability space Ω, ,P , together with a “total mass” A p F q quantityM and events , one for each primep. The “sifting function” is A p S , z M P not p, p z . pA q“ ¨ p 1 A @ ď q 2 KEVIN FORD OftentimesΩ will be afinite set of integers, withP n Ω 1 Ω for eachn Ω (the uniform probability p P q “ {| | P measure),M Ω and p is the event thatp n, that is, p n Ω:p n . This is the standard “small “| | A | A “ t P | u sieve” problem, whereS , z is the number ofn Ω withp�n for allp z; these are called the “unsifted pA q P ď numbers”. In the above definitions,M can be anything, but in practice it has some arithmetical meaning. Some specific examples: Eratosthenes sieve for primes.Ω 1, x N, uniform probabilities onΩ,M Ω txu, and ‚ “r s X “| | “ p n Ω:p n . ThenS , ?x π x π ?x 1, as the unsifted elements are the primes A “ t P | u pA q “ p q ´ p q ` in ?x, x together with the number 1. p s Twin primes.Ω 1, x N, p n Ω:p n n 2 . The unsifted numbers are numbersn ‚ “r s X A “ t P | p ` qu such thatn n 2 has no prime factor z. In particular,S , ?x 2 countsk ?x 2, x p ` q ď pA ` q Pp ` s for which bothk andk 2 are prime. ` Equivalently, p is the set ofn that avoid the residue classes 0 modp and 2 modp. A ´ Twin primes, weighted version.Ω 2, x N, and ‚ “r s X Λ n 2 P n Ω p ` q ,M Λ n 2 , M p P q “ “ 2 n x p ` q ďÿď p n Ω:p n . HereM 2 n x Λ n 2 x by the Prime Number Theorem, and A “ t P | u “ ď ď p ` q „ S , ?x ř Λ n 2 Λ p 2 pA q “ p ` q “ p ` q 2 n x ?x p x P ďÿn ď?x ÿă ď ´p qą 1 2 log p 2 O x { , “ p ` q ` p q ?x p x p 2ÿă primeď ` the error term coming from termsp 2 q b whereq is prime andb 2. ` “ ě 1 Prime tuples. Leta 1, ,a k N andb 1, . , bk Z. PutΩ 1, x N, and ‚ ¨¨¨ P P “r s X p n Ω:p a 1n b 1 a n b . A “ t P |p ` q ¨ ¨ ¨ p k ` kqu For an appropriatec 0, which depends ona 1, a2, . , a , b ,S , c ?x counts thosen x for ą k k pA q ď whicha 1n b 1, . , a n b are simultaneously prime. ` k ` k Prime values of a polynomial. Letf:Z Z be an irreducible polynomial of degreeh 1, put ‚ Ñ hě Ω 1, x Z, p n Ω:p f n . LetC be large enough so that h n Cn for alln 1. “r s X A “ t P | p qu | p q|ď ě Then, as before,S , ?Cxh captures values ofn for whichf n is prime. pA q p q Goldbach’s problem. LetN be an even, positive integer, putΩ 1,2,...,N 1 ,M Ω ‚ “t ´ u “| | “ N 1, and p k Ω:p k N k . ThenS , ?N counts numbersk ?N,N for which ´ A “ t P | p ´ qu pA q Pp s bothk andN k are prime. In particular,S , ?N 0 implies thatN is the sum of two primes. ´ pA qą If one shows this for allN 4, one deduces Goldbach’s Conjecture. ě 1Unless otherwise specified, from now on wheneverΩ is afinite set, the probability measure onΩ will be the uniform measure, andM will be the number of elements ofΩ. SIEVE METHODS LECTURE NOTES, SPRING 2020 3 Primes in an arithmetic progression. Fix coprime positive integersa andq, let ‚ Ω 1 n x:n a modq , “t ď ď ” p qu p n Ω:p n . ThenS , ?x captures primes in ?x, x that are in the arithmetic progres- A “ t P | u pA q p s siona modq. Sums of two squares.Ω 1, x Z, ‚ “r s X n Ω:p e n for some odde p 3 mod 4 p t P } u ” p q A “ otherwise. #H ThenS , x counts integersn x, for which we don’t havep e n for any primep 3 mod 4 pA q ď } ” p q and odd exponente. That is,S , x is the number of integersn x which are the sum of two pA q ď squares. Sieve by multiple residue classes. LetM,N be two integers,Ω N 1,M 2,...,N M ‚ “t ` ` ` u and for each primep let be some subset (possibly empty) of the residue classes modulop. Put I p p n Ω:n modp p . A “ t P RI u HereS , z counts the integers in N, M N avoiding all the residue classes p for primes pA q p ` s I p z. If p is bounded or bounded on average, then this is a very general sieving problem of ď |I | “small sieve” type, whereas if p is unbounded on average, the problem falls under the umbrella |I | of the “large sieve”. The case of prime values of a polynomial, see above, is a special case with p n Z pZ:f n 0 modp . I “ t P { p q ” p qu Multivariate polynomial sieve. LetF x :Z k Z k be a multivariate polynomial ofx ‚ k p q Ñ “ x1, . , xk , take anyfiniteΩ Z , and p x Ω:p F x . ThenS , z countsx Ω for p q P A “ t P | p qu pA q P whichF x has no prime factorp z. p q ď The square-free sieve. LetΩ be afinite set of integers and for each primep let p n ‚ A “ t P Ω:p 2 n . ThenS , z , with an appropriately largez, will count the elements ofΩ which are | u pA q squarefree. A famous application is for squarefree values of a polynomial, e.g.Ω f n :1 “t p q ď n x , wheref is an irreducible polynomial. ď u One can similarly set up ak-free sieve problem. Elliptic curve sieve. Fix and elliptic curveE overQ LetΩ be the set of primesq x. Let ‚ ď p q Ω:p #E F q , whereE F q is the reduction ofE moduloq. It is known that#E F q A “ t P | { u { { ď q 1 2 ?q, and thusS ,2 ?x counts thoseq for which#E F q is prime. ` ` pA q { Ifd is a square-free integer composed only of primes in , define P Ad (1.1) d p,Ad M P d . A “ A “ ¨ pA q p d č| In particular,A 1 M. In the case whereΩ is afinite set of integers with uniform measure,M Ω , and “ “| | p n Ω:p n ,A counts the number ofn Ω divisible byd. A “ t P | u d P 4 KEVIN FORD In this notation, inclusion-exclusion gives IE (1.2) S , z µ d A .
Load more

Recommended publications
  • An Amazing Prime Heuristic.Pdf
    This document has been moved to https://arxiv.org/abs/2103.04483 Please use that version instead. AN AMAZING PRIME HEURISTIC CHRIS K. CALDWELL 1. Introduction The record for the largest known twin prime is constantly changing. For example, in October of 2000, David Underbakke found the record primes: 83475759 264955 1: · The very next day Giovanni La Barbera found the new record primes: 1693965 266443 1: · The fact that the size of these records are close is no coincidence! Before we seek a record like this, we usually try to estimate how long the search might take, and use this information to determine our search parameters. To do this we need to know how common twin primes are. It has been conjectured that the number of twin primes less than or equal to N is asymptotic to N dx 2C2N 2C2 2 2 Z2 (log x) ∼ (log N) where C2, called the twin prime constant, is approximately 0:6601618. Using this we can estimate how many numbers we will need to try before we find a prime. In the case of Underbakke and La Barbera, they were both using the same sieving software (NewPGen1 by Paul Jobling) and the same primality proving software (Proth.exe2 by Yves Gallot) on similar hardware{so of course they choose similar ranges to search. But where does this conjecture come from? In this chapter we will discuss a general method to form conjectures similar to the twin prime conjecture above. We will then apply it to a number of different forms of primes such as Sophie Germain primes, primes in arithmetic progressions, primorial primes and even the Goldbach conjecture.
    [Show full text]
  • [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]
  • Prime Numbers in Logarithmic Intervals
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PORTO Publications Open Repository TOrino Prime numbers in logarithmic intervals Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy [email protected] Alessandro Languasco Dipartimento di Matematica Pura e Applicata Universit`adi Padova , Italy [email protected] Alessandro Zaccagnini Dipartimento di Matematica Universit`adi Parma, Italy [email protected] First published in Transactions of the American Mathematical Society 362 (2010), no. 5, 2667-2684 published by the American Mathematical Society DOI: 10.1090/S0002-9947-09-05009-0 The original publication is available at http://www.ams.org/ 1 TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 362, Number 5, May 2010, Pages 2667–2684 S0002-9947(09)05009-0 Article electronically published on November 17, 2009 PRIME NUMBERS IN LOGARITHMIC INTERVALS DANILO BAZZANELLA, ALESSANDRO LANGUASCO, AND ALESSANDRO ZACCAGNINI Abstract. Let X be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type (p, p + h], where p X is a prime number and h = o(X). Then we will apply this to prove that ≤ for every λ>1/2thereexistsapositiveproportionofprimesp X such that ≤ the interval (p, p+λ log X]containsatleastaprimenumber.Asaconsequence we improve Cheer and Goldston’s result on the size of real numbers λ> 1 with the property that there is a positive proportion of integers m X ≤ such that the interval
    [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]
  • Multiplication Modulo N Along the Primorials with Its Differences And
    Multiplication Modulo n Along The Primorials With Its Differences And Variations Applied To The Study Of The Distributions Of Prime Number Gaps A.K.A. Introduction To The S Model Russell Letkeman r. letkeman@ gmail. com Dedicated to my son Panha May 19, 2013 Abstract The sequence of sets of Zn on multiplication where n is a primorial gives us a surprisingly simple and elegant tool to investigate many properties of the prime numbers and their distributions through analysis of their gaps. A natural reason to study multiplication on these boundaries is a construction exists which evolves these sets from one primorial boundary to the next, via the sieve of Eratosthenes, giving us Just In Time prime sieving. To this we add a parallel study of gap sets of various lengths and their evolution all of which together informs what we call the S model. We show by construction there exists for each prime number P a local finite probability distribution and it is surprisingly well behaved. That is we show the vacuum; ie the gaps, has deep structure. We use this framework to prove conjectured distributional properties of the prime numbers by Legendre, Hardy and Littlewood and others. We also demonstrate a novel proof of the Green-Tao theorem. Furthermore we prove the Riemann hypoth- esis and show the results are perhaps surprising. We go on to use the S model to predict novel structure within the prime gaps which leads to a new Chebyshev type bias we honorifically name the Chebyshev gap bias. We also probe deeper behavior of the distribution of prime numbers via ultra long scale oscillations about the scale of numbers known as Skewes numbers∗.
    [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]