Sieving Positive Integers by Primes
- Samir Brahim Belhaouari
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 Ψ.
- Full Text: PDF
- DOI:10.5539/jmr.v11n1p17
This work is licensed under a Creative Commons Attribution 4.0 License.
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org