Piatetski-Shapiro sequences

From MaRDI portal



Abstract: We consider various arithmetic questions for the Piatetski-Shapiro sequences flnc (n=1,2,3,...) with c>1, cotinN. We exhibit a positive function heta(c) with the property that the largest prime factor of flnc exceeds nheta(c)−eps infinitely often. For cin(1,frac14987) we show that the counting function of natural numbers nlex for which flnc is squarefree satisfies the expected asymptotic formula. For cin(1,frac147145) we show that there are infinitely many Carmichael numbers composed entirely of primes of the form p=flnc.




Cited in
(42)








This page was built for publication: Piatetski-Shapiro sequences

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