Mahadi Ddamulira

most citedOn a problem of Pillai with

k

-generalised Fibonacci numbers and powers of

2

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

collaborators

6 papers

math.NT2025

On concatenations of two $k$ -generalized Lucas numbers

Alex Behakanira Tumwesigye, Mahadi Ddamulira, Prosper Kaggwa

For an integer $ k \geq 2 $, the sequence of $ k $-generalized Lucas numbers is defined by the recurrence relation $ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} $ for…

math.NT2025

Tribonacci-Lucas numbers that are palindromic concatenations of two distinct repdigits

Mahadi Ddamulira

The Tribonacci-Lucas sequence ${S_{n}}_{n \geq 0}$ is defined by the linear recurrence relation $S_{n + 3} = S_{n + 2} + S_{n + 1} + S_{n}$ , for $n \geq 0$ , with the initial conditions $S_0…

math.NT2024

On a problem of Pillai involving S-units and Lucas numbers

Herbert Batte, Mahadi Ddamulira, Juma Kasozi +1

Let ${L_{n}}_{n \geq 0}$ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_{n} - 2^{x} 3^{y} = c$ , for $n, x, y \in Z_{\geq 0}$ . We trea…

math.NT2023

Palindromic concatenations of two distinct repdigits in Narayana's cows sequence

Mahadi Ddamulira, Paul Emong, Geoffrey Ismail Mirumbe

Let $(N_{n})_{n \geq 0}$ be Narayana's cows sequence given by a recurrence relation $N_{n + 3} = N_{n + 2} + N_{n}$ for all $n \geq 0$ , with initial conditions $N_{0} = 0$ , and $N_{1} = N_{2} = 1$ .…

math.NT2022★ 1 cited

On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime

Herbert Batte, Mahadi Ddamulira, Juma Kasozi +1

Let ${F_{n}}_{n \geq 0}$ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F, p} (c)$ for the number of distinct representations of $c$ as…

math.NT2017★ 19 cited

On a problem of Pillai with $k$ -generalised Fibonacci numbers and powers of $2$

Mahadi Ddamulira, Carlos A. Gómez, Florian Luca

For an integer $k \geq 2$ , let ${F_{n}^{(k)}}_{n \geq 0}$ be the $k$ --generalized Fibonacci sequence which starts with $0, \dots, 0, 1$ ( $k$ terms) and each term afterwar…