Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4672789 | Indagationes Mathematicae | 2016 | 14 Pages |
Abstract
Let Pc=(⌊pc⌋)p∈P with c>1c>1 and c∉Nc∉N, where PP is the set of prime numbers, and ⌊⋅⌋⌊⋅⌋ is the floor function. We show that for every such cc there are infinitely many members of Pc having at most R(c)R(c) prime factors, giving explicit estimates for R(c)R(c) when cc is near one and also when cc is large.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
Authors
William D. Banks, Victor Z. Guo, Igor E. Shparlinski,