pith. sign in

arxiv: 1203.5884 · v1 · pith:LYYRK7CDnew · submitted 2012-03-27 · 🧮 math.NT

Piatetski-Shapiro sequences

classification 🧮 math.NT
keywords functioninfinitelynumberspiatetski-shapirosequencestfracthetaarithmetic
0
0 comments X
read the original abstract

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 $\theta(c)$ with the property that the largest prime factor of $\fl{n^c}$ exceeds $n^{\theta(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}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.