Article contents
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
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
- Copyright
- Copyright © University College London 1972
References
- 2
- Cited by