%0 Journal Article
%T Sieving Positive Integers by Primes | Belhaouari | Journal of Mathematics Research | CCSE
%J Home | Journal of Mathematics Research | CCSE
%D 2019
%R 10.5539/jmr.v11n1p17
%X 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 ¦·
%U http://www.ccsenet.org/journal/index.php/jmr/article/view/0/38132