Pagdame Tiebekabe

most citedOn Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.NT2023

The Diophantine equation $a (\frac{b ^{k} - 1}{b - 1}) = U_{n} - U_{m}$

P. Tiebekabe, I. Diouf, A. Tall +1

Here, we find all positive integer solutions of the Diophantine equation in the title, where $(U_{n})_{n ⩾ 0}$ is the generalized Lucas sequence $\mathcal{U}_0=0, \…

math.NT2022

On solutions of the Diophantine equation $P_{m} - L_{n} = c$

Pagdame Tiebekabe, Serge Adonsou, Ismaïla Diouf

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pill…

math.NT2022★ 2 cited

On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci

Pagdame Tiebekabe, Serge Adonsou

In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan a…

The Diophantine equation a(b−1bk−1​)=Un​−Um​

On solutions of the Diophantine equation Pm​−Ln​=c

On Pillai's problem involving two linear recurrent sequences : Padovan and Fibonacci

The Diophantine equation $a (\frac{b ^{k} - 1}{b - 1}) = U_{n} - U_{m}$

On solutions of the Diophantine equation $P_{m} - L_{n} = c$