Abstract

Let al <... < ak s n be a sequence of integers no one of which divides any other. It 1s not difficult to see that max k- [Et'-) [1]. Assume now that no a i divides the product of two others, then I proved that [2] (r(x) denotes the number of primes c x2/3 (1) n (x) +- l Z < max k

Citations

32	The normal number of prime factors of a number n - Hardy, Ramanujan - 1917
25	The Gaussian law of errors in the theory of additive number theoretic functions - Erdös, Kac - 1940
3	Erdös, On sequences of integers no one of which divides the product of two others and on some related problems - unknown authors - 1938
3	Erdős, Problems and results in additive number theory, Colloque sur la theorie des nombres, BruxeIles 1955, p - unknown authors
3	On a theorem of Hardy and Ramanujan - unknown authors - 1934
2	On some applications of graph theory to number theoretic problem - unknown authors - 1969
1	Erdős, Extremal problems in number theory - unknown authors