Piatetski-Shapiro sequences
Abstract
We consider various arithmetic questions for the Piatetski-Shapiro sequences nc (n=1,2,3,...) with c>1, c∈. We exhibit a positive function θ(c) with the property that the largest prime factor of nc exceeds nθ(c)- infinitely often. For c∈(1,14987) we show that the counting function of natural numbers n x for which nc is squarefree satisfies the expected asymptotic formula. For c∈(1,147145) we show that there are infinitely many Carmichael numbers composed entirely of primes of the form p=nc.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.