An Upper Bound for the Moments of a G.C.D. related to Lucas Sequences
Abstract
Let (un)n ≥ 0 be a non-degenerate Lucas sequence, given by the relation un=a1 un-1+a2 un-2. Let u(m)=lcm(m, zu(m)), for (m,a2)=1, where zu(m) is the rank of appearance of m in un. We prove that Σm>x\\ (m,a2)=11u(m)≤ (-(1/6-+o(1))( x)( x)), when x is sufficiently large in terms of , and where the o(1) depends on u. Moreover, if gu(n)=(n,un), we will show that for every k≥ 1, Σn≤ xgu(n)k≤ xk+1(-(1+o(1))( x)( 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≤ x: (n, un)>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 u(m), finding interesting results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.