Almost primes of the form ⌊pc

William D. Banks, Victor Z. Guo, Igor E. Shparlinski*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


Let Pc=(⌊pc⌋)p∈P with c> 1 and c∉N, where P is the set of prime numbers, and ⌊. ⌋ is the floor function. We show that for every such c there are infinitely many members of Pc having at most R(c) prime factors, giving explicit estimates for R(c) when c is near one and also when c is large.

Original languageEnglish
Pages (from-to)423-436
Number of pages14
JournalIndagationes Mathematicae
Issue number2
Publication statusPublished - 1 Mar 2016
Externally publishedYes


  • Piatetski-Shapiro sequences
  • Primes


Dive into the research topics of 'Almost primes of the form ⌊pc⌋'. Together they form a unique fingerprint.

Cite this