Khady Faye

collaborators

3 papers

math.NT2026

Tribonacci numbers that are palindromic concatenations of two distinct repdigits

Khady Faye, Bernadette Faye

Let $(T_{n})_{n \geq 1}$ be the Tribonacci sequence, defined by $T_{1} = T_{2} = 1$ , $T_{3} = 2$ , and $T_{n} = T_{n - 1} + T_{n - 2} + T_{n - 3}$ for $n \geq 4$ . In this paper, we study the Tribonacci numbers whose…

math.NT2026

On concatenations of two $k$ -generalized Pell numbers

Cherif B. Deme, Kancou D. Fall, Khady Faye +1

We study the concatenation of two $k$ -generalized Pell numbers. More precisely, we determine all solutions of the equation $P_{n}^{(k)} = P_{m}^{(k)} \cdot 1 0^{d} + P_{p}^{(k)}$ , where $…

math.NT2026

Multiplicative independence in the sequence of $k$ -generalized Pell numbers

Cherif B. Deme, Kancou D. Fall, Khady Faye +1

We study multiplicative dependence between terms of the $k$-generalized Pell sequence $(P_n^{(k)})_{n\ge 2-k}$, defined by the linear recurrence \[ P_n^{(k)}=2P_{n-1}^{(k)}+P_{…

Tribonacci numbers that are palindromic concatenations of two distinct repdigits

On concatenations of two k-generalized Pell numbers

Multiplicative independence in the sequence of k-generalized Pell numbers

On concatenations of two $k$ -generalized Pell numbers

Multiplicative independence in the sequence of $k$ -generalized Pell numbers