STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER
|
|
- Garry Casey
- 5 years ago
- Views:
Transcription
1 STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER Abstract In a recent paper, Thorne [5] proved the existence of arbitrarily long strings of consecutive primes in arithmetic progressions in the polynomial ring F q [t] Here we extend this result to show that given any k there exists a string of k consecutive primes of degree D in arithmetic progression for all sufficiently large D 1 Introduction and Statement of Results Let F q be the finite field with q elements and let F q [t] denote the corresponding polynomial ring in one variable The ring F q is analogous to Z see [3]) Therefore, questions concerning the distribution of primes ie monic irreducible polynomials) are naturally of interest The Riemann Hypothesis can be proven in this setting and results such as the Prime Number Theorem for arithmetic progressions have been proven with the strongest possible error terms [3] This paper is concerned with the distribution of primes in arithmetic progressions In both F q [t] and Z, one can show the existence of odd behavior of primes in arithmetic progressions Let p 1 = 2, p 2 = 3, denote the sequence of primes in order ie p n is the nth prime) In 2000, Shiu [4] proved that given a and m Z with a, m) = 1 and any k, there exists a string of consecutive primes p r+1 p r+2 p r+k a mod m In 2007, Thorne [5] extended this result to F q [t] Thorne showed that for arbitrary monic polynomials a and m with a, m) = 1, given k, then there exists a constant D 0 depending on k, q, and m) such that for any D > D 0 there exists a string of consecutive primes p r+1 p r+2 p r+k a mod m, of degree at most D Consecutive here means with respect to lexicographical order As can be seen from the proofs, the choice of lexicographical order is arbitrary One could choose any ordering such that for two primes of different degrees, the prime of higher degree is greater 2000 Mathematics Subject Classification 11N05, 11T55 Key words and phrases Primes, function fields, Shiu s theorem, Maier matrix 1
2 2 NOAM TANNER Even though these results concerning strings of primes may be predicted from probablistic models see [1]), the fact that one can prove this odd behavior in both cases is quite surprising Although Thorne proves the existence of strings of consecutive primes for arbitrarily large degree, his construction guarantees the existence of these strings for scattered degrees In this paper we will show that these strings can be found among the primes of every sufficiently large degree: Theorem 11 If a and m are monic polynomials with a, m) = 1 and k is a positive integer, then there exists an integer D 0 depending on q, m, and k) such that for every D D 0 there is a string of k consecutive primes of degree D such that p r+1 p r+2 p r+k a mod m Moreover, we have that for sufficiently large k depending on q and m) ) 1/ 1 log D0 11) k log log D 0 ) 2 The implied constant depends only on q 2 Preliminary Results We fix a finite field F q throughout We are interested in the distribution of primes ie, irreducible monic polynomials) in the polynomial ring F q [t] Except as noted and always when referring to primes), we will assume all of our polynomials to be monic For a residue class a modulo m, let πa, m; n) denote the number of primes in F q [t] of degree n congruent to a modulo m By the Prime Number Theorem for arithmetic progressions [3], we have 21) πa, m; n) = 1 q n n + O q n/2 whenever a, m) = 1 Here the Euler φ-function is defined by = F q [t]/mf q [t]) As an important special case we have ) 22) πn) = qn q n/2 n + O, n where πn) denotes the number of primes of degree n Moreover, a simple exact formula for πn) is given in [3] Thorne s and Shiu s theorems make use of the Maier matrix method [2], which we describe as follows See also Granville s article [1] for an exposition about the method used for the integers and other related results) In the case of Z, let Q be a certain product of small primes and x 1, x 2, and y be integers such that x 1 < x 2 and n ),
3 STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS 3 y < Q We consider the following matrix of integers: Qx Qx Qx 1 + y Qx 1 + 1) + 1 Qx 1 + 1) + 2 Qx 1 + 1) + y Qx Qx Qx 2 + y In the case of F q [t], let Q be a product of small prime polynomials monic irreducible polynomials) Let each polynomial f i be of degree s < deg Q By choosing Q so that it is divisible by a large enough power of t, we ensure that the rows of the matrix are ordered lexicographically) Let each g i be a polynomial of degree r We consider the following matrix of polynomials where α and β are positive integers): Qf 1 + g 1 Qf 1 + g 2 Qf 1 + g α Qf 2 + g 1 Qf 2 + g 2 Qf 2 + g α Qf β + g 1 Qf β + g 2 Qf β + g α In either case, the columns form arithmetic progressions modulo Q In the case of Z, for those Q which meet appropriate conditions on the associated Dirichlet L-functions, each column will contain roughly the expected number of primes In the case of F q the analogous conditions are trivial, so for all sufficiently large Q all columns will have approximately the expected number of primes Thorne and Shiu proved their results using a clever choice of Q, the Prime Number Theorem, and sieve-theoretic lemmas Shiu s choice of Q ensured that the majority of i with 1 < i < y are congruent to a mod m Thorne s choice of Q ensured that the majority of g i in the matrix were congruent to a mod m In order to estimate the number of i and g i congruent to a mod m the number of columns containg primes congruent to a mod m), Thorne and Shiu used a combinatorial argument to find expressions for these quantities Once they found these expressions, they used sieve-theoretic lemmas to bound these values The Prime Number Theorem enabled them to estimate the number of primes per column and it followed that the majority of primes in the matrix were congruent to a mod m In order to prove the theorem, we introduce a parameter b 0 which will allow us to establish the existence of a string of consecutive primes for a range of degrees We will then prove that these ranges overlap and cover all sufficiently large D We conclude this section by presenting our choice of notation Throughout q will denote the cardinality of the base field, m and a will denote monic polynomials in F q [t], p will denote a monic) prime element of F q [t], and f and g will denote generic elements of F q [t] Q will denote a certain product of primes, as in the introduction In Section 3, c, d, u will denote positive integers, analogous to the quantities y, z, t appearing in [4] We will write fx) gx) to mean that fx) > Cgx) for some
4 4 NOAM TANNER positive constant C and large enough x The constant C will depend only on q, but the range of allowable x may depend on other variables as noted 3 Proof of Theorem 11 The proof of Theorem 11 adapts Thorne s proof [5] We as in [5]) introduce a variable c, as well as variables d and u which will be chosen as unbounded, nondecreasing functions of c satisfying d < u = oc) We assume that the quantity c is sufficiently large in relation to q and m; the same will then also be true of u and d With this restriction, constants implied by and will depend only on q For a 1 we define a set of primes P by 31) P := {p : deg p c, p 1, a mod m} {p : u deg p c, p 1 mod m} {p : deg p c + d u, p a mod m} For the case a = 1 we define instead: { {p : deg p c, p 1 mod m} 32) P := {p : u deg p c + d u, p 1 mod m} Although the latter definition does not give optimal bounds for a = 1, it simplifies our proof by allowing us to treat both cases together We introduce a parameter b 0 which will allow us to prove the existence of a string of consecutive primes for a range of degrees We will then prove that these ranges overlap and cover all sufficiently large D Let 33) Q := mt c+d+1 p We then define a Maier matrix M consisting of the following set of integers: 34) M := Qf + g deg f=2 deg Q+b deg g=c+d Here f and g range over monic polynomials of the indicated degrees The g are arranged in lexicographic order and since t c+d+1 Q each row in the matrix is arranged in lexicographic order Each column of M will be the arithmetic progression of all monic polynomials of degree 3 deg Q + b which are congruent to a fixed g modulo Q By 21), each column containing primes will contain asymptotically the same number of primes Moreover, whether or not a particular element Qf + g is congruent to a modulo m depends only on g, and our choice of Q will ensure that most g with g, Q) = 1 fall into the desired congruence class
5 We then define sets STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS 5 35) S := {h : deg h = c + d, h, Q) = 1, h a mod m}, T := {h : deg h = c + d, h, Q) = 1, h a mod m} Thorne shows that S is much larger than T for appropriate choices of u, c, and d This implies see [5]) that either the matrix contains a string of consecutive primes in arithmetic progression of length 36) 1 u d or ) 1/ 37) π 2 deg Q+b /q where π denotes the total number of primes congruent to a mod m, in the matrix From the estimation of S, it follows see [5]) that 38) π C m q c+d q 3 deg Q+b c + d u1/ 3 deg Q + b)φq) Into this last equation we incorporate the estimate: 39) 3 deg Q + b deg m + c + d b + q c + q c 1 + q c + b If we set b such that 0 b 9q c+1, we obtain: 310) 3 deg Q + b q c, where the constant depends on q Using Mertens estimate see [5]), it can be shown that the following holds for all a: q deg Q 311) φq) m ) 1/ c c1 2/ c + d u) 1/ cu 1/ u Thus in the case of 37), if b is an integer between 0 and 9q c+1, we conclude from these estimates and 38) that there exists a row that contains C m q d consecutive primes all of degree 3 deg Q + b From 36), 37), and the above remarks we conclude that the matrix will contain an arithmetic progression of primes of length 1 u ) ) 1/, min Cm q d d With the choices u = c/2 log c and d = 2 log c we obtain a progression of length 312) 1 ) 1 c log 2 c Thus, we have proven the following lemma:
6 6 NOAM TANNER Lemma 31 Using the notation of the previous theorem, if large enough c is given, then there exists a string of consecutive primes of degree D in arithmetic progression of length 1 c for every degree D such that 3 deg Q D 3 deg Q + 9q c+1 ) 1 log 2 c We now use this lemma to prove the theorem by creating a sequence of intervals of degrees D containing consecutive primes in arithmetic progression These intervals will overlap and will cover all sufficiently large D In order to prove that these intervals overlap, we must first obtain estimates for deg Q Note that deg Q = deg m + c + d deg p For a 1, deg p = c iπj, m; i) + j 1,a c kπ1, m; k) + k=u c+d u l=u lπa, m; l), recalling the notation in 21) For a = 1, deg p = c iπj, m; i) + j 1 c+d u l=u lπ1, m; l) Using the Prime Number Theorem we will now provide an upper bound for deg p that holds for all a: deg p c iπi) = c q i + Oq i/2 )) = c q i + Ocq c/2 ) = qc+ q 1 + Ocqc/2 ) 2q c + Ocq c/2 ) Since u = oc), then for large c deg p 2q c + Ocq c/2 ) 2 + ɛ )q c, for some ɛ with 0 < ɛ < 1
7 STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS 7 Now we will bound deg p from below If a 1, then: c c deg p iπj, m; i) + iπ1, m; i) = = j 1,a As u = oc), then for large c c 1 2 i=u ) q i + Oq i/2 ) ) q c+ q ) + ) q c+ q q u 1 q 1 + Ocqc/2 ) for some ɛ with 0 < ɛ < If a = 1, then: c deg p iπj, m; i) = = j 1 c c ) q i + Oqi/2 ) i=u q u 1 q 1 + Ocqc/2 ) ) q c+ q 1 + Ocqc/2 ) Once again, since u = oc), then for large c deg p ) q c+ q 1 + Ocqc/2 ) ) ɛ q c, ) ) q i + Oq i/2 ) ) ɛ q c, with 0 < ɛ < If = 1, then every prime is congruent to a mod m so that the theorem is trivial We can therefore assume that > 1 Since c was assumed to be large enough and u = oc), for any a relatively prime to m there exist ɛ and ɛ so that deg Q = m + c + d [ deg p ] )q ɛ c, 2 + ɛ )q c, where 0 < ɛ < ) and 0 < ɛ < 1 Thus, we have the desired estimate for deg Q and we are ready to show that the intervals overlap Incorporating the result of Lemma 31, these estimates above show that for every large c one can find consecutive primes in arithmetic progression of degree D where 313) D [ 32 + ɛ )q c, 3 ɛ ] )q c + 9q c+1
8 8 NOAM TANNER Letting c be the lower bound of c for which 312) and the estimates presented above for D and deg Q hold, note that for any c c our argument produces strings of length 1 ) 1 c log 2 c Therefore we have a sequence of intervals I c = [32 + ɛ )q c, 3 ɛ)qc + 9q c+1 ], such that for every D I c, there exist strings of consecutive, congruent primes of degree D of length 1 ) 1 c log 2 c However, since 32 + ɛ )q c+1 < 9q c+1, every interval I c overlaps with I c+1 Thus, we see that I c = [32 + ɛ )q c, ) c c Let c 0 be the smallest integer c such that Lemma 31 guarantees that the Maier matrix formed by choosing c 0 contains k consecutive primes Since c 0 is sufficiently large, we have that for any degree D such that D D 0 := 9q c 0, there exist strings of degree D consecutive primes of length k 1 c0 log 2 c 0 ) 1 Finally, since D 0 = 9q c 0, we have that c 0 log D 0 Since k 1 ) 1 c 0 log 2 c 0, for sufficiently large k this previous bound implies 11) Sufficiently large in terms of how large c has to be for the conclusion of Lemma 31 to hold, and this depends in turn on q and m) 4 Acknowledgements I would like to thank Frank Thorne and Ken Ono for their invaluable assistance with every aspect of this project, and to the anonymous referee for many helpful suggestions I would also like to thank the other instructors and students at the 2007 UW-Madison REU for all of their helpful comments References [1] A Granville, Unexpected irregularities in the distribution of prime numbers, Proceedings of the International Congress of Mathematicians Zürich, 1994), , Birkhäuser, Basel, 1995 [2] H Maier, Primes in short intervals, Michigan Math J ), [3] M Rosen, Number theory in function fields, GTM 210, Springer-Verlag, New York, 2002 [4] D K L Shiu, Strings of congruent primes, J London Math Soc ),
9 STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS 9 [5] F Thorne, Irregularities in the distributions of primes in function fields, J Number Theory, to appear Department of Mathematics, Princeton University, Princeton, New Jersey address: ntanner@princetonedu
1 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 informationNOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials
NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written
More informationBUBBLES OF CONGRUENT PRIMES
BUBBLES OF CONGRUENT PRIMES FRANK THORNE Abstract. In [15], Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent
More informationSection X.55. Cyclotomic Extensions
X.55 Cyclotomic Extensions 1 Section X.55. Cyclotomic Extensions Note. In this section we return to a consideration of roots of unity and consider again the cyclic group of roots of unity as encountered
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
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 informationCOMPUTATION OF JACOBSTHAL S FUNCTION h(n) FOR n < 50.
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 0025-5718(XX)0000-0 COMPUTATION OF JACOBSTHAL S FUNCTION h(n) FOR n < 50. THOMAS R. HAGEDORN Abstract. Let j(n) denote the smallest positive
More informationCoding Theory ( Mathematical Background I)
N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] For
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
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 informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
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 informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
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 informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More informationOn the Largest Integer that is not a Sum of Distinct Positive nth Powers
On the Largest Integer that is not a Sum of Distinct Positive nth Powers arxiv:1610.02439v4 [math.nt] 9 Jul 2017 Doyon Kim Department of Mathematics and Statistics Auburn University Auburn, AL 36849 USA
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationThe Weil bounds. 1 The Statement
The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil
More informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
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 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 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 informationA Local-Global Principle for Diophantine Equations
A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.
More informationVarious 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 informationCHAPTER 10: POLYNOMIALS (DRAFT)
CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationDiscrete Math, Fourteenth Problem Set (July 18)
Discrete Math, Fourteenth Problem Set (July 18) REU 2003 Instructor: László Babai Scribe: Ivona Bezakova 0.1 Repeated Squaring For the primality test we need to compute a X 1 (mod X). There are two problems
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationChapter 4 Finite Fields
Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit and Yee introduced partition
More informationTHE p-adic VALUATION OF LUCAS SEQUENCES
THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
More informationA NOTE ON CHARACTER SUMS IN FINITE FIELDS. 1. Introduction
A NOTE ON CHARACTER SUMS IN FINITE FIELDS ABHISHEK BHOWMICK, THÁI HOÀNG LÊ, AND YU-RU LIU Abstract. We prove a character sum estimate in F q[t] and answer a question of Shparlinski. Shparlinski [5] asks
More informationAn Asymptotic Formula for Goldbach s Conjecture with Monic Polynomials in Z[x]
An Asymptotic Formula for Goldbach s Conjecture with Monic Polynomials in Z[x] Mark Kozek 1 Introduction. In a recent Monthly note, Saidak [6], improving on a result of Hayes [1], gave Chebyshev-type estimates
More information4 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 informationSlides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 2.4 2.6 of Rosen Introduction I When talking
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationThe zeta function, L-functions, and irreducible polynomials
The zeta function, L-functions, and irreducible polynomials Topics in Finite Fields Fall 203) Rutgers University Swastik Kopparty Last modified: Sunday 3 th October, 203 The zeta function and irreducible
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 informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationAN UNCERTAINTY PRINCIPLE FOR FUNCTION FIELDS
AN UNCERTAINTY PRINCIPLE FOR FUNCTION FIELDS FRANK THORNE Abstract. In a recent paper, Granville and Soundararajan [8] proved an uncertainty principle for arithmetic sequences, which limits the extent
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More information1, for s = σ + it where σ, t R and σ > 1
DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,
More informationMTH310 EXAM 2 REVIEW
MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not
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 informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationA proof of Freiman s Theorem, continued. An analogue of Freiman s Theorem in a bounded torsion group
A proof of Freiman s Theorem, continued Brad Hannigan-Daley University of Waterloo Freiman s Theorem Recall that a d-dimensional generalized arithmetic progression (GAP) in an abelian group G is a subset
More informationOn the Hansen-Mullen Conjecture for Self-Reciprocal Irreducible Polynomials
On the Hansen-Mullen Conjecture for Self-Reciprocal Irreducible Polynomials Giorgos N. Kapetanakis (joint work with T. Garefalakis) University of Crete Fq10 July 14, 2011 Giorgos Kapetanakis (Crete) On
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationImaginary quadratic fields with noncyclic ideal class groups
Imaginary quadratic fields with noncyclic ideal class groups Dongho Byeon School of Mathematical Sciences, Seoul National University, Seoul, Korea e-mail: dhbyeon@math.snu.ac.kr Abstract. Let g be an odd
More informationON THE DIVISOR FUNCTION IN SHORT INTERVALS
ON THE DIVISOR FUNCTION IN SHORT INTERVALS Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy danilo.bazzanella@polito.it Autor s version Published in Arch. Math. (Basel) 97 (2011),
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 informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationON MONOCHROMATIC ASCENDING WAVES. Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 13346
INTEGERS: Electronic Journal of Combinatorial Number Theory 7(), #A3 ON MONOCHROMATIC ASCENDING WAVES Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 1336
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 informationarxiv: v1 [math.nt] 4 Jun 2018
On the orbit of a post-critically finite polynomial of the form x d +c arxiv:1806.01208v1 [math.nt] 4 Jun 2018 Vefa Goksel Department of Mathematics University of Wisconsin Madison, WI 53706, USA E-mail:
More information198 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 informationON MONIC BINARY QUADRATIC FORMS
ON MONIC BINARY QUADRATIC FORMS JEROME T. DIMABAYAO*, VADIM PONOMARENKO**, AND ORLAND JAMES Q. TIGAS*** Abstract. We consider the quadratic form x +mxy +ny, where m n is a prime number. Under the assumption
More informationMath 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid
Math 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid Like much of mathematics, the history of the distribution of primes begins with Euclid: Theorem
More informationMULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x +1 PROBLEM. 1. Introduction The 3x +1iteration is given by the function on the integers for x even 3x+1
MULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x + PROBLEM ANA CARAIANI Abstract. Recently Lagarias introduced the Wild semigroup, which is intimately connected to the 3x + Conjecture. Applegate and Lagarias
More informationSQUARE 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 informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More information#A38 INTEGERS 17 (2017) ON THE PERIODICITY OF IRREDUCIBLE ELEMENTS IN ARITHMETICAL CONGRUENCE MONOIDS
#A38 INTEGERS 17 (2017) ON THE PERIODICITY OF IRREDUCIBLE ELEMENTS IN ARITHMETICAL CONGRUENCE MONOIDS Jacob Hartzer Mathematics Department, Texas A&M University, College Station, Texas jmhartzer@tamu.edu
More informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
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 informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod
More informationThe least prime congruent to one modulo n
The least prime congruent to one modulo n R. Thangadurai and A. Vatwani September 10, 2010 Abstract It is known that there are infinitely many primes 1 (mod n) for any integer n > 1. In this paper, we
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationarxiv: v1 [math.nt] 7 Sep 2015
THE ARITHMETIC OF CONSECUTIVE POLYNOMIAL SEQUENCES OVER FINITE FIELDS arxiv:1509.01936v1 [math.nt] 7 Sep 2015 DOMINGO GÓMEZ-PÉREZ, ALINA OSTAFE, AND MIN SHA Abstract. Motivated by a question of van der
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
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 informationSome New Exact van der Waerden numbers
Some New Exact van der Waerden numbers Bruce Landman Department of Mathematics University of West Georgia, Carrollton, GA 30118 landman@westga.edu Aaron Robertson Department of Mathematics Colgate University,
More informationOn primitive elements in finite fields of low characteristic
On primitive elements in finite fields of low characteristic Abhishek Bhowmick Thái Hoàng Lê September 16, 2014 Abstract We discuss the problem of constructing a small subset of a finite field containing
More informationFinite Fields. Mike Reiter
1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements
More informationRANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY
RANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY Christian Ballot Université de Caen, Caen 14032, France e-mail: ballot@math.unicaen.edu Michele Elia Politecnico di Torino, Torino 10129,
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More information