M. Ddamulira

activity

20172025

most citedOn a problem of Pillai with Fibonacci numbers and powers of 2

33 citations · 37 across the 9 of their papers we have counts for

collaborators

Showing math.NTShow all

16 papers · 1 filter

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.NT2023

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

Herbert Batte, Mahadi Ddamulira, Juma Kasozi +1

Let $(L_{n}^{(k)})_{n \geq 2 - k}$ be the sequence of $k$ -generalized Lucas numbers for some fixed integer $k \geq 2$ , whose first $k$ terms are $0, \dots, 0, 2, 1$ and each term a…

math.NT2022★ 1 cited

Members of Narayana's cow sequence that are concatenations of two repdigits

Mahadi Ddamulira, Paul Emong, Geoffrey Ismail Mirumbe

Let $(N_{n})_{n \geq 0}$ be the Narayana's cow sequence defined by a third-order recurrence relation $N_{0} = 0, N_{1} = N_{2} = 1$ , and $N_{n + 3} = N_{n + 2} + N_{n}$ for all $n \geq 0$ . In this pa…

math.NT2021

Perrin numbers that are concatenations of two distinct repdigits

Herbert Batte, Taboka P. Chalebgwa, Mahadi Ddamulira

Let $(P_{n})_{n \geq 0}$ be the sequence of Perrin numbers defined by ternary relation $P_{0} = 3$ , $P_{1} = 0$ , $P_{2} = 2$ , and $P_{n + 3} = P_{n + 1} + P_{n}$ for all $n \geq 0$ . In this paper,…

math.NT2021

On the Shorey-Tijdeman Diophantine equation involving terms of Lucas sequences

Mahadi Ddamulira, Florian Luca, Robert Tichy

Let $r \geq 1$ be an integer and $U := {U_{n}}_{n \geq 0}$ be the Lucas sequence given by $U_{0} = 0, U_{1} = 1$ , and $U_{n + 2} = r U_{n + 1} + U_{n}$ for $n \geq 0$ . In this paper, we explain how to…

On concatenations of two k-generalized Lucas numbers