Indexed metadata

An upper bound for the moments of a GCD related to Lucas sequences

Daniele Mastrostefano

Source record

Source: Crossref

Published: Jun 1, 2019

DOI: 10.1216/rmj-2019-49-3-887

Open original source ↗

Source abstract

Let (un)n≥0(u_n)_{n \geq 0} be a non-degenerate Lucas sequence, given by the relation un=a1un−1+a2un−2u_n=a_1 u_{n-1}+a_2 u_{n-2}. Let ℓu(m)=lcm(m,zu(m))\ell _u(m)={\rm lcm}(m, z_u(m)), for (m,a2)=1(m,a_2)=1, where zu(m)z_u(m) is the rank of appearance of mm in unu_n. We prove that ∑m>x(m,a2)=11ℓu(m)≤exp⁡( ⁣−(16−ε+o(1))(log⁡x)(log⁡log⁡x)), \sum _{\substack {m>x\\ (m,a_2)=1}}\frac {1}{\ell _u(m)}\leq \exp \biggl (\!-\biggl (\frac 1{\sqrt {6}}-\varepsilon +o(1)\biggr )\sqrt {(\log x)(\log \log x)}\biggr ), when xx is sufficiently large in terms of ε\varepsilon , and where the o(1)o(1) depends on uu. Moreover, if gu(n)=gcd⁡(n,un)g_u(n)=\gcd (n,u_n), we show that for every k≥1k\geq 1, ∑n≤xgu(n)k≤xk+1exp⁡(−(1+o(1))(log⁡x)(log⁡log⁡x)), \sum _{n\leq x}g_u(n)^{k}\leq x^{k+1}\exp (-(1+o(1)) \sqrt {(\log x)(\log \log x)}), when xx is sufficiently large, and where the o(1)o(1) depends upon uu and kk. This gives a partial answer to a question posed by C. Sanna. As a by-product, we derive bounds on #{n≤x:(n,un)>y}\#\{n\leq x: (n, u_n)>y\}, at least in certain ranges of yy, which strengthens what was already obtained by Sanna. Finally, we begin the study of the multiplicative analogs of ℓu(m)\ell _u(m), finding interesting results.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

An upper bound for the moments of a GCD related to Lucas sequences — Mathematical Frontier Network