Projects per year
Abstract
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 language  English 

Pages (fromto)  423436 
Number of pages  14 
Journal  Indagationes Mathematicae 
Volume  27 
Issue number  2 
DOIs  
Publication status  Published  1 Mar 2016 
Externally published  Yes 
Keywords
 PiatetskiShapiro sequences
 Primes
Fingerprint
Dive into the research topics of 'Almost primes of the form ⌊p^{c}⌋'. Together they form a unique fingerprint.Projects
 1 Finished

New Applications of Additive Combinatorics in Number Theory and Graph Theory
Mans, B., Shparlinski, I., MQRES, M. & PhD Contribution (ARC), P. C.
1/01/14 → 31/12/17
Project: Research