On arithmetic progressions in Lucas sequences
From MaRDI portal
Publication:5364147
zbMATH Open1371.11040arXiv1703.06722MaRDI QIDQ5364147FDOQ5364147
Authors: Volker Ziegler, Lajos Hajdu, M. Szikszai 
Publication date: 4 October 2017
Abstract: In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that there are only a few sequences which contain infinitely many and one can explicitly list both the sequences and the progressions in them. A more precise statement is given for sequences with dominant root.
Full work available at URL: https://arxiv.org/abs/1703.06722
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (15)
- Title not available (Why is that?)
- Coincidences in generalized Lucas sequences
- Longest arithmetic progressions of palindromes
- Geometric aspects of Lucas sequences. II
- Practical numbers in Lucas sequences
- Title not available (Why is that?)
- On arithmetic progressions in Lucas sequences. II
- Using Lucas sequences to generalize a theorem of Sierpiński
- On geometric progressions on Pell equations and Lucas sequences
- Some arithmetic functions of factorials in Lucas sequences
- On harmonic numbers and Lucas sequences
- Connection in mathematics: Lucas sequence via arithmetic progression
- Lucas sequences containing few primes
- Arithmetic progressions in the values of a quadratic polynomial
- A method for computing Lucas sequences
Uses Software
This page was built for publication: On arithmetic progressions in Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364147)
