Carmichael numbers and the sieve
|
|
- Thomas Small
- 5 years ago
- Views:
Transcription
1 June 9, 2015
2 Dedicated to Carl Pomerance in honor of his 70th birthday
3 Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z)
4 Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) A composite number n N with the same property is called a Carmichael number.
5 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number
6 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number λ(n) n 1, where λ(n) is the Carmichael function
7 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number λ(n) n 1, where λ(n) is the Carmichael function Korselt s criterion: n is squarefree, and p 1 n 1 for every prime p n
8 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number λ(n) n 1, where λ(n) is the Carmichael function Korselt s criterion: n is squarefree, and p 1 n 1 for every prime p n Examples 561 (found by Carmichael)
9 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number λ(n) n 1, where λ(n) is the Carmichael function Korselt s criterion: n is squarefree, and p 1 n 1 for every prime p n Examples 561 (found by Carmichael) 1729 (taxicab number)
10 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number λ(n) n 1, where λ(n) is the Carmichael function Korselt s criterion: n is squarefree, and p 1 n 1 for every prime p n Examples 561 (found by Carmichael) 1729 (taxicab number) (largest prime factor = 41)
11 Carmichael numbers If n is composite, the following are equivalent: n is a Carmichael number λ(n) n 1, where λ(n) is the Carmichael function Korselt s criterion: n is squarefree, and p 1 n 1 for every prime p n Examples 561 (found by Carmichael) 1729 (taxicab number) (largest prime factor = 41) (smallest prime factor = 41)
12 Carmichael numbers how many? Let C(x) = # { n x : n is a Carmichael number }
13 Carmichael numbers how many? Let C(x) = # { n x : n is a Carmichael number } Erdős conjectured that C(x) = x 1+o(1) as x.
14 Carmichael numbers how many? Let C(x) = # { n x : n is a Carmichael number } Erdős conjectured that C(x) = x 1+o(1) as x. Pomerance, Selfridge and Wagstaff showed that ( C(x) x exp (1 + o(1)) log x log 3 x ) log 2 x
15 Carmichael numbers how many? Let C(x) = # { n x : n is a Carmichael number } Erdős conjectured that C(x) = x 1+o(1) as x. Pomerance, Selfridge and Wagstaff showed that ( C(x) x exp (1 + o(1)) log x log 3 x ) log 2 x and they conjectured that ( C(x) x exp (2 + o(1)) log x log 3 x ) log 2 x
16 Infinitely many Carmichael numbers The existence of infinitely many Carmichael numbers was first proved in 1994 by Alford, Granville, and Pomerance.
17 Infinitely many Carmichael numbers The existence of infinitely many Carmichael numbers was first proved in 1994 by Alford, Granville, and Pomerance. They established the unconditional lower bound C(x) ε x β ε where 5 β= = > 7 2 e ( )
18 Designer Carmichael numbers Since primes and Carmichael numbers are linked by the relation a n a (mod n) (a Z) it is natural to ask whether certain properties of primes also hold for Carmichael numbers.
19 Designer Carmichael numbers Since primes and Carmichael numbers are linked by the relation a n a (mod n) (a Z) it is natural to ask whether certain properties of primes also hold for Carmichael numbers. This leads to the study of Carmichael numbers with prescribed arithmetic features: designer Carmichael numbers.
20 Carmichael + Dirichlet For example, is there an analogue of Dirichlet s theorem for Carmichael numbers?
21 Carmichael + Dirichlet For example, is there an analogue of Dirichlet s theorem for Carmichael numbers? Theorem (Matomäki; Wright) There are infinitely many Carmichael numbers in any arithmetic progression a mod m with gcd(a, m) = 1.
22 Carmichael + Dirichlet For example, is there an analogue of Dirichlet s theorem for Carmichael numbers? Theorem (Matomäki; Wright) There are infinitely many Carmichael numbers in any arithmetic progression a mod m with gcd(a, m) = 1. Formulated as a conjecture by B. & Pomerance (2010); they gave a conditional proof
23 Carmichael + Dirichlet For example, is there an analogue of Dirichlet s theorem for Carmichael numbers? Theorem (Matomäki; Wright) There are infinitely many Carmichael numbers in any arithmetic progression a mod m with gcd(a, m) = 1. Formulated as a conjecture by B. & Pomerance (2010); they gave a conditional proof Matomäki (2013) proved the special case in which a is a quadratic residue modulo m
24 Carmichael + Dirichlet For example, is there an analogue of Dirichlet s theorem for Carmichael numbers? Theorem (Matomäki; Wright) There are infinitely many Carmichael numbers in any arithmetic progression a mod m with gcd(a, m) = 1. Formulated as a conjecture by B. & Pomerance (2010); they gave a conditional proof Matomäki (2013) proved the special case in which a is a quadratic residue modulo m Wright (2013) proved the theorem in full generality
25 Carmichael + Dirichlet For example, is there an analogue of Dirichlet s theorem for Carmichael numbers? Theorem (Matomäki; Wright) There are infinitely many Carmichael numbers in any arithmetic progression a mod m with gcd(a, m) = 1. Formulated as a conjecture by B. & Pomerance (2010); they gave a conditional proof Matomäki (2013) proved the special case in which a is a quadratic residue modulo m Wright (2013) proved the theorem in full generality Open: Can one remove the restriction gcd(a, m) = 1? For example, are there infinitely many Carmichael numbers divisible by three?
26 Carmichael + Schinzel Let φ be the Euler function.
27 Carmichael + Schinzel Let φ be the Euler function. For any k 2 it is unknown whether there are infinitely many primes p such that p = m k + 1 ( m N)
28 Carmichael + Schinzel Let φ be the Euler function. For any k 2 it is unknown whether there are infinitely many primes p such that p = m k + 1 ( m N) Equivalently, φ(p) is a perfect k th power.
29 Carmichael + Schinzel Let φ be the Euler function. For any k 2 it is unknown whether there are infinitely many primes p such that p = m k + 1 ( m N) Equivalently, φ(p) is a perfect k th power. Theorem (B.) For every integer k 2 there are infinitely many Carmichael numbers n for which φ(n) is a perfect k th power.
30 Carmichael + Chebotarev Theorem (B., Güloğlu & Yeager) Let K /Q be a finite Galois extension, and let C be a fixed conjugacy class in Gal(K /Q). There are infinitely many Carmichael numbers composed of primes for which the associated class of Frobenius automorphisms is the class C.
31 Carmichael + Chebotarev Theorem (B., Güloğlu & Yeager) Let K /Q be a finite Galois extension, and let C be a fixed conjugacy class in Gal(K /Q). There are infinitely many Carmichael numbers composed of primes for which the associated class of Frobenius automorphisms is the class C. Corollary For every fixed integer N 1 there are infinitely many Carmichael numbers of the form a 2 + N b 2 with a, b Z.
32 Carmichael + Beatty Theorem (B. & Yeager) Let α, β R with α > 1, and suppose that α is irrational and of finite type. Then, there are infinitely many Carmichael numbers composed of primes of the form p = αn + β with n N.
33 Carmichael + Piatetski-Shapiro Theorem (Baker, B., Brudern, Shparlinski & Weingartner) For every fixed c ( 1, ) there are infinitely many Carmichael numbers composed of primes of the form p = n c with n N.
34 No time like the present
35 Theorem (B. & Freiberg) There are infinitely many Carmichael numbers whose prime factors all have the form p = 1 + a 2 + b 2 with a, b Z. Moreover, there is a positive constant C for which the number of such Carmichael numbers up to x is at least x C provided that x is sufficiently large in terms of C.
36 Theorem (B. & Freiberg) There are infinitely many Carmichael numbers whose prime factors all have the form p = 1 + a 2 + b 2 with a, b Z. Moreover, there is a positive constant C for which the number of such Carmichael numbers up to x is at least x C provided that x is sufficiently large in terms of C. Up to 10 8, there are seven such Carmichael numbers, namely 561, , , , , , whereas there are 255 ordinary Carmichael numbers 10 8.
37 Elements of the AGP proof P is the set of primes.
38 Elements of the AGP proof P is the set of primes. E, B, ε are small positive parameters, with 0 < ε < EB.
39 Elements of the AGP proof P is the set of primes. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b).
40 Elements of the AGP proof P is the set of primes. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ).
41 Elements of the AGP proof P is the set of primes. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ). Put Q = {q P (y θ / log y, y θ ] : P + (q 1) y}
42 Elements of the AGP proof P is the set of primes. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ). Put Q = {q P (y θ / log y, y θ ] : P + (q 1) y} L = q Q q
43 Elements of the AGP proof P is the set of primes. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ). Put Q = {q P (y θ / log y, y θ ] : P + (q 1) y} L = q Q q G = (Z/LZ)
44 Elements of the AGP proof The length n(g) of the longest sequence in G for which no nonempty subsequence has product the identity satisfies n(g) e 3θy
45 Elements of the AGP proof The length n(g) of the longest sequence in G for which no nonempty subsequence has product the identity satisfies n(g) e 3θy In particular, any set of primes whose cardinality greatly exceeds e 3θy has many subsets S for which p 1 mod L p S
46 Elements of the AGP proof There exists k x 1 B with gcd(k, L) = 1 such that d L dk+1 x 1 P (dk + 1) #{d L : d x B } log x
47 Elements of the AGP proof There exists k x 1 B with gcd(k, L) = 1 such that d L dk+1 x 1 P (dk + 1) #{d L : d x B } log x Thus, one has available a large set P of primes of the form p = dk + 1 with d L
48 Elements of the AGP proof The set P has many subsets S for which n S = p S p 1 mod L
49 Elements of the AGP proof The set P has many subsets S for which n S = p S p 1 mod L Since gcd(k, L) = 1 and p 1 mod k for each p n S, we have n S 1 mod Lk
50 Elements of the AGP proof The set P has many subsets S for which n S = p S p 1 mod L Since gcd(k, L) = 1 and p 1 mod k for each p n S, we have n S 1 mod Lk For each p n S we have p = dk + 1 with d L, and p 1 = dk Lk n S 1
51 Elements of the AGP proof The set P has many subsets S for which n S = p S p 1 mod L Since gcd(k, L) = 1 and p 1 mod k for each p n S, we have n S 1 mod Lk For each p n S we have p = dk + 1 with d L, and p 1 = dk Lk n S 1 Thus n S is a Carmichael number by Korselt s criterion.
52 Theorem (B. & Freiberg) There are infinitely many Carmichael numbers whose prime factors all have the form p = 1 + a 2 + b 2 with a, b Z.
53 New elements Let P 4,1 denote the set of primes congruent to 1 mod 4. Let B = {1, 5, 13, 17, 25,...} be the multiplicative semigroup generated by P 4,1.
54 New elements Let P 4,1 denote the set of primes congruent to 1 mod 4. Let B = {1, 5, 13, 17, 25,...} be the multiplicative semigroup generated by P 4,1. Put P = P (1 + 2B) Then P is a set of primes of the form p = 1 + a 2 + b 2.
55 New elements Let P 4,1 denote the set of primes congruent to 1 mod 4. Let B = {1, 5, 13, 17, 25,...} be the multiplicative semigroup generated by P 4,1. Put P = P (1 + 2B) Then P is a set of primes of the form p = 1 + a 2 + b 2. To prove the theorem, we show that P is well-distributed over arithmetic progressions with large, smooth moduli. Then, following the AGP method, we construct Carmichael numbers from the primes in P.
56 New elements We work with the set of primes P 4,1.
57 New elements We work with the set of primes P 4,1. E, B, ε are small positive parameters, with 0 < ε < EB.
58 New elements We work with the set of primes P 4,1. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b).
59 New elements We work with the set of primes P 4,1. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ).
60 New elements We work with the set of primes P 4,1. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ). For a certain integer l x B we put Q l = {q P 4,1 (y θ / log y, y θ ] : P + (q 1) y, q l}
61 New elements We work with the set of primes P 4,1. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ). For a certain integer l x B we put Q l = {q P 4,1 (y θ / log y, y θ ] : P + (q 1) y, q l} L l = q (note that d L l = d B) q Q l
62 New elements We work with the set of primes P 4,1. E, B, ε are small positive parameters, with 0 < ε < EB. θ = (1 E) 1 and δ = εθ/(4b). y 2 is a large real parameter, and x = exp(y 1+δ ). For a certain integer l x B we put Q l = {q P 4,1 (y θ / log y, y θ ] : P + (q 1) y, q l} L l = q (note that d L l = d B) q Q l G l = (Z/L l Z)
63 New elements Using a result of Matomäki, we again derive the bound n(g l ) e 3θy and we show that, for carefully chosen l, there exists k x 1 B with gcd(k, L l ) = 1 and d L l 2dk+1 x 1 B (k) 1 P (2dk + 1) #{d L l : d x B } (log x) 3/2
64 New elements Thus, for some integer k B with k x 1 B and gcd(k, L l ) = 1, one has available a large set P of primes of the form p = 2dk + 1 with d L l.
65 New elements Thus, for some integer k B with k x 1 B and gcd(k, L l ) = 1, one has available a large set P of primes of the form p = 2dk + 1 with d L l. The set P has many subsets S for which n S = p S p 1 mod L l and each n S is a Carmichael number as before.
66 New elements Thus, for some integer k B with k x 1 B and gcd(k, L l ) = 1, one has available a large set P of primes of the form p = 2dk + 1 with d L l. The set P has many subsets S for which n S = p S p 1 mod L l and each n S is a Carmichael number as before. Since P 1 + 2B, all such Carmichael numbers are composed of primes of the form p = 1 + a 2 + b 2.
67 Semilinear sieve Let P 4,3 denote the set of primes congruent to 3 mod 4.
68 Semilinear sieve Let P 4,3 denote the set of primes congruent to 3 mod 4. For a given divisor d L l we need to carefully estimate π (x; d, 1) = { p x : p 1 + 2B, p 1 (d) } To do so, we apply the semilinear sieve to the set A = { (p 1)/2 : p x, p 1 (d), p 3 (8) }, sieving A by the primes in P 4,3.
69 Semilinear sieve Let P 4,3 denote the set of primes congruent to 3 mod 4. For a given divisor d L l we need to carefully estimate π (x; d, 1) = { p x : p 1 + 2B, p 1 (d) } To do so, we apply the semilinear sieve to the set A = { (p 1)/2 : p x, p 1 (d), p 3 (8) }, sieving A by the primes in P 4,3. Complication: we have to do this for all d L l with d x B, thus we have to consider the possible effect of exceptional zeros of certain Dirichlet L-functions.
70 Exceptional zeros Lemma (B., Freiberg & Maynard) Let T 3. Among all primitive Dirichlet characters χ mod l with modulus l T and P + (l) T 1/ log 2 T, there is at most one for which the associated L-function L(s, χ) has a zero in the region R(s) > 1 c log 2 T / log T, I(s) exp ( log T / log2 T ), where c > 0 is a certain absolute constant. If such a character χ mod l exists, then χ is real and L(s, χ) has just one such zero, which is real and simple, and we put l(t ) = l; otherwise, we set l(t ) = 1.
71 Modified Bombieri-Vinogradov theorem Our estimate of π (x; d, 1) = { p x : p 1 + 2B, p 1 (d) } via the semilinear sieve relies on the following result. 1 Theorem (B. & Freiberg) Fix B > 0. Let x 3 1/B, and let d [1, x B ] be a squarefree integer such that P + (d) x B/ log 2 x and gcd(d, l) = 1, where l = l(x B ) as in the Lemma. If B = B(A, δ) is sufficiently small in terms of any fixed A > 0 and δ (0, 1/2), then max m gcd(a,dm)=1 x/x δ π(x) π(x; dm, a) φ(dm) δ,a x φ(d)(log x) A. 1 This extends Theorem 4.1 in B., Freiberg and Maynard, On limit points of the sequence of normalized primes gaps (arxiv: ).
72
On Carmichael numbers in arithmetic progressions
On Carmichael numbers in arithmetic progressions William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Carl Pomerance Department of Mathematics
More informationON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS
J. Aust. Math. Soc. 88 (2010), 313 321 doi:10.1017/s1446788710000169 ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS WILLIAM D. BANKS and CARL POMERANCE (Received 4 September 2009; accepted 4 January
More informationAlmost Primes of the Form p c
Almost Primes of the Form p c University of Missouri zgbmf@mail.missouri.edu Pre-Conference Workshop of Elementary, Analytic, and Algorithmic Number Theory Conference in Honor of Carl Pomerance s 70th
More informationCarmichael numbers with a totient of the form a 2 + nb 2
Carmichael numbers with a totient of the form a 2 + nb 2 William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Abstract Let ϕ be the Euler function.
More informationFACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE. 1. Introduction Recall that a Carmichael number is a composite number n for which
FACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE THOMAS WRIGHT Abstract. In light of the recent work by Maynard and Tao on the Dickson k-tuples conjecture, we show that with a small improvement
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationVARIANTS OF KORSELT S CRITERION. 1. Introduction Recall that a Carmichael number is a composite number n for which
VARIANTS OF KORSELT S CRITERION THOMAS WRIGHT Abstract. Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer a, there are infinitely many
More informationEuler 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 informationA 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 informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationThe 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 informationA Guide to Arithmetic
A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully
More informationHOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 1. Introduction
HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? PAUL POLLACK Abstract. Fix an integer k 2. We investigate the number of n x for which ϕn) is a perfect kth power. If we assume plausible conjectures on the
More informationSummary 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 informationPossible Group Structures of Elliptic Curves over Finite Fields
Possible Group Structures of Elliptic Curves over Finite Fields Igor Shparlinski (Sydney) Joint work with: Bill Banks (Columbia-Missouri) Francesco Pappalardi (Roma) Reza Rezaeian Farashahi (Sydney) 1
More informationDepartmento de Matemáticas, Universidad de Oviedo, Oviedo, Spain
#A37 INTEGERS 12 (2012) ON K-LEHMER NUMBERS José María Grau Departmento de Matemáticas, Universidad de Oviedo, Oviedo, Spain grau@uniovi.es Antonio M. Oller-Marcén Centro Universitario de la Defensa, Academia
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More informationIrreducible radical extensions and Euler-function chains
Irreducible radical extensions and Euler-function chains Florian Luca Carl Pomerance June 14, 2006 For Ron Graham on his 70th birthday Abstract We discuss the smallest algebraic number field which contains
More informationLEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID
LEHMER S TOTIENT PROBLEM AND CARMICHAEL NUMBERS IN A PID JORDAN SCHETTLER Abstract. Lehmer s totient problem consists of determining the set of positive integers n such that ϕ(n) n 1 where ϕ is Euler s
More informationGaps between primes: The story so far
Gaps between primes: The story so far Paul Pollack University of Georgia Number Theory Seminar September 24, 2014 1 of 57 PART I: (MOSTLY) PREHISTORY 2 of 57 PART I: (MOSTLY) PREHISTORY (> 2 years ago)
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationarxiv: v1 [math.nt] 31 Dec 2018
POSITIVE PROPORTION OF SORT INTERVALS CONTAINING A PRESCRIBED NUMBER OF PRIMES DANIELE MASTROSTEFANO arxiv:1812.11784v1 [math.nt] 31 Dec 2018 Abstract. We will prove that for every m 0 there exists an
More informationBefore giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before
More informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationTwo problems in combinatorial number theory
Two problems in combinatorial number theory Carl Pomerance, Dartmouth College Debrecen, Hungary October, 2010 Our story begins with: Abram S. Besicovitch 1 Besicovitch showed in 1934 that there are primitive
More informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More informationThe 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 informationResults in Analytic and Algebraic Number Theory. A Thesis. presented to. the Faculty of the Graduate School. University of Missouri
Results in Analytic and Algebraic Number Theory A Thesis presented to the Faculty of the Graduate School University of Missouri In Partial Fulfillment of the Requirements for the Degree Master of Arts
More informationarxiv: v1 [math.nt] 22 Jun 2017
lexander Kalmynin arxiv:1706.07343v1 [math.nt] 22 Jun 2017 Nová-Carmichael numbers and shifted primes without large prime factors bstract. We prove some new lower bounds for the counting function N C (x)
More informationThe 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 informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationOn the order of unimodular matrices modulo integers
ACTA ARITHMETICA 0.2 (2003) On the order of unimodular matrices modulo integers by Pär Kurlberg (Gothenburg). Introduction. Given an integer b and a prime p such that p b, let ord p (b) be the multiplicative
More informationarxiv:math/ v1 [math.nt] 17 Apr 2006
THE CARMICHAEL NUMBERS UP TO 10 18 arxiv:math/0604376v1 [math.nt] 17 Apr 2006 RICHARD G.E. PINCH Abstract. We extend our previous computations to show that there are 1401644 Carmichael numbers up to 10
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationThe number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.
The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationOrder and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationPolygonal Numbers, Primes and Ternary Quadratic Forms
Polygonal Numbers, Primes and Ternary Quadratic Forms Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun August 26, 2009 Modern number theory has
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationON THE ORDER OF UNIMODULAR MATRICES MODULO INTEGERS PRELIMINARY VERSION
ON THE ORDER OF UNIMODULAR MATRICES MODULO INTEGERS PRELIMINARY VERSION. Introduction Given an integer b and a prime p such that p b, let ord p (b) be the multiplicative order of b modulo p. In other words,
More informationLecture notes: Algorithms for integers, polynomials (Thorsten Theobald)
Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures
More informationBalanced subgroups of the multiplicative group
Balanced subgroups of the multiplicative group Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Based on joint work with D. Ulmer To motivate the topic, let s begin with elliptic curves. If
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationThe multiplicative order mod n, on average
The multiplicative order mod n, on average Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA (Joint work with: Michel Balazard, Pär Kurlberg) Perfect shuffles Suppose you take a deck of 52
More informationOrder and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationM381 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 informationSmall exponent point groups on elliptic curves
Journal de Théorie des Nombres de Bordeaux 18 (2006), 471 476 Small exponent point groups on elliptic curves par Florian LUCA, James MCKEE et Igor E. SHPARLINSKI Résumé. Soit E une courbe elliptique définie
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationPerfect 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 informationThe Least Inert Prime in a Real Quadratic Field
Explicit Palmetto Number Theory Series December 4, 2010 Explicit An upperbound on the least inert prime in a real quadratic field An integer D is a fundamental discriminant if and only if either D is squarefree,
More informationNumber Theory Proof Portfolio
Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by
More informationOn Values Taken by the Largest Prime Factor of Shifted Primes
On Values Taken by the Largest Prime Factor of Shifted Primes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More information(Primes and) Squares modulo p
(Primes and) Squares modulo p Paul Pollack MAA Invited Paper Session on Accessible Problems in Modern Number Theory January 13, 2018 1 of 15 Question Consider the infinite arithmetic progression Does it
More informationApplied Cryptography and Computer Security CSE 664 Spring 2018
Applied Cryptography and Computer Security Lecture 12: Introduction to Number Theory II Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline This time we ll finish the
More informationImproving the Accuracy of Primality Tests by Enhancing the Miller-Rabin Theorem
Improving the Accuracy of Primality Tests by Enhancing the Miller-Rabin Theorem Shyam Narayanan Fourth Annual MIT-PRIMES Conference Mentor: David Corwin Project Proposed by Stefan Wehmeier and Ben Hinkle
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationElementary Number Theory MARUCO. Summer, 2018
Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as
More informationIterated Encryption and Wiener s attack on RSA
Iterated Encryption Euler s function Euler s function: φ(n) = {1 x n : gcd(x, n) = 1} Theorem (Euler) If n is a positive integer and m is a positive integer coprime to n then m φ(n) mod n = 1. Iterated
More information10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "
Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/25833 holds various files of this Leiden University dissertation Author: Palenstijn, Willem Jan Title: Radicals in Arithmetic Issue Date: 2014-05-22 Chapter
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationas x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7.1 The Prime number theorem Denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.1. We have π( log as. Before
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE LIANGYI ZHAO INSTITUTIONEN FÖR MATEMATIK KUNGLIGA TEKNISKA HÖGSKOLAN (DEPT. OF MATH., ROYAL INST. OF OF TECH.) STOCKHOLM SWEDEN Dirichlet
More informationPrimality Proofs. Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN
Primality Proofs Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 ge@cs.indstate.edu July 30, 2013 Abstract There is an web site [1] that lists
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationON THE RESIDUE CLASSES OF π(n) MODULO t
ON THE RESIDUE CLASSES OF πn MODULO t Ping Ngai Chung Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts briancpn@mit.edu Shiyu Li 1 Department of Mathematics, University
More informationGod 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 informationResults 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 informationAn 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 informationCHAPTER 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 informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationOn 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 informationTheory of Numbers Problems
Theory of Numbers Problems Antonios-Alexandros Robotis Robotis October 2018 1 First Set 1. Find values of x and y so that 71x 50y = 1. 2. Prove that if n is odd, then n 2 1 is divisible by 8. 3. Define
More information2 More on Congruences
2 More on Congruences 2.1 Fermat s Theorem and Euler s Theorem definition 2.1 Let m be a positive integer. A set S = {x 0,x 1,,x m 1 x i Z} is called a complete residue system if x i x j (mod m) whenever
More informationarxiv: v1 [math.nt] 18 Jul 2012
Some remarks on Euler s totient function arxiv:107.4446v1 [math.nt] 18 Jul 01 R.Coleman Laboratoire Jean Kuntzmann Université de Grenoble Abstract The image of Euler s totient function is composed of the
More informationRepeated Values of Euler s Function. a talk by Paul Kinlaw on joint work with Jonathan Bayless
Repeated Values of Euler s Function a talk by Paul Kinlaw on joint work with Jonathan Bayless Oct 4 205 Problem of Erdős: Consider solutions of the equations ϕ(n) = ϕ(n + k), σ(n) = σ(n + k) for fixed
More informationA Few Primality Testing Algorithms
A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More information[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 informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationFIELD THEORY. Contents
FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationMath 314 Course Notes: Brief description
Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be
More informationSums of distinct divisors
Oberlin College February 3, 2017 1 / 50 The anatomy of integers 2 / 50 What does it mean to study the anatomy of integers? Some natural problems/goals: Study the prime factors of integers, their size and
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More informationAmicable numbers. CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014
Amicable numbers CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Recall that s(n) = σ(n) n,
More informationPARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES
PARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES KEN ONO, ROBERT SCHNEIDER, AND IAN WAGNER In celebration of Krishnaswami Alladi s 60th birthday Abstract If gcd(r, t) = 1, then a theorem of Alladi
More informationDistribution of Prime Numbers Prime Constellations Diophantine Approximation. Prime Numbers. How Far Apart Are They? Stijn S.C. Hanson.
Distribution of How Far Apart Are They? June 13, 2014 Distribution of 1 Distribution of Behaviour of π(x) Behaviour of π(x; a, q) 2 Distance Between Neighbouring Primes Beyond Bounded Gaps 3 Classical
More information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More informationA numerically explicit Burgess inequality and an application to qua
A numerically explicit Burgess inequality and an application to quadratic non-residues Swarthmore College AMS Sectional Meeting Akron, OH October 21, 2012 Squares Consider the sequence Can it contain any
More informationFactoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors.
Factoring Algorithms Pollard s p 1 Method This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Input: n (to factor) and a limit B Output: a proper factor of
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationarxiv: v1 [math.nt] 9 Jan 2019
NON NEAR-PRIMITIVE ROOTS PIETER MOREE AND MIN SHA Dedicated to the memory of Prof. Christopher Hooley (928 208) arxiv:90.02650v [math.nt] 9 Jan 209 Abstract. Let p be a prime. If an integer g generates
More information