Graph explorer

Piatetski-Shapiro sequences

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

7 nodes6 linksoverview previewPiatetski-Shapiro sequences
7 nodes6 links
Piatetski-Shapiro sequences7 visible / 7 total nodes / 16 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalAuthorshipWPiatetski-Shapiro sequencespreprint / 2012ARoger C. BakerResearcherAWilliam D. BanksResearcherAJörg BrüdernResearcherAIgor E. ShparlinskiResearcherTmath.NT5493 worksAAndreas J. WeingartnerResearcher
PaperSignal 106 links

Piatetski-Shapiro sequences

preprint / 2012

Open