Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-23T18:56:53.334Z Has data issue: false hasContentIssue false
  • English
  • Français

The largest subset in [1,n] whose integers have pairwise l.c.m. not exceeding n

Published online by Cambridge University Press:  26 February 2010

S. L. G. Choi
S. L. G. Choi
Affiliation:
Department of Mathematics University of British ColumbiaVancouver 8, B.C. Canada
Get access

Extract

Abstract. Let g(n) denote the largest number of positive integers not exceeding n such that the l.c.m. of any two of them does not exceed n. In this paper we obtain an improvement over a previously known upper estimate for g(n).

Type
Research Article
Information
Mathematika , Volume 19 , Issue 2 , December 1972 , pp. 221 - 230
Copyright
Copyright © University College London 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Erdós, P., “Extremal problems in number theory.” Theory of Numbers, Proceedings of Symposia in Pure Mathematics (Volume VIII), pp. 181–189 of the American Mathematical Society (Providence, R.I., 1965).CrossRefGoogle Scholar
2.Erdós, P., “Quelque problèmes de la théorie des nombres.” Monographies de l'Enseignement Mathematique No. 6, Genive.Google Scholar