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

From MaRDI portal
Publication:6041332




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.



Cites work







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)