2000 character limit reached
On the Euler function of linearly recurrence sequences
Published 18 May 2024 in math.NT | (2405.11256v2)
Abstract: In this paper, we show that if $(U_n){n\ge 1}$ is any nondegenerate linearly recurrent sequence of integers whose general term is up to sign not a polynomial in $n$, then the inequality $\phi(|U_n|)\ge |U{\phi(n)}|$ holds on a set of positive integers $n$ of density $1$, where $\phi$ is the Euler function. In fact, we show that the set of $n\le x$ for which the above inequality fails has counting function $O_U(x/\log x)$.
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.