Mathematics > Number Theory
[Submitted on 6 May 2018 (v1), last revised 7 Jan 2019 (this version, v4)]
Title:An Upper Bound for the Moments of a G.C.D. related to Lucas Sequences
View PDFAbstract:Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that $$\sum_{\substack{m>x\\ (m,a_2)=1}}\frac{1}{\ell_u(m)}\leq \exp(-(1/\sqrt{6}-\varepsilon+o(1))\sqrt{(\log x)(\log \log x)}),$$ when $x$ is sufficiently large in terms of $\varepsilon$, and where the $o(1)$ depends on $u$. Moreover, if $g_u(n)=\gcd(n,u_n)$, we will show that for every $k\geq 1$, $$\sum_{n\leq x}g_u(n)^{k}\leq x^{k+1}\exp(-(1+o(1))\sqrt{(\log x)(\log \log x)}),$$ when $x$ is sufficiently large and where the $o(1)$ depends on $u$ and $k$. This gives a partial answer to a question posed by C. Sanna. As a by-product, we derive bounds on $#\{n\leq x: (n, u_n)>y\}$, at least in certain ranges of $y$, which strengthens what already obtained by Sanna. Finally, we start the study of the multiplicative analogous of $\ell_u(m)$, finding interesting results.
Submission history
From: Daniele Mastrostefano [view email][v1] Sun, 6 May 2018 15:01:29 UTC (9 KB)
[v2] Mon, 2 Jul 2018 12:27:19 UTC (8 KB)
[v3] Tue, 30 Oct 2018 23:33:34 UTC (10 KB)
[v4] Mon, 7 Jan 2019 15:06:20 UTC (10 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.