Download PDF - Sequences with bounded l.c.m. of each pair of termsAll rights reserved. Copyright exceptions and limitations apply

ArticleOriginal scientific text

Title

Sequences with bounded l.c.m. of each pair of terms

Authors 1

Affiliations

  1. Department of Mathematics, Nanjing Normal University, Nanjing 210097, China

Bibliography

  1. S. L. G. Choi, The largest subset in [1,n] whose integers have pairwise l.c.m. not exceeding n, Mathematika 19 (1972), 221-230.
  2. S. L. G. Choi, The largest subset in [1,n] whose integers have pairwise l.c.m. not exceeding n, II, Acta Arith. 29 (1976), 105-111.
  3. P. Erdős, Problem, Mat. Lapok 2 (1951), 233.
  4. P. Erdős, Extremal problems in number theory, in: Theory of Numbers, Proc. Sympos. Pure Math. 8, Amer. Math. Soc., 1965, 181-189.
  5. R. K. Guy, Unsolved Problems in Number Theory, 2nd ed., Springer, New York, 1994.
  6. H. Halberstam and H. E. Richert, Sieve Methods, Academic Press, London, 1974.
Acta Arithmetica
1998/84/1
Export to PBN, Opens in new tab
Pages:
71-95
Main language of publication
English
Received
1997-10-07
Accepted
1997-11-10
Published
1998
Exact and natural sciences