Abstract
In this paper, we provide an effective and practical method to find all three term arithmetic progressions in a given Lucas sequence of the first or second kind. Our interest is the case when the sequence has a negative discriminant, since the case of positive discriminant has recently been resolved by Hajdu et al. [11]. We present a conjecture on the maximal number and length of such arithmetic progressions based on computational evidence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Journal of Number Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
