1 i<j k (g ih j g j h i ) 0.
|
|
- Camilla Stone
- 6 years ago
- Views:
Transcription
1 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 that if k is sufficiently large in terms of m, then for an admissible k-tuple H(x) = {gx+h j } k j=1 of linear forms in Z[x], the set H(n) = {gn+h j } k j=1 contains at least m primes for infinitely many n N. In this note, we deduce that H(n) = {gn+h j } k j=1 contains at least m consecutive primes for infinitely many n N. We answer an old question of Erdős and Turán by producing strings of m+1 consecutive primes whose successive gaps δ 1,..., δ m form an increasing (resp. decreasing) sequence. We also show that such strings exist with δ j 1 δ j for 2 j m. For any coprime integers a and D we find arbitrarily long strings of consecutive primes with bounded gaps in the congruence class a mod D. 1. Introduction and statement of results We say that a k-tuple of linear forms in Z[x], denoted by H(x) = {g j x + h j } k j=1, is admissible if the associated polynomial f H (x) = 1 j k (g jx + h j ) has no fixed prime divisor, that is, if the inequality #{n mod p : f H (n) 0 mod p} < p holds for every prime number p. In this note we consider only k-tuples for which (1) g 1,..., g k > 0 and 1 i<j k (g ih j g j h i ) 0. One form of the Prime k-tuple Conjecture asserts that if H(x) is admissible and satisfies (1), then H(n) = {g j n + h j } k j=1 is a k-tuple of primes for infinitely many n N. Recently, Maynard [5] and Tao have made great strides towards proving this form of the Prime k-tuple Conjecture, which rests among the greatest unsolved problems in number theory. The following formulation of their remarkable theorem has been given by Granville [3, Theorem 6.2]. Date: November 8, Mathematics Subject Classification. Primary 11N36; Secondary 11A41. Key words and phrases. consecutive primes in tuples, bounded gaps between primes, Maynard Tao theorem. 1
2 2 W. D. BANKS, T. FREIBERG, AND C. L. TURNAGE-BUTTERBAUGH Theorem (Maynard Tao). For any m N with m 2 there is a number k m, depending only on m, such that the following holds for every integer k k m. If {g j x + h j } k j=1 is admissible and satisfies (1), then {g j n + h j } k j=1 contains m primes for infinitely many n N. In fact, one can take k m to be any number such that k m log k m > e 8m+4. Zhang [10, Theorem 1] was the first to prove that lim inf n (p n+1 p n ) is bounded; he showed that for an admissible k-tuple H(x) = {x + b j } k j=1 there exist infinitely many integers n such that H(n) contains at least two primes, provided that k Zhang s proof was subsequently refined in a polymath project [7, Theorem 2.3] to the point where one could take k 2 = 632 (at least in the case of monic linear forms). Maynard [5, Propositions 4.2, 4.3] has shown that one can take k 2 = 105 and k m = cm 2 e 4m in the Maynard Tao theorem, where c is an absolute (and effective) constant. Another polymath project [8, Theorem 3.2] has since refined Maynard s work so that one can take k 2 = 50 and k m = ce (4 28/157)m. (In [5, 8], only tuples of monic linear forms are treated explicitly, although the results should extend to general linear forms as considered in [3].) The purpose of the present note is to explain some interesting consequences of the Maynard Tao theorem. We refer the reader to the expository article [3] of Granville for the recent history and ideas leading up to this breakthrough result, as well as a discussion of its potential impact. Without doubt, this result and its proof will have numerous applications, many of which have already been given in [3]. We are grateful to Granville for pointing out to us that Corollary 2 (below) can now be proved. The following theorem establishes the existence of m-tuples that infinitely often represent strings of consecutive prime numbers. Theorem 1. Let m, k N with m 2 and k k m, where k m is as in the Maynard Tao theorem. Let b 1,..., b k be distinct integers such that {x + b j } k j=1 is admissible, and let g be any positive integer coprime with b 1 b k. Then, for some subset {h 1,..., h m } {b 1,..., b k }, there are infinitely many n N such that gn + h 1,..., gn + h m are consecutive primes. A special case of Theorem 1, with m = 2, g = 1 (and the weaker bound k ), has already been established in recent work of Pintz [6, Main Theorem], which is based on Zhang s method but uses a different argument to the one presented here. Theorem 1 (which is proved in 2) has various applications to the study of gaps between consecutive primes. To state our results, let us call a sequence
3 CONSECUTIVE PRIMES IN TUPLES 3 (δ j ) m j=1 of positive integers a run of consecutive prime gaps if δ j = d r+j = p r+j+1 p r+j (1 j m) for some natural number r, where p n denotes the n-th smallest prime. The following corollary of Theorem 1 answers an old question of Erdős and Turán[1] (see also Erdős [2] and Guy [4, A11]). Corollary 2. For every m 2 there are infinitely many runs (δ j ) m j=1 of consecutive prime gaps with δ 1 < < δ m, and infinitely many runs with δ 1 > > δ m. Moreover, in the proof (see 2) we construct infinitely many runs (δ j ) m j=1 of consecutive prime gaps with δ δ j 1 < δ j (2 j m), and infinitely many runs with δ j > δ j δ m (1 j m 1). Using a similar argument, we can impose a divisibility requirement amongst gaps between consecutive primes as well. Corollary 3. For every m 2 there are infinitely many runs (δ j ) m j=1 of consecutive prime gaps such that δ j 1 δ j for 2 j m, and infinitely many runs such that δ j+1 δ j for 1 j m 1. In the proof (see 2) we construct infinitely many runs (δ j ) m j=1 of consecutive prime gaps with δ 1 δ j 1 δ j for 2 j m, and infinitely many runs with δ m δ m 1 δ j+1 δ j for 1 j m 1. As another application of Theorem 1, in 2 we prove the following extension of a result of Shiu [9] on consecutive primes in a given congruence class. Corollary 4. Let a and D 3 be coprime integers. For every m 2, there are infinitely many r N such that p r+1 p r+2 p r+m a mod D and p r+m p r+1 DC m, where C m is a constant depending only on m. Shiu [9] attributes to Chowla the conjecture that there are infinitely many pairs of consecutive primes p r and p r+1 with p r p r+1 a mod D (see also [4, A4]), and proved the above result without the constraint p r+m p r+1 DC m.
4 4 W. D. BANKS, T. FREIBERG, AND C. L. TURNAGE-BUTTERBAUGH 2. Proofs Proof of Theorem 1. Replacing each b j with b j + gn for a suitable integer N, we can assume without loss of generality that 1 < b 1 < < b k. Let S be the set of integers t such that 1 t b k, t {b 1,..., b k }. Let {q t : t S} be distinct primes coprime to g such that t b j mod q t for all t S, 1 j k. By the Chinese remainder theorem we can find an integer a such that (2) ga + t 0 mod q t (t S), and therefore (3) ga + b j 0 mod q t (t S, 1 j k). Consider the k-tuple A(x) = {gqx + ga + b j } k j=1 where Q = t S q t. In view of (3) and the fact that gcd(g, b 1 b k ) = 1, we have gcd(gq, ga + b j ) = 1 for each j, and since {x + b j } k j=1 is admissible, it follows that the k-tuple A(x) is also admissible. Moreover, A(x) satisfies (1) (with g j = gq and h j = ga + b j ) as the integers b 1,..., b k are distinct and gq 1. For every N N, the congruences (2) and our choices of Q and a imply that g(qn + a) + t 0 mod q t (t S). Consequently, any prime number in the interval [g(qn + a) + b 1, g(qn + a)+b k ] must lie in A(n). Let m be the largest integer for which there exists a subset {h 1,..., h m } {b 1,..., b k } with the property that the numbers (4) g(qn + a) + h i (1 i m ) are simultaneously prime for infinitely many N N. Since k k m we can apply the Maynard Tao theorem with A(x) to deduce that m m. By the maximal property of m, it must be the case that for all sufficiently large N N, if the numbers in (4) are all prime, then g(qn + a) + b j is composite for every b j {b 1,..., b k } \ {h 1,..., h m }. Hence, for infinitely many N N, the interval [g(qn +a)+b 1, g(qn +a)+b k ] contains precisely m primes, namely, the numbers {gn + h i } m with n = QN + a. Proof of Corollary 2. Let m 2, and let k k m+1. Let A(x) = {x+2 j } k j=1, which is easily seen to be admissible. By Theorem 1, there exists an (m+1)- tuple B(x) = {x + 2 ν j } m+1 j=1 A(x)
5 CONSECUTIVE PRIMES IN TUPLES 5 such that B(n) is an (m + 1)-tuple of consecutive primes for infinitely many n. Here, 1 ν 1 < < ν m+1 k. For such n, writing with some integer r, we have B(n) = {n + 2 ν j } m+1 j=1 = {p r+1,..., p r+m+1 } δ j = d r+j = p r+j+1 p r+j = 2 ν j+1 2 ν j (1 j m). Then j 1 j 1 δ i = (2 ν i+1 2 ν i ) = 2 ν j 2 ν 1 < 2 ν j+1 2 ν j = δ j (2 j m). Hence, δ j 1 δ 1 + +δ j 1 < δ j for each j, which proves the first statement. To obtain runs of consecutive prime gaps with δ j > δ j δ m δ j+1, consider instead the admissible k-tuple {x 2 j } k j=1. This completes the proof. Proof of Corollary 3. Let m 2, and let k k m+1. Put Q = p k p, and define the sequence b 1,..., b k inductively as follows. Let b 1 = 0, b 2 = Q, b 3 = 2Q, and for any j 3 let Note that b j = b j 1 + (b t b s ). 1 s<t j 1 (5) (b u+1 b u ) (b v+1 b v ) (v u 1). Now put A(x) = {x + b j } k j=1, and observe that A(x) is admissible since Q divides each integer b j. By Theorem 1, there exists an (m + 1)-tuple B(x) = {x + b νj } m+1 j=1 A(x) such that B(n) is an (m + 1)-tuple of consecutive primes for infinitely many n. Here, 1 ν 1 < < ν m+1 k. For any such n, writing with some integer r, we have B(n) = {n + b νj } m+1 j=1 = {p r+1,..., p r+m+1 } δ j = d r+j = p r+j+1 p r+j = b νj+1 b νj (1 j m). Then j 1 j 1 δ i = (b νi+1 b νi ) (b t b s ) = b νj +1 b νj 1 s<t ν j
6 6 W. D. BANKS, T. FREIBERG, AND C. L. TURNAGE-BUTTERBAUGH if 2 j m. On the other hand, using (5) we see that ν j+1 1 (b νj +1 b νj ) (b i+1 b i ) = b νj+1 b νj = δ j. i=ν j Hence, δ 1 δ j 1 δ j for 2 j m, which proves the first statement. To obtain runs of consecutive prime gaps with δ m δ m 1 δ j+1 δ j for 1 j m 1, consider instead the admissible k-tuple {x b j } k j=1. The corollary is proved. Proof of Corollary 4. Let m 2, and let k k m. Let {x + a j } k j=1 be any admissible k-tuple with a 1 < < a k, and put b j = Da j + a for 1 j k; then {x + b j } k j=1 is also admissible. Since gcd(d, b j ) = gcd(d, a) = 1 for each j, we can apply Theorem 1 with g = D to conclude that there is a subset {h 1,..., h m } {b 1,..., b k } such that Dn + h 1,..., Dn + h m are consecutive primes for infinitely many n N; as such primes lie in the arithmetic progression a mod D and are contained in an interval of length b k b 1 = D(a k a 1 ), the corollary follows. Acknowledgements. CLT-B is supported by a GAANN fellowship (grant no. P200A90092). In the first draft of this manuscript, we proved Theorem 1 under the assumption that k exp(e 12m ). We thank Andrew Granville for showing that k need not be larger than the number k m in the Maynard Tao theorem and for simplifying our original proof of Theorem 1. We also thank Gergely Harcos, James Maynard, and the referee for providing helpful comments on our earlier drafts. References [1] P. Erdős and P. Turán, On some new questions on the distribution of prime numbers, Bull. Amer. Math. Soc. 54 (1948), [2] P. Erdős, On the difference of consecutive primes, Bull. Amer. Math. Soc. 54 (1948), [3] A. Granville, Primes in intervals of bounded length, Bull. Amer. Math. Soc. (to appear). [4] R. Guy, Unsolved problems in number theory, third edition, Problem Books in Mathematics, Springer Verlag, New York, [5] J. Maynard, Small gaps between primes, Ann. of Math. (2) (to appear). [6] J. Pintz, Polignac numbers, conjectures of Erdős on gaps between primes arithmetic progressions in primes, and the bounded gap conjecture, Preprint, arxiv: (2013), 14pp. [7] D. H. J. Polymath, New equidistribution estimates of Zhang type, and bounded gaps between primes, Preprint, arxiv: (2014), 165pp. [8] D. H. J. Polymath, Variants of the Selberg sieve, and bounded intervals containing many primes, Preprint, arxiv: (2014), 79pp. [9] D. K. L. Shiu, Strings of congruent primes, J. London Math. Soc. (2) 61 (2000),
7 CONSECUTIVE PRIMES IN TUPLES 7 [10] Zhang, Y. Bounded gaps between primes, Ann. of Math. (2) 179 (2014), Department of Mathematics, University of Missouri, Columbia MO, USA. address: bankswd@missouri.edu Department of Mathematics, University of Missouri, Columbia MO, USA. address: freibergt@missouri.edu Department of Mathematics, University of Mississippi, University MS, USA. address: clbutter@olemiss.edu
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationNOTES ON ZHANG S PRIME GAPS PAPER
NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for
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 informationBig doings with small g a p s
Big doings with small g a p s Paul Pollack University of Georgia AAAS Annual Meeting February 16, 2015 1 of 26 SMALL GAPS: A SHORT SURVEY 2 of 26 300 BCE Let p n denote the nth prime number, so p 1 = 2,
More informationBEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO
BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what
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 informationFermat 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 informationBounded gaps between primes
Bounded gaps between primes The American Institute of Mathematics The following compilation of participant contributions is only intended as a lead-in to the AIM workshop Bounded gaps between primes. This
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 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 information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
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 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 informationTHE CONVEX HULL OF THE PRIME NUMBER GRAPH
THE CONVEX HULL OF THE PRIME NUMBER GRAPH NATHAN MCNEW Abstract Let p n denote the n-th prime number, and consider the prime number graph, the collection of points n, p n in the plane Pomerance uses the
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 informationOn 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 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 informationSTRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER
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
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 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 information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
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 informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationMOMENTS OF PRODUCTS OF L-FUNCTIONS DISSERTATION
MOMENTS OF PRODUCTS OF L-FUNCTIONS DISSERTATION A Dissertation presented in partial fulfillment of requirements for the degree of Doctor of Philosophy in the Department of Mathematics The University of
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 informationON 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 informationOn the Infinitude of Twin-Primes Bao Qi Feng
On the Infinitude of Twin-Primes Bao Qi Feng Department of Mathematical Sciences, Kent State University at Tuscarawas 330 University Dr. NE, New Philadelphia, OH 44663, USA. Abstract In this article, we
More informationA REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES.
1 A REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES. P. LEFÈVRE, E. MATHERON, AND O. RAMARÉ Abstract. For any positive integer r, denote by P r the set of all integers γ Z having at
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 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 informationSmall gaps between primes
CRM, Université de Montréal Princeton/IAS Number Theory Seminar March 2014 Introduction Question What is lim inf n (p n+1 p n )? In particular, is it finite? Introduction Question What is lim inf n (p
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 informationarxiv: v2 [math.nt] 15 Feb 2014
ON POLIGNAC S CONJECTURE FRED B. HOLT AND HELGI RUDD arxiv:1402.1970v2 [math.nt] 15 Feb 2014 Abstract. A few years ago we identified a recursion that works directly with the gaps among the generators in
More informationPowers of 2 with five distinct summands
ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3
More informationTowards 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 informationJonathan Sondow 209 West 97th Street Apt 6F New York, NY USA
Which Partial Sums of the Taylor Series for e Are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463,...) arxiv:0709.0671v1 [math.nt] 5 Sep 2007 Jonathan Sondow 209 West 97th Street Apt 6F New
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationCovering Subsets of the Integers and a Result on Digits of Fibonacci Numbers
University of South Carolina Scholar Commons Theses and Dissertations 2017 Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers Wilson Andrew Harvey University of South Carolina
More informationON NEAR RELATIVE PRIME NUMBER IN A SEQUENCE OF POSITIVE INTEGERS. Jyhmin Kuo and Hung-Lin Fu
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 123-129, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ ON NEAR RELATIVE PRIME NUMBER IN A SEQUENCE OF POSITIVE INTEGERS
More informationA 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 informationRESEARCH PROBLEMS IN NUMBER THEORY
Annales Univ. Sci. Budapest., Sect. Comp. 43 (2014) 267 277 RESEARCH PROBLEMS IN NUMBER THEORY Nguyen Cong Hao (Hue, Vietnam) Imre Kátai and Bui Minh Phong (Budapest, Hungary) Communicated by László Germán
More informationTHE DIOPHANTINE EQUATION P (x) = n! AND A RESULT OF M. OVERHOLT. Florian Luca Mathematical Institute, UNAM, Mexico
GLASNIK MATEMATIČKI Vol. 37(57(2002, 269 273 THE IOPHANTINE EQUATION P (x = n! AN A RESULT OF M. OVERHOLT Florian Luca Mathematical Institute, UNAM, Mexico Abstract. In this note, we show that the ABC-conjecture
More informationON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS
ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS L. HAJDU 1 AND N. SARADHA Abstract. We study some generalizations of a problem of Pillai. We investigate the existence of an integer M such that for m M,
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 informationOptimal primitive sets with restricted primes
Optimal primitive sets with restricted primes arxiv:30.0948v [math.nt] 5 Jan 203 William D. Banks Department of Mathematics University of Missouri Columbia, MO 652 USA bankswd@missouri.edu Greg Martin
More informationOn some inequalities between prime numbers
On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationDept of Math., SCU+USTC
2015 s s Joint work with Xiaosheng Wu Dept of Math., SCU+USTC April, 2015 Outlineµ s 1 Background 2 A conjecture 3 Bohr 4 Main result 1. Background s Given a subset S = {s 1 < s 2 < } of natural numbers
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationWe only consider r finite. P. Erdős, On integers of the form 2 k +p and some related problems, Summa Brasil. Math. 2 (1950),
U niv e rsit y o f S o u th C ar o l ina e lf i las e ta b y M i cha A covering of the integers is a system of congruences x a j (mod m j ), j = 1, 2,..., r, with a j and m j integral and with m j 1, such
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationNew 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 informationGENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A52 GENERALIZATIONS OF SOME ZERO-SUM THEOREMS Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad
More informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3
ARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3 JOHN J WEBB Abstract. Let b 13 n) denote the number of 13-regular partitions of n. We study in this paper the behavior of b 13 n) modulo 3 where
More informationNOTE. On a Problem of Erdo s and Sa rko zy
Journal of Combinatorial Theory, Series A 94, 191195 (2001) doi10.1006jcta.2000.3142, available online at httpwww.idealibrary.com on NOTE On a Problem of Erdo s and Sa rko zy Tomasz Schoen Mathematisches
More informationPILLAI S CONJECTURE REVISITED
PILLAI S COJECTURE REVISITED MICHAEL A. BEETT Abstract. We prove a generalization of an old conjecture of Pillai now a theorem of Stroeker and Tijdeman) to the effect that the Diophantine equation 3 x
More informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More informationSieve theory and small gaps between primes: Introduction
Sieve theory and small gaps between primes: Introduction Andrew V. Sutherland MASSACHUSETTS INSTITUTE OF TECHNOLOGY (on behalf of D.H.J. Polymath) Explicit Methods in Number Theory MATHEMATISCHES FORSCHUNGSINSTITUT
More informationSmall prime gaps. Kevin A. Broughan. December 7, University of Waikato, Hamilton, NZ
Small prime gaps Kevin A. Broughan University of Waikato, Hamilton, NZ kab@waikato.ac.nz December 7, 2017 Abstract One of the more spectacular recent advances in analytic number theory has been the proof
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 informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Nov 13, 2014 Quiz announcement The second quiz will be held on Thursday,
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 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 informationarxiv: v6 [math.nt] 6 Nov 2015
arxiv:1406.0429v6 [math.nt] 6 Nov 2015 Periodicity related to a sieve method of producing primes Haifeng Xu, Zuyi Zhang, Jiuru Zhou November 9, 2015 Abstract In this paper we consider a slightly different
More informationTHE DISTRIBUTION OF ROOTS OF A POLYNOMIAL. Andrew Granville Université de Montréal. 1. Introduction
THE DISTRIBUTION OF ROOTS OF A POLYNOMIAL Andrew Granville Université de Montréal 1. Introduction How are the roots of a polynomial distributed (in C)? The question is too vague for if one chooses one
More informationFour Basic Sets. Divisors
Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or
More informationAN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS
AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k
More informationWhen Sets Can and Cannot Have Sum-Dominant Subsets
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.8.2 When Sets Can and Cannot Have Sum-Dominant Subsets Hùng Việt Chu Department of Mathematics Washington and Lee University Lexington,
More informationLecture 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 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 informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationSplitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field.
Splitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field. Eric Schmutz Mathematics Department, Drexel University,Philadelphia, Pennsylvania, 19104. Abstract Let M n be
More informationA REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES
Acta Math. Hungar., 143 (1) (2014), 75 80 DOI: 10.1007/s10474-014-0408-2 Acta Math. Hungar. First published online March 27, DOI: 2014 0 75 A REMARK ON THE GEOMETRY OF SPACES OF FUNCTIONS WITH PRIME FREQUENCIES
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
More information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
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 informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationON THE DIOPHANTINE FROBENIUS PROBLEM
PORTUGALIAE MATHEMATICA Vol. 55 Fasc. 4 1998 ON THE DIOPHANTINE FROBENIUS PROBLEM Y.O. Hamidoune Abstract: Let X N be a finite subset such that gcdx = 1. The Frobenius number of X denoted by GX is the
More informationCarmichael 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 informationA SHARP RESULT ON m-covers. Hao Pan and Zhi-Wei Sun
Proc. Amer. Math. Soc. 35(2007), no., 355 3520. A SHARP RESULT ON m-covers Hao Pan and Zhi-Wei Sun Abstract. Let A = a s + Z k s= be a finite system of arithmetic sequences which forms an m-cover of Z
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 informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationLECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS
LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS 1. The Chinese Remainder Theorem We now seek to analyse the solubility of congruences by reinterpreting their solutions modulo a composite
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
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 informationAlmost perfect powers in consecutive integers (II)
Indag. Mathem., N.S., 19 (4), 649 658 December, 2008 Almost perfect powers in consecutive integers (II) by N. Saradha and T.N. Shorey School of Mathematics, Tata Institute of Fundamental Research, Homi
More informationJournal of Number Theory
Journal of Number Theory 130 (2010) 1737 1749 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt A binary linear recurrence sequence of composite numbers Artūras
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 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 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 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 informationChris Smyth School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3JZ, UK.
THE DIVISIBILITY OF a n b n BY POWERS OF n Kálmán Győry Institute of Mathematics, University of Debrecen, Debrecen H-4010, Hungary. gyory@math.klte.hu Chris Smyth School of Mathematics and Maxwell Institute
More informationarxiv:math/ v1 [math.nt] 9 Feb 1998
ECONOMICAL NUMBERS R.G.E. PINCH arxiv:math/9802046v1 [math.nt] 9 Feb 1998 Abstract. A number n is said to be economical if the prime power factorisation of n can be written with no more digits than n itself.
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 information