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… Click to show full abstract
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.
               
Click one of the above tabs to view related content.