On Sequences of Integers No One of Which Divides the Product of Two Others and on Some Related Problems

@inproceedings{Erds2004OnSO,
title={On Sequences of Integers No One of Which Divides the Product of Two Others and on Some Related Problems},
author={Paul Erd{\"o}s},
year={2004}
}

The sequence of primes is both an A and a B sequence . Our A and B sequences seem of be very much more general, but our theorems show that they cannot be very much more dense than the sequence of the primes . In § 3 we chow by using the results of § 2, that if p1 <P2 < . . . < pz < n is an arbitrary sequence ofprimes such that z > c l n log log n where (log n) 2 c l is a sufficiently large absolute constant, then the products (p i 1) (p;-1) cannot all be different. In this connection I proved… CONTINUE READING