Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A nonaveraging set of integers with a large sum of reciprocals

Author: J. Wróblewski
Journal: Math. Comp. 43 (1984), 261-262
MSC: Primary 11B25
MathSciNet review: 744935
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A set of integers is constructed with no three elements in arithmetic progression and with a rather large sum of reciprocals.

References [Enhancements On Off] (What's this?)

  • [1] F. Behrend, "On sets of integers which contain no three terms in an arithmetic progression," Proc. Nat. Atad. Sci. U.S.A., v. 32, 1946, pp. 331-332. MR 0018694 (8:317d)
  • [2] P. Erdös, "Problems and results in combinatorial number theory," Astérisque, v. 24-25, 1975, pp. 295-310. MR 0374075 (51:10275)
  • [3] P. Erdös & P. Turan, "On some sequences of integers," J. London Math. Soc., v. 11, 1936, pp. 261-264.
  • [4] J. Gerver, "The sum of the reciprocals of a set of integers with no arithmetic progression of k terms," Proc. Amer. Math. Soc., v. 62, 1977, pp. 211-214. MR 0439796 (55:12678)
  • [5] J. Gerver & L. Ramsey, "Sets of integers with no long arithmetic progressions generated by the greedy algorithm," Math. Comp., v. 33, 1979, pp. 1353-1360. MR 537982 (80k:10053)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11B25

Retrieve articles in all journals with MSC: 11B25

Additional Information

Article copyright: © Copyright 1984 American Mathematical Society

American Mathematical Society