The moments of the logarithm of a G.C.D. related to Lucas sequences
From MaRDI portal
Publication:1651984
DOI10.1016/j.jnt.2018.03.012zbMath1444.11028OpenAlexW2802224560MaRDI QIDQ1651984
Publication date: 11 July 2018
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2318/1676272
Related Items (3)
On the greatest common divisor of n and the nth Fibonacci number, II ⋮ ON NUMBERS WITH POLYNOMIAL IMAGE COPRIME WITH THE TH TERM OF A LINEAR RECURRENCE ⋮ An upper bound for the moments of a GCD related to Lucas sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On positive integers \(n\) dividing the \(n\)th term of an elliptic divisibility sequence
- Arithmetic functions with linear recurrence sequences
- Diophantine equations with power sums and universal Hilbert sets
- Finiteness of integral values for the ratio of two linear recurrences
- An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\)
- The density of numbers \(n\) having a prescribed G.C.D. with the \(n\)th Fibonacci number
- On the greatest common divisor of \(n\) and the \(n\)th Fibonacci number
- Distribution of integral values for the ratio of two linear recurrences
- Index divisibility in dynamical sequences and cyclic orbits modulo \(p\)
- The Distribution of Self-Fibonacci Divisors
- On the sumset of the primes and a linear recurrence
- The Period, Rank, and Order of the (a, b)-Fibonacci Sequence Mod m
- On numbers n dividing the nth term of a linear recurrence
- On numbers n dividing the nth term of a Lucas sequence
- ON THE SUM OF A PRIME AND A FIBONACCI NUMBER
- Terms in elliptic divisibility sequences divisible by their indices
- Divisors of the Middle Binomial Coefficient
- My Numbers, My Friends
- Central binomial coefficients divisible by or coprime to their indices
This page was built for publication: The moments of the logarithm of a G.C.D. related to Lucas sequences
