On the greatest common divisor of n and the nth Fibonacci number, II

From MaRDI portal
Publication:6041332

DOI10.4153/S0008439522000595zbMATH Open1529.11027arXiv2207.03521OpenAlexW4302303809MaRDI QIDQ6041332FDOQ6041332


Authors: Abhishek Jha, Carlo Sanna Edit this on Wikidata


Publication date: 26 May 2023

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Abstract: Let mathcalA be the set of all integers of the form gcd(n,Fn), where n is a positive integer and Fn denotes the nth Fibonacci number. Leonetti and Sanna proved that mathcalA has natural density equal to zero, and asked for a more precise upper bound. We prove that �egin{equation*} #�ig(mathcal{A} cap [1, x]�ig) ll frac{x log log log x}{log log x} end{equation*} for all sufficiently large x.


Full work available at URL: https://arxiv.org/abs/2207.03521




Recommendations




Cites Work


Cited In (1)





This page was built for publication: On the greatest common divisor of n and the nth Fibonacci number, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041332)