Sequences of Integers

  • Paul Erdős
  • János Surányi
Part of the Undergraduate Texts in Mathematics book series (UTM)


Certain sequences of numbers, as well as problems relating to them, appear throughout mathematics. Determining the general term of an arithmetic or geometric progression, as well as determining the sum of (finitely) many consecutive terms of these sequences, are common high school problems. A residue class for a given modulus also constitutes an arithmetic progression. In Chapter 2 various problems relating to both disjoint Systems of congruences as well as covering Systems of congruences for different moduli were discussed; many of these are still unsolved.


Prime Divisor Arithmetic Progression Infinite Sequence Residue Class Primitive Root 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 3.
    For further reading on the Fibonacci numbers, we refer the reader to N. N. Vorobev: The Fibonacci Numbers, Heath, Boston, 1963. (This is a translation from the Russian.)Google Scholar
  2. 4.
    Even a rough survey of these topics would considerably surpass the framework of this book, and instead we refer the interested reader to S. Singh: Fermat’s Enigma, Walker & Co. New York, 1997.zbMATHGoogle Scholar
  3. 5.
    P. Erdős, P. Turán: American Math. Monthly 41 (1934), pp. 608–611. There they have 3 · 2k−1 for our 2k + 1.CrossRefGoogle Scholar
  4. 6.
    K. Győry, C. L. Stewart, R. Tijdeman: Compositio Math. 59 (1986), pp. 81–89.MathSciNetGoogle Scholar
  5. 7.
    P. Erdős, C. L. Stewart, R. Tijdeman: Compositio Math. 66 (1988), pp. 1–71.Google Scholar
  6. 8.
    K. Győry, A. Sárközy, C. L. Stewart: Acta Arithmetica 74 (1996), pp. 365–385.MathSciNetGoogle Scholar
  7. 9.
    Compare these with P. Turán: Középisk. Mat. Lapok, new series 8 (1954), pp. 33–41 (in Hungarian).Google Scholar
  8. 10.
    F. Behrend: Journal London Math. Soc. 10 (1935), pp. 42–44. P. Erdős: ibid. 10 (1935) pp. 126–128. In both references, upper bounds are given to sums of the elements, from which it follows that the lower density is 0.CrossRefGoogle Scholar
  9. 11.
    A. S. Besicovitch: Math. Annalen 110 (1934), pp. 336–341.MathSciNetCrossRefGoogle Scholar
  10. 12.
    B. L. Van der Waerden: Nieuw Arch. Wisk. 15 (1927), pp. 212–216.Google Scholar
  11. 13.
    E. Szemerédi: Acta Arithmetica 27 (1975), pp. 199–245. The earlier literature is referred to here.MathSciNetzbMATHGoogle Scholar
  12. 14.
    H. Furstenberg: Journ. Analyse Mat., 31 (1977), pp. 204–256.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 15.
    H. Furstenberg, Y. Katznelson, D.S. Ornstein: Proc. Symp. Pure Math. (39 1980, pp. 217–242.Google Scholar
  14. 16.
    S. Sidon: Math. Annalen 106 (1932), pp. 536–539. For results on S-sequences see P. ErdőS, A. Sárközy, and V. T. Sós: Journ. of Number Theory 47 (1994), pp. 329–347.MathSciNetCrossRefGoogle Scholar
  15. 17.
    P. Erdős, P. Turán: Journ. London Math. Soc. 16 (1941), pp. 212–215.CrossRefGoogle Scholar
  16. 18.
    B. Llndström: Journ. Comb. Theory 6 (1969), pp. 211–212.CrossRefGoogle Scholar
  17. 19.
    R. C. Baker, G. Harman: Proc. London Math. Soc. (3) 72 (1996), pp. 261–280.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Paul Erdős
  • János Surányi
    • 1
  1. 1.Department of Algebra and Number TheoryEõtvõs Loránd UniversityBudapestHungary

Personalised recommendations