Skip to main content

Conjectures Involving Sequences and Prime Numbers

  • Conference paper
  • First Online:
Sequences and Their Applications - SETA 2014 (SETA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8865))

Included in the following conference series:

  • 721 Accesses

Abstract

A 1992 conjecture of Golomb asserts the existence of an infinite increasing sequence \(A=\{a_n\}\) of positive integers for which each translate \(A_k=\{a_n+k\}\) of \(A=A_o\) contains no more than \(B\) primes, for some finite bound \(B\). This conjecture is inconsistent with the “Prime \(k\)-tuples Conjecture”, which asserts that for infinitely many positive integers \(n\), all \(k\) numbers \(\{n,n+a_1,n+a_2,...,n+a_{k-1}\}\) are prime, provided that there is no prime number \(q\) for which the \(k\) integers \(\{0,a_1,a_2,...,a_{k-1}\}\) occupy all \(q\) residue classes modulo \(q\). This paper discusses reasons for believing or disbelieving each of these conjectures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Golomb, S.W.: Problem 10208. Amer. Math. Mon. 99, 266 (1992)

    Google Scholar 

  2. Golomb, S.W.: Infinite sequences with finite cross-correlation. In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 430–441. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Golomb, S.W.: Infinite sequences with finite cross-correlation-II. In: Helleseth, T., Jedwab, J. (eds.) SETA 2012. LNCS, vol. 7280, pp. 110–116. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Hardy, G.H., Littlewood, J.E.: Some problems of ‘Partitio numerorum’; III: on the expression of a number as a sum of primes. Acta Math. 44(1), 1–70 (1923)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ribenboim, P.: The Little Book of Bigger Primes, 2nd edn. Springer-Verlag, New York (2004)

    MATH  Google Scholar 

Download references

Acknowledgments

1. I am grateful to Dr. Kai-Uwe Schmidt, Faculty of Mathematics, Otto-von-Guericke University, for alerting me to the references to Sidon Sequences, including his own work on this subject. 2. Discussions with Professor Barry Masur of Harvard University helped me to focus my own presentation of this material.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Solomon Golomb .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Golomb, S. (2014). Conjectures Involving Sequences and Prime Numbers. In: Schmidt, KU., Winterhof, A. (eds) Sequences and Their Applications - SETA 2014. SETA 2014. Lecture Notes in Computer Science(), vol 8865. Springer, Cham. https://doi.org/10.1007/978-3-319-12325-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12325-7_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12324-0

  • Online ISBN: 978-3-319-12325-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics