On Sequences Containing at Most 3 Pairwise Coprime Integers

DOI10.2307/1996477zbMath0275.10030OpenAlexW4233543032MaRDI QIDQ5183586

S. L. G. Choi

Publication date: 1973

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1996477

zbMATH Keywords

Erdős problemextremal problems

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75)

Related Items (1)

On a Conjecture of Erdös about Sets without $k$ Pairwise Coprime Integers

This page was built for publication: On Sequences Containing at Most 3 Pairwise Coprime Integers