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

DOI10.4064/AA-29-2-105-111zbMATH Open0286.10030OpenAlexW963935090MaRDI QIDQ4774110FDOQ4774110

S. L. G. Choi

Publication date: 1976

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/205411

Recommendations

• Sequences with bounded l.c.m. of each pair of terms
• An Extremal Problem in Number Theory
• Sequences with bounded l.c.m. of each pair of terms II
• Sequences with bounded l.c.m. of each pair of terms, III
• scientific article; zbMATH DE number 3985346

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cited In (1)

• Extremal problems for GCDs

This page was built for publication: The largest subset in [1,n] whose integers have pairwise l.c.m. not exceeding n, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4774110)