The Diophantine equation a \left(\frac{b^k-1}{b-1}\right) = \mathcal{U}_n-\mathcal{U}_m

Abstract: Here, we find all positive integer solutions of the Diophantine equation in the title, where

(m a t h c a l U_{n})_{n g e q s l a n t 0}

is the generalized Lucas sequence

m a t h c a l U_{0} = 0, m a t h c a l U_{1} = 1

and

m a t h c a l U_{n + 1} = r m a t h c a l U_{n} + s m a t h c a l U_{n - 1}

with

r

and

s

integers such that

D e l t a = r^{2} + 4 s > 0

.

This page was built for publication: The Diophantine equation $a \left(\frac{b^k-1}{b-1}\right) = \mathcal{U}_n-\mathcal{U}_m$