On sequences containing at most pairwise coprime integers
S. L. G. Choi
Trans. Amer. Math. Soc. 183 (1973), 437-440
Similar Articles |
Abstract: It has been conjectured by Erdös that the largest number of natural numbers not exceeding n from which one cannot select pairwise coprime integers, where and , with denoting the kth 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.
Erdős, Extremal problems in number theory, Proc.
Sympos. Pure Math., Vol. VIII, Amer. Math. Soc., Providence, R.I., 1965,
pp. 181–189. MR
- P. Erdös, Extremal problems in number theory, Proc. Sympos. Pure Math., vol. 8, Amer. Math. Soc., Providence, R. I., 1965, pp. 181-189. MR 30 #4740. MR 0174539 (30:4740)
Retrieve articles in Transactions of the American Mathematical Society
Retrieve articles in all journals
Pairwise coprime integers,
© Copyright 1973
American Mathematical Society