English

Piatetski-Shapiro sequences

Number Theory 2012-03-28 v1

Abstract

We consider various arithmetic questions for the Piatetski-Shapiro sequences \flnc\fl{n^c} (n=1,2,3,...n=1,2,3,...) with c>1c>1, c∉Nc\not\in\N. We exhibit a positive function θ(c)\theta(c) with the property that the largest prime factor of \flnc\fl{n^c} exceeds nθ(c)\epsn^{\theta(c)-\eps} infinitely often. For c(1,14987)c\in(1,\tfrac{149}{87}) we show that the counting function of natural numbers nxn\le x for which \flnc\fl{n^c} is squarefree satisfies the expected asymptotic formula. For c(1,147145)c\in(1,\tfrac{147}{145}) we show that there are infinitely many Carmichael numbers composed entirely of primes of the form p=\flncp=\fl{n^c}.

Keywords

Cite

@article{arxiv.1203.5884,
  title  = {Piatetski-Shapiro sequences},
  author = {Roger C. Baker and William D. Banks and Jörg Brüdern and Igor E. Shparlinski and Andreas J. Weingartner},
  journal= {arXiv preprint arXiv:1203.5884},
  year   = {2012}
}

Comments

39 pages

R2 v1 2026-06-21T20:40:23.065Z