On the least common multiple of Lucas subsequences
From MaRDI portal
Publication:2867690
DOI10.4064/AA161-4-2zbMATH Open1306.11002OpenAlexW2315899171MaRDI QIDQ2867690FDOQ2867690
Authors: Shigeki Akiyama, Florian Luca 
Publication date: 20 December 2013
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa161-4-2
Recommendations
- On the least common multiple of binary linear recurrence sequences
- On the l.c.m. of shifted Lucas numbers
- Asymptotic improvements of lower bounds for the least common multiples of arithmetic pro\-gressions
- Identities and estimations involving the least common multiple of strong divisibility sequences
- Nontrivial lower bounds for the least common multiple of some finite sequences of integers
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cited In (11)
- On the l.c.m. of random terms of binary recurrence sequences
- On the least common multiple of shifted powers
- On the l.c.m. of shifted Fibonacci numbers
- Title not available (Why is that?)
- On the least common multiple of binary linear recurrence sequences
- Plus petit commun multiple des termes consécutifs d'une suite récurrente linéaire. (Least common multiple of consecutive terms of a linear recurrent sequence)
- On the gcd's of \(k\) consecutive terms of Lucas sequences
- On the sumset of binary recurrence sequences
- LCM of sequences of polynomials
- On the l.c.m. of shifted Lucas numbers
- Identities and estimations involving the least common multiple of strong divisibility sequences
This page was built for publication: On the least common multiple of Lucas subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867690)
