Projects per year
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.
- Piatetski-Shapiro sequences
FingerprintDive into the research topics of 'Almost primes of the form ⌊p<sup>c</sup>⌋'. Together they form a unique fingerprint.
- 1 Finished