Research work · 1973
On Sequences Containing at Most 3 Pairwise Coprime Integers
S. L. G. Choi
Transactions of the American Mathematical Society
Abstract
It has been conjectured by Erdös that the largest number of natural numbers not exceeding n from which one cannot select k + 1 k + 1 pairwise coprime integers, where k ≥ 1 k \geq 1 and n ≥ p k n \geq {p_k} , with p k {p_k} denoting the k th prime, is equal to the number of natural numbers not exceeding n which are multiples of at least one of the first k primes. It is known that the conjecture holds for k = 1 and 2. In this paper we establish the truth of the conjecture for k = 3.