2000 character limit reached
On a question of Luca and Schinzel over Segal-Piatetski-Shapiro sequences
Published 23 Apr 2021 in math.NT | (2104.11701v2)
Abstract: We extend to Segal-Piatetski-Shapiro sequences previous results on the Luca-Schinzel question over integral valued polynomial sequences. Namely, we prove that for any real $c$ larger than $1$ the sequence $(\sum_{m\le n} \varphi(\lfloor mc \rfloor) /\lfloor mc \rfloor)_n$ is dense modulo $1$, where $\varphi$ denotes Euler's totient function. The main part of the proof consists in showing that when $R$ is a large integer, the sequence of the residues of $\lfloor mc \rfloor$ modulo $R$ contains blocks of consecutive values which are in an arithmetic progression.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.