Sieving Positive Integers by Primes
Let Q be a set of primes and let Ψ(x, y, Q) be the number of positive integers less than or equal to x that have no prime factors from Q exceeding the integer y. We have enhanced an asymptotic formula for Ψ(x; y; Q) after highlighting some properties of the function Ψ.
1949 ◽
Vol 62
(4)
◽
pp. 460-469
2000 ◽
Vol 157
◽
pp. 103-127
◽
Keyword(s):
1986 ◽
Vol 22
(3)
◽
pp. 289-307
◽
2020 ◽
Vol 2020
(763)
◽
pp. 1-24
Keyword(s):
1994 ◽
Vol 116
(3)
◽
pp. 385-389
◽
Keyword(s):
2016 ◽
Vol 12
(07)
◽
pp. 1725-1732
1969 ◽
Vol 10
(2)
◽
pp. 126-129
◽
Keyword(s):
2012 ◽
Vol 93
(1-2)
◽
pp. 85-90
◽
Keyword(s):