Premium
The largest subset in [1, n ] whose integers have pairwise l.c.m. not exceeding n
Author(s) -
Choi S. L. G.
Publication year - 1972
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579300005684
Subject(s) - mathematics , combinatorics , pairwise comparison , statistics
. 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) .