arXiv · 2306.04022
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 $(\mathcal{U}_n)_{n\geqslant 0}$ is the generalized Lucas sequence $\mathcal{U}_0=0, \ \mathcal{U}_1=1$ and $\mathcal{U}_{n+1}=r \mathcal{U}_n +s \mathcal{U}_{n-1}$ with $r$ and $s$ integers such that $\Delta = r^2 +4 s >0$.
Explore related subjects
Keep this discovery
P. Tiebekabe, I. Diouf, A. Tall, K. R. Kakanou. 2023-06-06. The Diophantine equation $a \left(\frac{b^k-1}{b-1}\right) = \mathcal{U}_n-\mathcal{U}_m$. https://arxiv.org/abs/2306.04022
Cite the original work for its findings. Save a collection to share your selection of sources.