Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Rocky Mountain Journ...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Project Euclid
Other literature type . 2019
Data sources: Project Euclid
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2019
Data sources: zbMATH Open
Rocky Mountain Journal of Mathematics
Article . 2019 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.48550/ar...
Article . 2018
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
versions View all 6 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

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

Authors: Mastrostefano, Daniele;

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

Abstract

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.

10 pages. The main result has been improved

Keywords

Lucas sequences, 11B39 11B37 (Primary) 11A05 11N64 (Secondary), Mathematics - Number Theory, 11B39, GCD function, 11B37, 11A05, Other results on the distribution of values or the characterization of arithmetic functions, moments of arithmetic functions, FOS: Mathematics, Fibonacci and Lucas numbers and polynomials and generalizations, Recurrences, Multiplicative structure; Euclidean algorithm; greatest common divisors, Number Theory (math.NT), 11N64

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Green
bronze