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

• Autorzy: Yong-Gao Chen
• Języki publikacji: EN

Kategorie tematyczne

• 11B83: Special sequences and polynomials

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Acta Arithmetica
• Rocznik: 1998
• Tom: 84
• Numer: 1
• Strony: 71-95

Daty

wydano

1998

otrzymano

1997-10-07

poprawiono

1997-11-10

Twórcy

autor

Yong-Gao Chen

• Department of Mathematics, Nanjing Normal University, Nanjing 210097, China

Bibliografia

• [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.