Analytic. Number Theory. Exploring the Anatomy of Integers. Jean-Marie. De Koninck. Florian Luca. ffk li? Graduate Studies.

Size: px
Start display at page:

Download "Analytic. Number Theory. Exploring the Anatomy of Integers. Jean-Marie. De Koninck. Florian Luca. ffk li? Graduate Studies."

Transcription

1 Analytic Number Theory Exploring the Anatomy of Integers Jean-Marie Florian Luca De Koninck Graduate Studies in Mathematics Volume 134 ffk li? American Mathematical Society Providence, Rhode Island

2 Preface ix Notation xiii Frequently Used Functions xvii Chapter 1. Preliminary Notions Approximating a sum by an integral The Euler-MacLaurin formula The Abel summation formula Stieltjes integrals Slowly oscillating functions Combinatorial results The Chinese Remainder Theorem The density of a set of integers The Stirling formula Basic inequalities 13 Problems on Chapter 1 15 Chapter 2. Prime Numbers and Their Properties Prime numbers and their polynomial representations There exist infinitely many primes A first glimpse at the size of ir(x) Fermat numbers A better lower bound for 7r(a;) 24 iii

3 iv 2.6. The Chebyshev estimates The Bertrand Postulate The distance between consecutive primes Mersenne primes Conjectures on the distribution of prime numbers 33 Problems on Chapter 2 36 Chapter 3. The Riemann Zeta Function The definition of the Riemann Zeta Function Extending the Zeta Function to the half-plane cr > The derivative of the Riemann Zeta Function The zeros of the Zeta Function Euler's estimate <(2) tt2/6 = 45 Problems on Chapter 3 48 Chapter 4. Setting the Stage for the Proof of the Prime Number Theorem Key functions related to the Prime Number Theorem A closer analysis of the functions 0(x) and i)j(x) Useful estimates The Mertens estimate The Mobius function The divisor function 58 Problems on Chapter 4 60 Chapter 5. The Proof of the Prime Number Theorem A theorem of D. J. Newman An application of Newman's theorem The proof of the Prime Number Theorem A review of the proof of the Prime Number Theorem The Riemann Hypothesis and the Prime Number Theorem Useful estimates involving primes Elementary proofs of the Prime Number Theorem 72 Problems on Chapter 5 72 Chapter 6. The Global Behavior of Arithmetic Functions Dirichlet series and arithmetic functions The uniqueness of representation of a Dirichlet series 77

4 v 6.3. Multiplicative functions Generating functions and Dirichlet products Wintner's theorem Additive functions The average orders of w(n) and f2(n) The average order of an additive function The Erdos-Wintner theorem 88 Problems on Chapter 6 89 Chapter 7. The Local Behavior of Arithmetic Functions The normal order of an arithmetic function The Turan-Kubilius inequality Maximal order of the divisor function An upper bound for d(n) Asymptotic densities Perfect numbers Sierpiriski, Riesel, and Romanov Some open problems of an elementary nature 108 Problems on Chapter Chapter 8. The Fascinating Euler Function The Euler function Elementary properties of the Euler function The average order of the Euler function When is <j)(n)a(n) a square? The distribution of the values of <p{n)/n The local behavior of the Euler function 122 Problems on Chapter Chapter 9. Smooth Numbers Notation The smallest prime factor of an integer The largest prime factor of an integer The Rankin method An application to pseudoprimes The geometric method The best known estimates on W(x,y) 146

5 vi 9.8. The Dickman function Consecutive smooth numbers 149 Problems on Chapter Chapter 10. The Hardy-Ramanujan and Landau Theorems The Hardy-Ramanujan inequality Landau's theorem 159 Problems on Chapter Chapter 11. The abc Conjecture and Some of Its Applications The abc conjecture The relevance of the condition e > The Generalized Fermat Equation Consecutive powerful numbers Sums of fc-powerful numbers The Erdos-Woods conjecture A problem of Gandhi The k-abc conjecture 175 Problems on Chapter Chapter 12. Sieve Methods The sieve of Eratosthenes The Brun sieve Twin primes The Brun combinatorial sieve A Chebyshev type estimate The Brun-Titchmarsh theorem Twin primes revisited Smooth shifted primes The Goldbach conjecture The Schnirelman theorem The Selberg sieve The Brun-Titchmarsh theorem from the Selberg sieve The Large sieve Quasi-squares The smallest quadratic nonresidue modulo p 204 Problems on Chapter

6 I vii Chapter 13. Prime Numbers in Arithmetic Progression Quadratic residues The proof of the Quadratic Reciprocity Law Primes in arithmetic progressions with small moduli The Primitive Divisor theorem Comments on the Primitive Divisor theorem 227 Problems on Chapter Chapter 14. Characters and the Dirichlet Theorem Primitive roots Characters Theorems about characters L-series L(l,x) is finite if x is a non-principal character The nonvanishing of L(l, x): first step The completion of the proof of the Dirichlet theorem 244 Problems on Chapter Chapter 15. Selected Applications of Primes in Arithmetic Progression Known results about primes in arithmetical progressions Some Diophantine applications Primes p with p squarefree More applications of primes in arithmetic progressions Probabilistic applications 261 Problems on Chapter Chapter 16. The Index of Composition of an Integer Introduction Elementary results Mean values of A and 1/A Local behavior of A(n) Distribution function of A(n) Probabilistic results 276 Problems on Chapter Appendix: Basic Complex Analysis Theory Basic definitions 281

7 viii Infinite products The derivative of a function of a complex variable The integral of a function along a path The Cauchy theorem The Cauchy integral formula 289 Solutions to Even-Numbered Problems 291 Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Solutions to problems from Chapter Bibliography 405 Index 413

COMPLEX ANALYSIS in NUMBER THEORY

COMPLEX ANALYSIS in NUMBER THEORY COMPLEX ANALYSIS in NUMBER THEORY Anatoly A. Karatsuba Steklov Mathematical Institute Russian Academy of Sciences Moscow, Russia CRC Press Boca Raton Ann Arbor London Tokyo Introduction 1 Chapter 1. The

More information

Analytic Number Theory

Analytic Number Theory American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction

More information

The New Book of Prime Number Records

The New Book of Prime Number Records Paulo Ribenboim The New Book of Prime Number Records Springer Contents Preface Guiding the Reader Index of Notations ix xv xvii Introduction 1 CHARTER 1 How Many Prime Numbers Are There? 3 I. Euclid's

More information

Cryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press

Cryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press AN INTRODUCTION TO Number Theory with Cryptography James S Kraft Gilman School Baltimore, Maryland, USA Lawrence C Washington University of Maryland College Park, Maryland, USA CRC Press Taylor & Francis

More information

Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons Number Theory and Algebraic Equations Odile Marie-Thérèse Pons Published by Science Publishing Group 548 Fashion Avenue New York, NY 10018, U.S.A. http://www.sciencepublishinggroup.com ISBN: 978-1-940366-74-6

More information

A Classical Introduction to Modern Number Theory

A Classical Introduction to Modern Number Theory Kenneth Ireland Michael Rosen A Classical Introduction to Modern Number Theory Second Edition Springer Contents Preface to the Second Edition Preface v vii CHAPTER 1 Unique Factorization 1 1 Unique Factorization

More information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS. Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS

ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS. Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS Preface page xiii 1 The Gamma and Beta Functions 1 1.1 The Gamma

More information

Divisibility. 1.1 Foundations

Divisibility. 1.1 Foundations 1 Divisibility 1.1 Foundations The set 1, 2, 3,...of all natural numbers will be denoted by N. There is no need to enter here into philosophical questions concerning the existence of N. It will suffice

More information

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD An Invitation to Modern Number Theory Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Foreword Preface Notation xi xiii xix PART 1. BASIC NUMBER THEORY

More information

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer E.J. Barbeau Polynomials With 36 Illustrations Springer Contents Preface Acknowledgment of Problem Sources vii xiii 1 Fundamentals 1 /l.l The Anatomy of a Polynomial of a Single Variable 1 1.1.5 Multiplication

More information

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition Contents Preface to the First Edition Preface to the Second Edition Preface to the Third Edition i iii iv Glossary of Symbols A. Prime Numbers 3 A1. Prime values of quadratic functions. 7 A2. Primes connected

More information

Various new observations about primes

Various new observations about primes A talk given at Univ. of Illinois at Urbana-Champaign (August 28, 2012) and the 6th National Number Theory Confer. (October 20, 2012) and the China-Korea Number Theory Seminar (October 27, 2012) Various

More information

Elementary Number Theory

Elementary Number Theory Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What

More information

Prime and Perfect Numbers

Prime and Perfect Numbers Prime and Perfect Numbers 0.3 Infinitude of prime numbers 0.3.1 Euclid s proof Euclid IX.20 demonstrates the infinitude of prime numbers. 1 The prime numbers or primes are the numbers 2, 3, 5, 7, 11, 13,

More information

God may not play dice with the universe, but something strange is going on with the prime numbers.

God may not play dice with the universe, but something strange is going on with the prime numbers. Primes: Definitions God may not play dice with the universe, but something strange is going on with the prime numbers. P. Erdös (attributed by Carl Pomerance) Def: A prime integer is a number whose only

More information

The 98th Mathematics Colloquium Prague November 8, Random number theory. Carl Pomerance, Dartmouth College

The 98th Mathematics Colloquium Prague November 8, Random number theory. Carl Pomerance, Dartmouth College The 98th Mathematics Colloquium Prague November 8, 2016 Random number theory Carl Pomerance, Dartmouth College In 1770, Euler wrote: Mathematicians have tried in vain to discover some order in the sequence

More information

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives

More information

Flat primes and thin primes

Flat primes and thin primes Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes

More information

Contest Number Theory

Contest Number Theory Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,

More information

SQUARE PATTERNS AND INFINITUDE OF PRIMES

SQUARE PATTERNS AND INFINITUDE OF PRIMES SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod

More information

Probabilistic Aspects of the Integer-Polynomial Analogy

Probabilistic Aspects of the Integer-Polynomial Analogy Probabilistic Aspects of the Integer-Polynomial Analogy Kent E. Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu Zhou Dong Department

More information

Lecture 7. January 15, Since this is an Effective Number Theory school, we should list some effective results. x < π(x) holds for all x 67.

Lecture 7. January 15, Since this is an Effective Number Theory school, we should list some effective results. x < π(x) holds for all x 67. Lecture 7 January 5, 208 Facts about primes Since this is an Effective Number Theory school, we should list some effective results. Proposition. (i) The inequality < π() holds for all 67. log 0.5 (ii)

More information

On the Fractional Parts of a n /n

On the Fractional Parts of a n /n On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev

More information

The ranges of some familiar arithmetic functions

The ranges of some familiar arithmetic functions The ranges of some familiar arithmetic functions Max-Planck-Institut für Mathematik 2 November, 2016 Carl Pomerance, Dartmouth College Let us introduce our cast of characters: ϕ, λ, σ, s Euler s function:

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

Theta Constants, Riemann Surfaces and the Modular Group

Theta Constants, Riemann Surfaces and the Modular Group Theta Constants, Riemann Surfaces and the Modular Group An Introduction with Applications to Uniformization Theorems, Partition Identities and Combinatorial Number Theory Hershel M. Farkas Irwin Kra Graduate

More information

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if

More information

Analytic Number Theory

Analytic Number Theory Analytic Number Theory Exploring the Anatomy of Integers Jean-Marie De Koninck Florian Luca Graduate Studies in Mathematics Volume 134 American Mathematical Society http://dx.doi.org/10.1090/gsm/134 Analytic

More information

198 VOLUME 46/47, NUMBER 3

198 VOLUME 46/47, NUMBER 3 LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson

More information

Contents. Preface xi. vii

Contents. Preface xi. vii Preface xi 1. Real Numbers and Monotone Sequences 1 1.1 Introduction; Real numbers 1 1.2 Increasing sequences 3 1.3 Limit of an increasing sequence 4 1.4 Example: the number e 5 1.5 Example: the harmonic

More information

Math 412: Number Theory Lecture 3: Prime Decomposition of

Math 412: Number Theory Lecture 3: Prime Decomposition of Math 412: Number Theory Lecture 3: Prime Decomposition of Integers Gexin Yu gyu@wm.edu College of William and Mary Prime numbers Definition: a (positive) integer p is prime if p has no divisor other than

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

More information

7. Prime Numbers Part VI of PJE

7. Prime Numbers Part VI of PJE 7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.

More information

Sifting the Primes. Gihan Marasingha University of Oxford

Sifting the Primes. Gihan Marasingha University of Oxford Sifting the Primes Gihan Marasingha University of Oxford 18 March 2005 Irreducible forms: q 1 (x, y) := a 1 x 2 + 2b 1 xy + c 1 y 2, q 2 (x, y) := a 2 x 2 + 2b 2 xy + c 2 y 2, a i, b i, c i Z. Variety

More information

ENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory.

ENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory. ENTRY NUMBER THEORY [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory ABC conjecture [ABC conjecture] If a,b,c are positive integers, let N(a,b,c) be the

More information

M381 Number Theory 2004 Page 1

M381 Number Theory 2004 Page 1 M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +

More information

The Riemann Hypothesis

The Riemann Hypothesis The Riemann Hypothesis by Pedro Pablo Pérez Velasco, 2011 Introduction Consider the series of questions: How many prime numbers (2, 3, 5, 7,...) are there less than 100, less than 10.000, less than 1.000.000?

More information

JEAN-MARIE DE KONINCK AND IMRE KÁTAI

JEAN-MARIE DE KONINCK AND IMRE KÁTAI BULLETIN OF THE HELLENIC MATHEMATICAL SOCIETY Volume 6, 207 ( 0) ON THE DISTRIBUTION OF THE DIFFERENCE OF SOME ARITHMETIC FUNCTIONS JEAN-MARIE DE KONINCK AND IMRE KÁTAI Abstract. Let ϕ stand for the Euler

More information

Discrete Structures Lecture Primes and Greatest Common Divisor

Discrete Structures Lecture Primes and Greatest Common Divisor DEFINITION 1 EXAMPLE 1.1 EXAMPLE 1.2 An integer p greater than 1 is called prime if the only positive factors of p are 1 and p. A positive integer that is greater than 1 and is not prime is called composite.

More information

Applications of Number Theory in Statistics

Applications of Number Theory in Statistics Bonfring International Journal of Data Mining, Vol. 2, No., September 202 Applications of Number Theory in Statistics A.M.S. Ramasamy Abstract--- There have been several fascinating applications of Number

More information

Partial Sums of Powers of Prime Factors

Partial Sums of Powers of Prime Factors 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec

More information

Heuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn

Heuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn Heuristics for Prime Statistics Brown Univ. Feb., 2006 K. Conrad, UConn Two quotes about prime numbers Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers,

More information

LTCC basic course: Analytic Number Theory. Andrew Granville

LTCC basic course: Analytic Number Theory. Andrew Granville LTCC basic course: Analytic Number Theory Andrew Granville 3 Preface Riemann s seminal 860 memoir showed how questions on the distribution of prime numbers are more-or-less equivalent to questions on

More information

Euclid-Euler-Jiang Prime Theorem

Euclid-Euler-Jiang Prime Theorem Euclid-Euler-iang Prime Theorem Chun-Xuan iang POBox 394 Beiing 00854 P R China iangchunxuan@sohucom Abstract Santilli s prime chains: P + ap b L ( a b ab If λn a P λ LP n P LPn b we have ( as There exist

More information

A remark on a conjecture of Chowla

A remark on a conjecture of Chowla J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada

More information

Euler s ϕ function. Carl Pomerance Dartmouth College

Euler s ϕ function. Carl Pomerance Dartmouth College Euler s ϕ function Carl Pomerance Dartmouth College Euler s ϕ function: ϕ(n) is the number of integers m [1, n] with m coprime to n. Or, it is the order of the unit group of the ring Z/nZ. Euler: If a

More information

Some new representation problems involving primes

Some new representation problems involving primes A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.

More information

Carmichael numbers and the sieve

Carmichael numbers and the sieve June 9, 2015 Dedicated to Carl Pomerance in honor of his 70th birthday Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) Carmichael numbers Fermat s little

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

Here is another characterization of prime numbers.

Here is another characterization of prime numbers. Here is another characterization of prime numbers. Theorem p is prime it has no divisors d that satisfy < d p. Proof [ ] If p is prime then it has no divisors d that satisfy < d < p, so clearly no divisor

More information

Results of modern sieve methods in prime number theory and more

Results of modern sieve methods in prime number theory and more Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications

More information

MATH 310 Course Objectives

MATH 310 Course Objectives MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

More information

Proofs of the infinitude of primes

Proofs of the infinitude of primes Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number

More information

Perfect Power Riesel Numbers

Perfect Power Riesel Numbers Perfect Power Riesel Numbers Carrie Finch a, Lenny Jones b a Mathematics Department, Washington and Lee University, Lexington, VA 24450 b Department of Mathematics, Shippensburg University, Shippensburg,

More information

On the number of co-prime-free sets. Neil J. Calkin and Andrew Granville *

On the number of co-prime-free sets. Neil J. Calkin and Andrew Granville * On the number of co-prime-free sets. by Neil J. Calkin and Andrew Granville * Abstract: For a variety of arithmetic properties P such as the one in the title) we investigate the number of subsets of the

More information

The first dynamical system

The first dynamical system The first dynamical system Carl Pomerance, Dartmouth College Charles University November 8, 2016 As we all know, functions in mathematics are ubiquitous and indispensable. But what was the very first function

More information

1 Euler s idea: revisiting the infinitude of primes

1 Euler s idea: revisiting the infinitude of primes 8.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The prime number theorem Most of my handouts will come with exercises attached; see the web site for the due dates. (For example, these are

More information

Fermat numbers and integers of the form a k + a l + p α

Fermat numbers and integers of the form a k + a l + p α ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

Towards the Twin Prime Conjecture

Towards the Twin Prime Conjecture A talk given at the NCTS (Hsinchu, Taiwan, August 6, 2014) and Northwest Univ. (Xi an, October 26, 2014) and Center for Combinatorics, Nankai Univ. (Tianjin, Nov. 3, 2014) Towards the Twin Prime Conjecture

More information

An Introduction to Complex Function Theory

An Introduction to Complex Function Theory Bruce P. Palka An Introduction to Complex Function Theory With 138 luustrations Springer 1 Contents Preface vü I The Complex Number System 1 1 The Algebra and Geometry of Complex Numbers 1 1.1 The Field

More information

[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives

[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives [Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime

More information

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus... PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers

More information

Theorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.

Theorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x. Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural

More information

A 1935 Erdős paper on prime numbers and Euler s function

A 1935 Erdős paper on prime numbers and Euler s function A 1935 Erdős paper on prime numbers and Euler s function Carl Pomerance, Dartmouth College with Florian Luca, UNAM, Morelia 1 2 3 4 Hardy & Ramanujan, 1917: The normal number of prime divisors of n is

More information

The ranges of some familiar functions

The ranges of some familiar functions The ranges of some familiar functions CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Let us

More information

Math 3336 Section 4.3 Primes and Greatest Common Divisors. Prime Numbers and their Properties Conjectures and Open Problems About Primes

Math 3336 Section 4.3 Primes and Greatest Common Divisors. Prime Numbers and their Properties Conjectures and Open Problems About Primes Math 3336 Section 4.3 Primes and Greatest Common Divisors Prime Numbers and their Properties Conjectures and Open Problems About Primes Greatest Common Divisors and Least Common Multiples The Euclidian

More information

Analytic number theory for probabilists

Analytic number theory for probabilists Analytic number theory for probabilists E. Kowalski ETH Zürich 27 October 2008 Je crois que je l ai su tout de suite : je partirais sur le Zéta, ce serait mon navire Argo, celui qui me conduirait à la

More information

INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS

INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS JEAN-MARIE DE KONINCK and FLORIAN LUCA Abstract. For each integer n 2, let β(n) be the sum of the distinct prime divisors of n and let B(x) stand for

More information

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim

More information

#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC

#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC #A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:

More information

GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT

GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL

More information

An Introduction to Sieve Methods and Their Applications

An Introduction to Sieve Methods and Their Applications An Introduction to Sieve Methods and Their Applications LONDON MATHEMATICAL SOCIETY STUDENT TEXTS Managing editor: Professor J. W. Bruce, Department of Mathematics, University of Hull, UK 3 Local fields,

More information

ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction

ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and

More information

CHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS

CHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS Journal of Algebra, Number Theory: Advances and Applications Volume 8, Number -, 0, Pages 4-55 CHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS ADEL ALAHMADI, MICHEL PLANAT and PATRICK SOLÉ 3 MECAA

More information

AN EQUATION INVOLVING ARITHMETIC FUNCTIONS AND RIESEL NUMBERS

AN EQUATION INVOLVING ARITHMETIC FUNCTIONS AND RIESEL NUMBERS #A88 INTEGERS 18 (2018) AN EQUATION INVOLVING ARITHMETIC FUNCTIONS AND RIESEL NUMBERS Joshua Harrington Department of Mathematics, Cedar Crest College, Allentown, Pennsylvania joshua.harrington@cedarcrest.edu

More information

THE FORMATION OF PRIME NUMBERS THE SOLUTION FOR GOLDBACH S CONJECTURES

THE FORMATION OF PRIME NUMBERS THE SOLUTION FOR GOLDBACH S CONJECTURES Research article THE FORMATION OF PRIME NUMBERS AND THE SOLUTION FOR GOLDBACH S CONJECTURES JOSÉ WILLIAM PORRAS-FERREIRA CARLOS ALBERTO ANDRADE Escuela Naval de Cadetes Almirante Padilla, Isla Manzanillo,

More information

On strings of consecutive economical numbers of arbitrary length

On strings of consecutive economical numbers of arbitrary length INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(2) (2005), #A05 1 On strings of consecutive economical numbers of arbitrary length Jean-Marie De Koninck 1 and Florian Luca 2 Received: 11/5/03,

More information

Modern Computer Algebra

Modern Computer Algebra Modern Computer Algebra JOACHIM VON ZUR GATHEN and JURGEN GERHARD Universitat Paderborn CAMBRIDGE UNIVERSITY PRESS Contents Introduction 1 1 Cyclohexane, cryptography, codes, and computer algebra 9 1.1

More information

CONTENTS. Preface Preliminaries 1

CONTENTS. Preface Preliminaries 1 Preface xi Preliminaries 1 1 TOOLS FOR ANALYSIS 5 1.1 The Completeness Axiom and Some of Its Consequences 5 1.2 The Distribution of the Integers and the Rational Numbers 12 1.3 Inequalities and Identities

More information

New bounds on gaps between primes

New bounds on gaps between primes New bounds on gaps between primes Andrew V. Sutherland Massachusetts Institute of Technology Brandeis-Harvard-MIT-Northeastern Joint Colloquium October 17, 2013 joint work with Wouter Castryck, Etienne

More information

Rassias Conjecture. For any prime p with p>2therearetwoprimesp 1, p 2, with p 1 <p 2 such that p = p 1 + p 2 +1 p 1 . (1)

Rassias Conjecture. For any prime p with p>2therearetwoprimesp 1, p 2, with p 1 <p 2 such that p = p 1 + p 2 +1 p 1 . (1) The International Mathematics Olympiad (IMO), in the last two decades, has become an international institution with an impact in most countries throughout the world, fostering young mathematical talent

More information

The ranges of some familiar arithmetic functions

The ranges of some familiar arithmetic functions The ranges of some familiar arithmetic functions Carl Pomerance Dartmouth College, emeritus University of Georgia, emeritus based on joint work with K. Ford, F. Luca, and P. Pollack and T. Freiburg, N.

More information

Solutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00

Solutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00 Solutions to 18.781 Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00 1. (Niven 2.3.3) Solve the congruences x 1 (mod 4), x 0 (mod 3), x 5 (mod 7). First we note that 4, 3, and 7 are pairwise relatively

More information

Walsh Series and Transforms

Walsh Series and Transforms Walsh Series and Transforms Theory and Applications by B. Golubov Moscow Institute of Engineering, A. Efimov Moscow Institute of Engineering, and V. Skvortsov Moscow State University, W KLUWER ACADEMIC

More information

New Perspectives. Functional Inequalities: and New Applications. Nassif Ghoussoub Amir Moradifam. Monographs. Surveys and

New Perspectives. Functional Inequalities: and New Applications. Nassif Ghoussoub Amir Moradifam. Monographs. Surveys and Mathematical Surveys and Monographs Volume 187 Functional Inequalities: New Perspectives and New Applications Nassif Ghoussoub Amir Moradifam American Mathematical Society Providence, Rhode Island Contents

More information

Proof of Infinite Number of Triplet Primes. Stephen Marshall. 28 May Abstract

Proof of Infinite Number of Triplet Primes. Stephen Marshall. 28 May Abstract Proof of Infinite Number of Triplet Primes Stephen Marshall 28 May 2014 Abstract This paper presents a complete and exhaustive proof that an Infinite Number of Triplet Primes exist. The approach to this

More information

Contradictions in some primes conjectures

Contradictions in some primes conjectures Contradictions in some primes conjectures VICTOR VOLFSON ABSTRACT. This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman- Horn's conjectures (suggest that the probability of a

More information

Table of Contents. 2013, Pearson Education, Inc.

Table of Contents. 2013, Pearson Education, Inc. Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter

More information

18.785: Analytic Number Theory, MIT, spring 2007 (K.S. Kedlaya) Brun s combinatorial sieve

18.785: Analytic Number Theory, MIT, spring 2007 (K.S. Kedlaya) Brun s combinatorial sieve 18.785: Analytic Number Theory, MIT, spring 2007 (K.S. Kedlaya) Brun s combinatorial sieve In this unit, we describe a more intricate version of the sieve of Eratosthenes, introduced by Viggo Brun in order

More information

ON THE AVERAGE RESULTS BY P. J. STEPHENS, S. LI, AND C. POMERANCE

ON THE AVERAGE RESULTS BY P. J. STEPHENS, S. LI, AND C. POMERANCE ON THE AVERAGE RESULTS BY P J STEPHENS, S LI, AND C POMERANCE IM, SUNGJIN Abstract Let a > Denote by l ap the multiplicative order of a modulo p We look for an estimate of sum of lap over primes p on average

More information

Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications

Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications An elementary and indeed naïve approach to the distribution of primes is the following argument: an

More information

Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela

Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela #A89 INTEGERS 16 (016) ON SIERPIŃSKI NUMBERS OF THE FORM '(N)/ n Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela mago@usb.ve

More information

Primes and Factorization

Primes and Factorization Primes and Factorization 1 A prime number is an integer greater than 1 with no proper divisors. The list begins 2, 3, 5, 7, 11, 13, 19,... See http://primes.utm.edu/ for a wealth of information about primes.

More information

On Legendre s formula and distribution of prime numbers

On Legendre s formula and distribution of prime numbers On Legendre s formula and distribution of prime numbers To Hiroshi, Akiko, and Yuko Kazuo AKIYAMA Tatsuhiko NAGASAWA 1 Abstract The conclusion in this paper is based on the several idea obtained in recherché

More information

On the largest prime factor of the Mersenne numbers

On the largest prime factor of the Mersenne numbers arxiv:0704.137v1 [math.nt] 10 Apr 007 On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801,

More information