Acta Arithmetica · 2012 · 39 citations · 12 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsNumber TheoryArithmetic FunctionsCombinatorial Number TheoryCarmichael FunctionCarmichael Numbers
We consider various arithmetic questions for the Piatetski-Shapiro sequences ⌊n c ⌋ (n = 1, 2, 3, . ..) with c > 1, c ∈ N. We exhibit a positive function θ(c) with the property that the largest prime factor of ⌊n c ⌋ exceeds n θ(c)-ε infinitely often.For c ∈ (1, 149 87 ) we show that the counting function of natural numbers nx for which ⌊n c ⌋ is squarefree satisfies the expected asymptotic formula.For c ∈ (1, 147 145 ) we show that there are infinitely many Carmichael numbers composed entirely of primes of the form p = ⌊n c ⌋. MSC Numbers: 11N25
12
Shifted primes without large prime factors
Roger C. Baker, G. Harman · Acta Arithmetica · 1998 · 132 citations · Full text
Exponential sums with monomials
Étienne Fouvry, Henryk Iwaniec · Journal of Number Theory · 1989 · 119 citations