Almost primes of the form p^c

From MaRDI portal
Publication:266153

DOI10.1016/J.INDAG.2015.10.002zbMATH Open1355.11099arXiv1508.03281OpenAlexW1888688896MaRDI QIDQ266153FDOQ266153


Authors: William D. Banks, Igor E. Shparlinski, Zhenyu V. Guo Edit this on Wikidata


Publication date: 13 April 2016

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Abstract: Let {mathbb P}^c=(lfloor p^c floor)_{pin{mathbb P}} qquad (c>1, c otin {mathbb N}), where mathbbP is the set of prime numbers, and lfloorcdotfloor is the floor function. We show that for every such c there are infinitely many members of mathbbPc having at most R(c) prime factors, giving explicit estimates for R(c) when c is near one and also when c is large.


Full work available at URL: https://arxiv.org/abs/1508.03281




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Almost primes of the form \(\lfloor p^c \rfloor\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266153)