On the greatest common divisor of \(n\) and the \(n\)th Fibonacci number
From MaRDI portal
Publication:1799889
DOI10.1216/RMJ-2018-48-4-1191zbMath1437.11025arXiv1704.00151OpenAlexW2604824373MaRDI QIDQ1799889
Publication date: 19 October 2018
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.00151
Distribution of integers with specified multiplicative constraints (11N25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items
The moments of the logarithm of a G.C.D. related to Lucas sequences, Greatest common divisors of shifted primes and Fibonacci numbers, On the greatest common divisor of n and the nth Fibonacci number, II, On numbers \(n\) relatively prime to the \(n\)th term of a linear recurrence, ON NUMBERS WITH POLYNOMIAL IMAGE COPRIME WITH THE TH TERM OF A LINEAR RECURRENCE, The density of numbers \(n\) having a prescribed G.C.D. with the \(n\)th Fibonacci number, An upper bound for the moments of a GCD related to Lucas sequences, The density of the terms in an elliptic divisibility sequence having a fixed G.C.D. with their indices
Uses Software
Cites Work
- The set of primes dividing the Lucas numbers has density 2/3
- Errata to: The set of primes dividing the Lucas numbers has density 2/3
- Finiteness of integral values for the ratio of two linear recurrences
- Distribution of integral values for the ratio of two linear recurrences
- On numbers \(n\) relatively prime to the \(n\)th term of a linear recurrence
- The Distribution of Self-Fibonacci Divisors
- On numbers n dividing the nth term of a linear recurrence
- On numbers n dividing the nth term of a Lucas sequence
- Divisibility properties of the Fibonacci entry point
- The large sieve
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
