P. Tiebekabe

activity

20222026

most citedOn solutions of the Diophantine equation

L_{n} + L_{m} = 3^{a}

4 citations · 8 across the 15 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.NT2026

Carmichael numbers of the form $2^{n} p^{m} + 1$ with odd exponent $m$ : refinements of a theorem of Florian Luca, a general independence lemma, and a computational study

Pagdame Tiebekabe

Florian Luca devoted the last paper of his life to the set $K$ of odd positive integers $k$ such that $2^{n} k + 1$ is a Carmichael number for some positive integer $n$ . He pr…

math.GM2026

The Diophantine equation $p^{x} + 6^{y} = z^{2 n}$ : a complete solution for half of the primes

Pagdame Tiebekabe

Let $p$ be a prime number and let $n \geq 1$ be an integer. We completely solve the exponential Diophantine equation $p^{x} + 6^{y} = z^{2 n}$ in positive integers $x, y, z$ for every prim…

math.NT2026

Powers as Fibonacci Sums

Benjamin Earp-Lynch, Simon Earp-Lynch, Omar Kihel +1

We examine the equation $y^{a} = i = 1 \sum k F_{n_{i}}$ for positive integers $y, a \geq 2$ and $k \geq 3$ . This equation can be expressed as a problem in terms of the Zeckendor…

math.GM2026

Sums of three Fibonacci numbers as concatenations of three repdigits in base $b$

Passimzouwé Dagou, Pagdame Tiebekabe, Kouèssi Norbert Adédji +1

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$ , where $b \geq 2$ is an integer. We prove that fo…

Carmichael numbers of the form 2npm+1 with odd exponent m: refinements of a theorem of Florian Luca, a general independence lemma, and a computational study

The Diophantine equation px+6y=z2n: a complete solution for half of the primes

Powers as Fibonacci Sums

Sums of three Fibonacci numbers as concatenations of three repdigits in base b

Carmichael numbers of the form $2^{n} p^{m} + 1$ with odd exponent $m$ : refinements of a theorem of Florian Luca, a general independence lemma, and a computational study

The Diophantine equation $p^{x} + 6^{y} = z^{2 n}$ : a complete solution for half of the primes

Sums of three Fibonacci numbers as concatenations of three repdigits in base $b$