Sieving Positive Integers by Primes

Samir Brahim Behaouari

Journal of Mathematics Research, 2019, vol. 11, issue 1, 17-25

Abstract: 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 Ψ.

Keywords: sieving; prime number (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/38132/38622 (application/pdf)
http://www.ccsenet.org/journal/index.php/jmr/article/view/0/38132 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:11:y:2019:i:1:p:17

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().