# Padovan numbers which are palindromic concatenations of two distinct repdigits

Taboka P Chalebgwa, Mahadi Ddamulira

► To cite this version:

Taboka P Chalebgwa, Mahadi Ddamulira. Padovan numbers which are palindromic concatenations of two distinct repdigits. RACSAM. Real Academia de Ciencias. Serie A, Matemáticas - Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A, Matemáticas, 2021, 115 (3), 10.1007/s13398-021-01047-x. hal-02897902v2

HAL Id: hal-02897902

https://hal.science/hal-02897902v2

Submitted on 14 May 2021

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
# Padovan numbers which are palindromic concatenations of two distinct repdigits

Taboka P. Chalebgwa<fnref n="1" /> ID · Mahadi Ddamulira<fnref n="2" />,<fnref n="3" />,<fnref n="4" /> ID

Received: 5 September 2020 / Accepted: 9 April 2021

© The Author(s) 2021

## Abstract

In this paper we determine all Padovan numbers that are palindromic concatenations of two distinct repdigits.

**Keywords** Padovan numbers · Repdigits · Linear forms in logarithms · Baker–Davenport reduction method

**Mathematics Subject Classification** 11B39 · 11D61 · 11J86

## 1 Introduction

Let $(P_n)_{n \ge 0}$ be the sequence of Padovan numbers, given by $P_{n+3} = P_{n+1} + P_n$, for $n \ge 0$, where $P_0 = 0$ and $P_1 = P_2 = 1$. The first few terms of this sequence are

$$(P_n)_{n \ge 3} = \{1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, \dots\}.$$

A repdigit (in base 10) is a positive integer $N$ that has only one distinct digit. That is, the decimal expansion of $N$ takes the form

$$N = \underbrace{d \cdots d}_{\ell \text{ times}} = d \left( \frac{10^{\ell} - 1}{9} \right),$$

<footnote>Mahadi Ddamulira
mddamulira@tugraz.at; mddamulira@mpi-sws.org; mahadi.ddamulira@mak.ac.ug</footnote>

<footnote>Taboka P. Chalebgwa
chalebgt@mcmaster.ca</footnote>

<footnote n="1">¹ Department of Mathematics and Statistics, McMaster University, Hamilton, ON L8S 4K1, Canada</footnote>

<footnote n="2">² Institute of Analysis and Number Theory, Graz University of Technology, Kopernikusgasse 24/II, 8010 Graz, Austria</footnote>

<footnote n="3">³ Max Planck Institute for Software Systems, Saarland Informatics Campus, Campus E1 5, 66123 Saarbrücken, Germany</footnote>

<footnote n="4">⁴ Department of Mathematics, School of Physical Sciences, College of Natural Sciences, Makerere University, PO Box 7062, Kampala, Uganda</footnote>
for some positive integers $d$ and $\ell$ with $0 \le d \le 9$ and $\ell \ge 1$. This paper is a contribution to the rather well studied topic of Diophantine properties of certain linear recurrence sequences. More specifically, our paper is a variation on the theme focusing on representations of terms of a recurrent sequence as concatenations of members of another (possibly the same) sequence. For a general study of the results underpinning this topic, we direct the reader to the paper [2] by Luca and Banks, wherein (as a consequence of their level of generality) some ineffective (but finiteness) results were obtained on the number of terms of certain binary recurrent sequences whose digital representation consists of members of the same sequence.

In Ref. [1], the authors considered Fibonacci numbers which are concatenations of two repdigits (in base 10) and showed that the largest such number is $F_{14} = 377$. Recently, diophantine equations involving Padovan numbers and repdigits have also been studied. In Ref. [12], the authors found all repdigits that can be written as a sum of two Padovan numbers. This result was later extended to repdigits that are a sum of three Padovan numbers by the second author in Ref. [8]. In Ref. [9], in the direction similar to the one in Ref. [1], the second author considered all Padovan numbers that can be written as a concatenation of two distinct repdigits and showed that the largest such number is $P_{21} = 200$. More specifically, it was shown that if $P_n$ is a solution of the Diophantine equation $P_n = \overbrace{d_1 \cdots d_1}^{\ell \text{ times}} \overbrace{d_2 \cdots d_2}^{m \text{ times}}$, times,

then

$$P_n \in \{12, 16, 21, 28, 37, 49, 65, 86, 114, 200\}.$$

Other related interesting results in this research direction include: the result of Bednářík and Trojovská [3], the result of Boussayoud, et al. [4], the result of Bravo and Luca [5], the result of the second author [7], the result of Erduvan and Keskin [11], the result of Rayaguru and Panda [16], the results of Trojovský [17,18], and the result of Qu and Zeng [15]. A natural continuation of the result in Ref. [9] would be a characterization of *palindromic* Padovan numbers. As a first step in this direction, we (for the time being) consider the (more restrictive) Diophantine equation

$$P_n = \overbrace{d_1 \cdots d_1}^{\ell \text{ times}} \overbrace{d_2 \cdots d_2}^{m \text{ times}} \overbrace{d_1 \cdots d_1}^{\ell \text{ times}}, \\ \text{where } d_1, d_2 \in \{0, 1, 2, \dots, 9\}, \ d_1 > 0. \qquad (1)$$

Our result is the following.

**Theorem 1** *The only Padovan numbers which are palindromic concatenations of two distinct repdigits are*

$$P_n \in \{151, 616\}.$$

## 2 Preliminary results

In this section we collect some facts about Padovan numbers and other preliminary lemmas that are crucial to our main argument. This preamble to the main result is similar to the one in Ref. [9] and is included here for the sake of completeness.
## 2.1 Some properties of the Padovan numbers

Recall that the characteristic equation of the Padovan sequence is given by $\phi(x) := x^3 - x - 1 = 0$, with roots $\alpha, \beta$, and $\gamma = \bar{\beta}$ given by:

$$ \alpha = \frac{r_1 + r_2}{6} \quad \text{and} \quad \beta = \frac{-(r_1 + r_2) + i\sqrt{3}(r_1 - r_2)}{12}, $$

where

$$ r_1 = \sqrt[3]{108 + 12\sqrt{69}} \quad \text{and} \quad r_2 = \sqrt[3]{108 - 12\sqrt{69}}. $$

For all $n \ge 0$, Binet's formula for the Padovan sequence tells us that the nth Padovan number is given by

$$ P_n = a\alpha^n + b\beta^n + c\gamma^n, \quad (2) $$

where

$$ a = \frac{\alpha + 1}{(\alpha - \beta)(\alpha - \gamma)}, \quad b = \frac{\beta + 1}{(\beta - \alpha)(\beta - \gamma)}, \quad \text{and} \quad c = \frac{\gamma + 1}{(\gamma - \alpha)(\gamma - \beta)} = \bar{b}. $$

The minimal polynomial of $a$ over $\mathbb{Z}$ is given by

$$ 23x^3 - 5x - 1, $$

and its zeros are $a, b, c$ as given above. One can check that $|a|, |b|, |c| < 1$. Numerically, we have the following estimates for the quantities $\{\alpha, \beta, \gamma, a, b, c\}$:

$$ 1.32 < \alpha < 1.33, $$

$$ 0.86 < |\beta| = |\gamma| = \alpha^{-\frac{1}{2}} < 0.87, \quad (3) $$

$$ 0.54 < a < 0.55, $$

$$ 0.28 < |b| = |c| < 0.29. $$

It follows that the contribution to the right hand side of Eq. (2) due to the complex conjugate roots $\beta$ and $\gamma$ is small. More specifically, let

$$ e(n) := P_n - a\alpha^n = b\beta^n + c\gamma^n. \quad \text{Then,} \quad |e(n)| < \frac{1}{\alpha^{n/2}} \quad \text{for all } n \ge 1. \quad (4) $$

The last inequality in (4) follows from the fact that $|\beta| = |\gamma| = \alpha^{-\frac{1}{2}}$ and $|b| = |c| < 0.29$ (by (3)). That is, for any $n \ge 1$,

$$ |e(n)| = |b\beta^n + c\gamma^n| \le |b||\beta|^n + |c||\gamma|^n = |b|\alpha^{-\frac{n}{2}} + |c|\alpha^{-\frac{n}{2}} < 2 \cdot 0.29 \cdot \alpha^{-\frac{n}{2}} < \frac{1}{\alpha^{n/2}}. $$

Furthermore, the following estimate also holds:

**Lemma 1** Let $n \ge 1$ be a positive integer. Then

$$ \alpha^{n-3} \le P_n \le \alpha^{n-1}. $$

Lemma 1 follows from a simple inductive argument.

Let $\mathbb{K} := \mathbb{Q}(\alpha, \beta)$ be the splitting field of the polynomial $\phi$ over $\mathbb{Q}$. Then $[\mathbb{K} : \mathbb{Q}] = 6$ and $[\mathbb{Q}(\alpha) : \mathbb{Q}] = 3$. We note that the Galois group of $\mathbb{K}/\mathbb{Q}$ is given by

$$ \mathcal{G} := \operatorname{Gal}(\mathbb{K}/\mathbb{Q}) \cong \{(1), (\alpha\beta), (\alpha\gamma), (\beta\gamma), (\alpha\beta\gamma)\} \cong S_3. $$
Therefore, we identify the automorphisms of $\mathcal{G}$ with the permutation group of the zeroes of $\phi$. We shall find particular use for the permutation $(\alpha\beta)$, corresponding to the automorphism $\sigma : \alpha \mapsto \beta, \beta \mapsto \alpha, \gamma \mapsto \gamma$.

## 2.2 Linear forms in logarithms

Like many proofs of similar results, the crucial steps in our argument involve obtaining certain bounds on linear forms in (nonzero) logarithms. The upper bounds usually follow easily from a manipulation of the associated Binet's formula for the sequence in question. For the lower bounds, we need the celebrated Baker's theorem on linear forms in logarithms. Before stating the result, we need the definition of the (logarithmic) Weil height of an algebraic number. Let $\eta$ be an algebraic number of degree $d$ with minimal polynomial

$$P(x) = a_0 \prod_{j=1}^{d} (x - \alpha_j),$$

where the leading coefficient $a_0$ is positive and the $\alpha_j$'s are the conjugates of $\alpha$. The logarithmic height of $\eta$ is given by

$$h(\eta) := \frac{1}{d} \left( \log a_0 + \sum_{j=1}^{d} \log (\max\{|\alpha_j|, 1\}) \right).$$

Note that, if $\eta = \frac{p}{q} \in \mathbb{Q}$ is a reduced rational number with $q > 0$, then the above definition reduces to $h(\eta) = \log \max\{|p|, q\}$. We list some well known properties of the height function below, which we shall subsequently use without reference:

$$h(\eta_1 \pm \eta_2) \le h(\eta_1) + h(\eta_2) + \log 2,$$

$$h(\eta_1 \eta_2^{\pm 1}) \le h(\eta_1) + h(\eta_2),$$

$$h(\eta^s) = |s|h(\eta), \quad (s \in \mathbb{Z}).$$

We quote the version of Baker's theorem proved by Bugeaud, Mignotte, and Siksek ([6], Theorem 9.4).

**Theorem 2** Let $\eta_1, \dots, \eta_t$ be positive real algebraic numbers in a real algebraic number field $K \subset \mathbb{R}$ of degree $D$. Let $b_1, \dots, b_t$ be nonzero integers such that

$$\Gamma := \eta_1^{b_1} \dots \eta_t^{b_t} - 1 \neq 0.$$

Then

$$\log |\Gamma| > -1.4 \cdot 30^{t+3} \cdot t^{4.5} \cdot D^2(1 + \log D)(1 + \log B)A_1 \dots A_t,$$

where

$$B \ge \max\{|b_1|, \dots, |b_t|\}$$

and

$$A_j \ge \max\{Dh(\eta_j), |\log \eta_j|, 0.16\}, \quad \text{for all } j = 1, \dots, t.$$
## 2.3 Baker-Davenport reduction

The bounds on the variables obtained via Baker's theorem are usually too large for any computational purposes. In order to get further refinements, we use the Baker-Davenport reduction procedure. The variant we apply here is the one due to Dujella and Pethö ([10], Lemma 5a). For a real number $r$, we denote by $\|r\|$ the quantity $\min\{|r-n| : n \in \mathbb{Z}\}$, which is the distance from $r$ to the nearest integer.

**Lemma 2** Let $\kappa \neq 0$, and $A, B, \mu$ be real numbers with $A > 0$ and $B > 1$. Let $M > 1$ be a positive integer and suppose that $\frac{p}{q}$ is a convergent of the continued fraction expansion of $\kappa$ with $q > 6M$. Let

$$ \varepsilon := \| \mu q \| - M \| \kappa q \|. $$

If $\varepsilon > 0$, then there is no solution of the inequality

$$ 0 < |m\kappa - n + \mu| < AB^{-k} $$

in positive integers $m, n, k$ with

$$ \frac{\log(Aq/\varepsilon)}{\log B} \leq k \quad \text{and} \quad m \leq M. $$

We will also need the following lemma by Gúzman Sánchez and Luca ([13], Lemma 7):

**Lemma 3** Let $r \ge 1$ and $H > 0$ be such that $H > (4r^2)^r$ and $H > L/(\log L)^r$. Then

$$ L < 2^r H (\log H)^r. $$

# 3 Proof of the main result

## 3.1 The low range

With the help of a simple computer program in Mathematica, we checked all the solutions to the Diophantine equation (1) in the ranges $d_1 \neq d_2 \in \{0, 1, 2, \dots, 9\}$, $d_1 > 0$ and $1 \le \ell, m \le n \le 1000$. We found only the solutions stated in Theorem 1. Here onwards, we assume that $n > 1000$.

## 3.2 The initial bound on $n$

We note that (1) can be rewritten as

$$ \begin{align} P_n &= \underbrace{d_1 \cdots d_1}_{\ell \text{ times}} \underbrace{d_2 \cdots d_2}_{m \text{ times}} \underbrace{d_1 \cdots d_1}_{\ell \text{ times}} \nonumber \\ &= \underbrace{d_1 \cdots d_1}_{\ell \text{ times}} \cdot 10^{\ell+m} + \underbrace{d_2 \cdots d_2}_{m \text{ times}} \cdot 10^{\ell} + \underbrace{d_1 \cdots d_1}_{\ell \text{ times}} \nonumber \\ &= \frac{1}{9} \left( d_1 \cdot 10^{2\ell+m} - (d_1 - d_2) \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^{\ell} - d_1 \right). \tag{5} \end{align} $$

The next lemma relates the sizes of $n$ and $2\ell + m$.
**Lemma 4** All solutions of (5) satisfy

$$ (2\ell + m) \log 10 - 3 < n \log \alpha < (2\ell + m) \log 10 + 1. $$

*Proof* Recall that $\alpha^{n-3} \le P_n \le \alpha^{n-1}$. We note that

$$ \alpha^{n-3} \le P_n < 10^{2\ell+m}. $$

Taking the logarithm on both sides, we get

$$ n \log \alpha < (2\ell + m) \log 10 + 3 \log \alpha. $$

Hence, $n \log \alpha < (2\ell + m) \log 10 + 1$. The lower bound follows via the same technique, upon noting that $10^{2\ell+m-1} < P_n \le \alpha^{n-1}$. $\square$

We proceed to examine (5) in three different steps as follows.

**Step 1.** From Eqs. (2) and (5), we have that

$$ 9(a\alpha^n + b\beta^n + c\gamma^n) = d_1 \cdot 10^{2\ell+m} - (d_1 - d_2) \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^\ell - d_1. $$

Hence,

$$ 9a\alpha^n - d_1 \cdot 10^{2\ell+m} = -9e(n) - (d_1 - d_2) \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^\ell - d_1. $$

We thus have that

$$ \begin{aligned} |9a\alpha^n - d_1 \cdot 10^{2\ell+m}| &= | - 9e(n) - (d_1 - d_2) \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^\ell - d_1 | \\ &\le 9\alpha^{-n/2} + 27 \cdot 10^{\ell+m} \\ &< 28 \cdot 10^{\ell+m}, \end{aligned} $$

where we used the fact that $n > 1000$. Dividing both sides by $d_1 \cdot 10^{2\ell+m}$, we get

$$ \left| \left( \frac{9a}{d_1} \right) \cdot \alpha^n \cdot 10^{-2\ell-m} - 1 \right| < \frac{28 \cdot 10^{m+\ell}}{d_1 \cdot 10^{2\ell+m}} \le \frac{28}{10^\ell}. \quad (6) $$

We put

$$ \Gamma_1 := \left( \frac{9a}{d_1} \right) \cdot \alpha^n \cdot 10^{-2\ell-m} - 1. $$

We shall compare this upper bound on $|\Gamma_1|$ with the lower bound we deduce from Theorem 2. Note that $\Gamma_1 \ne 0$, since this would imply that $a\alpha^n = \frac{d_1 \cdot 10^{2\ell+m}}{9}$. If this is the case, then applying the automorphism $\sigma$ on both sides of the preceding equation and taking absolute values, we have that

$$ \left| \frac{d_1 \cdot 10^{2\ell+m}}{9} \right| = |\sigma(a\alpha^n)| = |b\beta^n| < 1, $$

which is false. We thus have that $\Gamma_1 \ne 0$.

With a view towards applying Theorem 2, we define the following parameters:

$$ \eta_1 := \frac{9a}{d_1}, \quad \eta_2 := \alpha, \quad \eta_3 := 10, \quad b_1 := 1, \quad b_2 := n, \quad b_3 := -2\ell - m, \quad t := 3. $$

Since $10^{2\ell+m-1} < P_n \le \alpha^{n-1}$, we have that $2\ell + m < n$. Thus we take $B = n$. We note that $\mathbb{K} = \mathbb{Q}(\eta_1, \eta_2, \eta_3) = \mathbb{Q}(\alpha)$, since $a = \alpha(\alpha + 1)/(2\alpha + 3)$. Hence $D = [\mathbb{K} : \mathbb{Q}] = 3$.
We note that

$$h(\eta_1) = h\left(\frac{9a}{d_1}\right) \le 2h(9) + h(a) \le 2\log 9 + \frac{1}{3}\log 23 < 5.44.$$

We also have that $h(\eta_2) = h(\alpha) = \frac{1}{3}\log \alpha$ and $h(\eta_3) = \log 10$. Hence, we let

$$A_1 := 16.32, A_2 := \log \alpha, A_3 := 3 \log 10.$$

Thus, we deduce via Theorem 2 that

$$\log |\Gamma| > -1.4 \cdot 30^6 3^{4.5} 3^2 (1 + \log 3)(1 + \log n)(16.32)(\log \alpha)(3 \log 10) \\ > -1.45 \cdot 10^{30}(1 + \log n).$$

Comparing the last inequality obtained above with (6), we get

$$\ell \log 10 - \log 28 < 1.45 \cdot 10^{30}(1 + \log n),$$

and therefore,

$$\ell \log 10 < 1.46 \cdot 10^{30}(1 + \log n). \quad (7)$$

**Step 2.** We rewrite Eq. (5) as

$$9a\alpha^n - d_1 \cdot 10^{2\ell+m} + (d_1 - d_2) \cdot 10^{m+\ell} = -9e(n) + (d_1 - d_2) \cdot 10^{\ell} - d_1.$$

That is,

$$9a\alpha^n - (d_1 \cdot 10^{\ell} - (d_1 - d_2)) \cdot 10^{m+\ell} = -9e(n) + (d_1 - d_2) \cdot 10^{\ell} - d_1.$$

Hence,

$$|9a\alpha^n - (d_1 \cdot 10^{\ell} - (d_1 - d_2)) \cdot 10^{m+\ell}| = |-9e(n) + (d_1 - d_2) \cdot 10^{\ell} - d_1| \\ \le \frac{9}{\alpha^{n/2}} + 18 \cdot 10^{\ell} < 19 \cdot 10^{\ell}.$$

Dividing throughout by $(d_1 \cdot 10^{\ell} - (d_1 - d_2)) \cdot 10^{m+\ell}$, we have that

$$\left| \left( \frac{9a}{d_1 \cdot 10^{\ell} - (d_1 - d_2)} \right) \cdot \alpha^n \cdot 10^{-\ell-m} - 1 \right| < \frac{19 \cdot 10^{\ell}}{(d_1 \cdot 10^{\ell} - (d_1 - d_2)) \cdot 10^{m+\ell}} < \frac{19}{10^m}. \quad (8)$$

We put

$$\Gamma_2 := \left( \frac{9a}{d_1 \cdot 10^{\ell} - (d_1 - d_2)} \right) \cdot \alpha^n \cdot 10^{-\ell-m} - 1.$$

As before, we have that $\Gamma_2 \ne 0$ because this would imply that

$$a\alpha^n = 10^{m+\ell} \left( \frac{d_1 \cdot 10^{\ell} - (d_1 - d_2)}{9} \right),$$

which in turn implies that

$$\left| 10^{m+\ell} \left( \frac{d_1 \cdot 10^{\ell} - (d_1 - d_2)}{9} \right) \right| = |\sigma(a\alpha^n)| = |b\beta^n| < 1,$$
which is false. In preparation towards applying Theorem 2, we define the following parameters:

$$ \eta_1 := \frac{9a}{d_1 \cdot 10^{\ell} - (d_1 - d_2)}, \quad \eta_2 := \alpha, \quad \eta_3 := 10, \quad b_1 := 1, \quad b_2 := n, \quad b_3 := -\ell - m, \quad t := 3. $$

In order to determine what $A_1$ will be, we need to find the maximum of the quantities $h(\eta_1)$ and $|\log \eta_1|$.

We note that

$$ \begin{aligned} h(\eta_1) &= h \left( \frac{9a}{d_1 \cdot 10^{\ell} - (d_1 - d_2)} \right) \\ &\le h(9) + h(a) + \ell h(10) + h(d_1) + h(d_1 - d_2) + \log 2 \\ &\le 3 \log 9 + h(a) + \ell \log 10 \\ &< 3 \log 9 + \frac{1}{3} \log 23 + 1.46 \cdot 10^{30} (1 + \log n) \\ &< 1.48 \cdot 10^{30} (1 + \log n), \end{aligned} $$

where in the second last inequality above, we used (7). On the other hand, we also have that

$$ \begin{aligned} |\log \eta_1| &= \left| \log \left( \frac{9a}{d_1 \cdot 10^{\ell} - (d_1 - d_2)} \right) \right| \\ &\le \log a + \log 9 + \left| \log(d_1 \cdot 10^{\ell} - (d_1 - d_2)) \right| \\ &\le \log a + \log 9 + \log(d_1 \cdot 10^{\ell}) + \left| \log \left( 1 - \frac{d_1 - d_2}{d_1 \cdot 10^{\ell}} \right) \right| \\ &\le \ell \log 10 + \log d_1 + \log 9 + \log(0.55) + \left| \frac{|d_1 - d_2|}{d_1 \cdot 10^{\ell}} + \frac{1}{2} \left( \frac{|d_1 - d_2|}{d_1 \cdot 10^{\ell}} \right)^2 + \dots \right| \\ &\le \ell \log 10 + 3 \log 9 + \frac{1}{10^{\ell}} + \frac{1}{2 \cdot 10^{2\ell}} + \dots \\ &\le 1.46 \cdot 10^{30} (1 + \log n) + 3 \log 9 + \frac{1}{10^{\ell} - 1} \\ &< 1.48 \cdot 10^{30} (1 + \log n), \end{aligned} $$

where in the second last inequality, we used Eq. (7). We note that $Dh(\eta_1) > |\log \eta_1|$.

We thus let $A_1 := 4.44 \cdot 10^{30} (1 + \log n)$. We take $A_2 := \log \alpha$ and $A_3 := 3 \log 10$, as defined in Step 1. Similarly, we take $B := n$.

Theorem 2 then tells us that

$$ \begin{aligned} \log |\Gamma_2| &> -1.4 \cdot 30^6 \cdot 3^{4.5} \cdot 3^2 \cdot (1 + \log 3)(1 + \log n)(\log \alpha)(3 \log 10) A_1 \\ &> -2 \cdot 10^{13} (1 + \log n) A_1 > -8.88 \cdot 10^{43} (1 + \log n)^2. \end{aligned} $$

Comparing the last inequality with (8), we have that

$$ \begin{aligned} m \log 10 &< 8.88 \cdot 10^{43} (1 + \log n)^2 + \log 19 \\ &< 9 \cdot 10^{43} (1 + \log n)^2. \end{aligned} \quad (9) $$

**Step 3.** We rewrite Eq. (5) as

$$ 9a\alpha^n - d_1 \cdot 10^{2\ell+m} + (d_1 - d_2) \cdot 10^{m+\ell} - (d_1 - d_2) \cdot 10^{\ell} = -9e(n) - d_1. $$
Therefore,

$$ 
\begin{aligned}
\left| 9a\alpha^n - (d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)) \cdot 10^\ell \right| &= \left| -9e(n) - d_1 \right| \\
&\le \frac{9}{\alpha^{n/2}} + 9 < 10.
\end{aligned}
$$

Consequently,

$$ \left| \left(\frac{1}{9a}\right) (d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)) \cdot \alpha^{-n} \cdot 10^{\ell} - 1 \right| < \frac{10}{9a\alpha^n} < \frac{3}{\alpha^n}. \quad (10) $$

Let

$$ \Gamma_3 := \left[ \left( \frac{1}{9a} \right) \left( d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2) \right) \right] \cdot \alpha^{-n} \cdot 10^{\ell} - 1. $$

As before, we have that $\Gamma_3 \neq 0$ since we would have that

$$ a\alpha^n = \frac{1}{9} \left( d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2) \right) \cdot 10^\ell. $$

Applying the automorphism $\sigma$ from the Galois group $\mathcal{G}$ on both sides of the above equation and then taking absolute values, we have that

$$ \left| \frac{1}{9} \left( d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2) \right) \cdot 10^\ell \right| = |\sigma(a\alpha^n)| = |b\beta^n| < 1, $$

which is false. We would now like to apply Theorem 2 to $\Gamma_3$. To this end, we let:

$$ \eta_1 := \left[ \left( \frac{1}{9a} \right) \left( d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2) \right) \right], \eta_2 := \alpha, \eta_3 := 10, \\ b_1 := 1, b_2 := -n, b_3 := \ell, t := 3. $$

As in the previous cases, we can take $B := n$ and $D := 3$. We note that

$$ 
\begin{aligned}
h(\eta_1) &\le h(9) + h(a) + h(d_1) + (\ell + m)h(10) + h(d_1 - d_2) \\
&\quad + mh(10) + h(d_1 - d_2) + 3 \log 2 \\
&\le 5 \log 9 + \frac{\log 23}{3} + (\ell + m) \log 10 + m \log 10 \\
&\le 6 \log 9 + (\ell + m) \log 10 + m \log 10.
\end{aligned}
$$

Using Eqs. (7) and (9), we have that

$$ (\ell + m) \log 10 < 1.46 \cdot 10^{30} (1 + \log n) + 9 \cdot 10^{43} (1 + \log n)^2 < 10 \cdot 10^{43} (1 + \log n)^2. \quad (11) $$

Thus, we deduce that

$$ h(\eta_1) < 20 \cdot 10^{43} (1 + \log n)^2. $$
We now find an upper bound for $|\log \eta_1|$. We have that

$$ 
\begin{aligned}
|\log \eta_1| &= \left| \log \left( \left( \frac{1}{9a} \right) \left( d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2) \right) \right) \right| \\
&\le \log 9 + \log a + \left| \log(d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)) \right| \\
&\le 2 \log 9 + \log(d_1 \cdot 10^{\ell+m}) + \left| \log \left( 1 - \frac{(d_1 - d_2)(10^m - 1)}{d_1 \cdot 10^{\ell+m}} \right) \right| \\
&\le 3 \log 9 + (\ell+m) \log 10 + \left| \log \left( 1 - \frac{(d_1 - d_2)(10^m - 1)}{d_1 \cdot 10^{\ell+m}} \right) \right| \\
&\le 3 \log 9 + (\ell+m) \log 10 + \left| \frac{|(d_1 - d_2)(10^m - 1)|}{d_1 \cdot 10^{\ell+m}} + \frac{1}{2} \left( \frac{|(d_1 - d_2)(10^m - 1)|}{d_1 \cdot 10^{\ell+m}} \right)^2 + \dots \right| \\
&\le 3 \log 9 + (\ell+m) \log 10 + \frac{1}{10^\ell} + \frac{1}{2 \cdot 10^{2\ell}} + \dots \\
&< 3 \log 9 + (\ell+m) \log 10 + \frac{1}{10^\ell - 1} \\
&< 1.1 \cdot 10^{44} (1 + \log n)^2,
\end{aligned}
$$

where in the last inequality above, we used the bound from (11). We note that $D \cdot h(\eta_1) > |\log \eta_1|$. We thus let $A_1 := 6 \cdot 10^{44}(1 + \log n)^2$, $A_2 := \log \alpha$ and $3 \log 10$. Theorem 2 then implies that

$$ \log |\Gamma_3| > -2 \cdot 10^{13} (1 + \log n) A_1 > -1.2 \cdot 10^{58} (1 + \log n)^3. $$

Comparing the last inequality with (10), we deduce that

$$ n \log \alpha < 1.2 \cdot 10^{58} (1 + \log n)^3 + \log 3. $$

It follows that

$$ n < 5 \cdot 10^{58} (\log n)^3. $$

With the notation of Lemma 3, we let $r := 3$, $L := n$, and $H := 5 \cdot 10^{58}$ and notice that this data meets the conditions of the lemma. Applying the lemma, we have that

$$ n < 2^3 \cdot 5 \cdot 10^{58} (\log(5 \cdot 10^{58}))^3. $$

After a simplification, we obtain the (rather loose) bound

$$ n < 1.04 \cdot 10^{66}. $$

Lemma 4 then implies that

$$ 2\ell + m < 1.4 \cdot 10^{65}. $$

The following lemma summarizes what we have proved thus far:

**Lemma 5** All solutions to the Diophantine equation (1) satisfy

$$ 2\ell + m < 1.4 \cdot 10^{65} \quad \text{and} \quad n < 1.04 \cdot 10^{66}. $$
### 3.3 The reduction procedure

The bounds obtained in Lemma 5 are too large to be useful computationally. Thus, we need to reduce them. To do so, we apply Lemma 2 as follows. First, we return to the inequality (6) and put

$$z_1 := (2\ell + m) \log 10 - n \log \alpha + \log \left( \frac{d_1}{9a} \right).$$

The inequality (6) can be rewritten as

$$|\Gamma_1| = |e^{-z_1} - 1| < \frac{28}{10^\ell}.$$

If we assume that $\ell \ge 2$, then the right-hand side of the above inequality is at most $28/100 < 1/2$. The inequality $|e^z - 1| < x$ for real values of $x$ and $z$ implies that $z < 2x$. Thus,

$$|z_1| < \frac{56}{10^\ell}.$$

This implies that

$$\left| (2\ell + m) \log 10 - n \log \alpha - \log \left( \frac{9a}{d_1} \right) \right| < \frac{56}{10^\ell}.$$

Dividing through the above inequality by $\log \alpha$ gives

$$\left| (2\ell + m) \frac{\log 10}{\log \alpha} - n + \left( \frac{\log(d_1/9a)}{\log \alpha} \right) \right| < \frac{56}{10^\ell \log \alpha}.$$

So, we apply Lemma 2 with the quantities:

$$\kappa := \frac{\log 10}{\log \alpha}, \quad \mu(d_1) := \frac{\log(d_1/9a)}{\log \alpha}, \quad 1 \le d_1 \le 9, \quad A := \frac{56}{\log \alpha}, \quad B := 10.$$

Let $\kappa = [a_0; a_1, a_2, \dots] = [8; 5, 3, 3, 1, 5, 1, 8, 4, 6, 1, 4, 1, 1, 1, 9, 1, 4, 4, 9, 1, 5, \dots]$ be the continued fraction expansion of $\kappa$. We set $M := 10^{66}$ which is the upper bound on $2\ell+m$. With the help of Mathematica, we find that the convergent

$$\frac{p}{q} = \frac{p_{141}}{q_{141}} = \frac{92894276795199235673676174009251522651329656614011503595729035741839}{11344567100398997770258435239827426964781308977543724537727298754290}$$

is such that $q = q_{141} > 6M$. Furthermore, it gives $\varepsilon > 0.0716554$, and thus,

$$\ell \le \frac{\log((56/\log \alpha)q/\varepsilon)}{\log 10} < 70.$$

Therefore, we have that $\ell \le 70$. The case $\ell < 2$ also holds because $\ell < 2 < 70$.

Next, for fixed $d_1 \ne d_2 \in \{0, 1, 2, \dots, 9\}$, $d_1 > 0$ and $1 \le \ell \le 70$, we return to the inequality (8) and put

$$z_2 := (\ell + m) \log 10 - n \log \alpha + \log \left( \frac{d_1 \cdot 10^\ell - (d_1 - d_2)}{9a} \right).$$

From the inequality (8), we have that

$$|\Gamma_2| = |e^{-z_2} - 1| < \frac{19}{10^m}.$$
Assume that $m \ge 2$, then the right-hand side of the above inequality is at most $19/100 < 1/2$.
Thus, we have that

$$|z_2| < \frac{38}{10^m},$$

which implies that

$$\left| (\ell + m) \log 10 - n \log \alpha + \log \left( \frac{d_1 \cdot 10^{\ell} - (d_1 - d_2)}{9a} \right) \right| < \frac{38}{10^m}.$$

Dividing through by $\log \alpha$ gives

$$\left| (\ell + m) \frac{\log 10}{\log \alpha} - n + \frac{\log \left( \frac{d_1 \cdot 10^{\ell} - (d_1 - d_2)}{9a} \right)}{\log \alpha} \right| < \frac{38}{10^m \log \alpha}.$$

Thus, we apply Lemma 2 with the quantities:

$$\mu(d_1, d_2) := \frac{\log \left( \frac{d_1 \cdot 10^{\ell} - (d_1 - d_2)}{9a} \right)}{\log \alpha}, \quad A := \frac{38}{\log \alpha}, \quad B := 10.$$

We take the same $\kappa$ and its convergent $p/q = p_{141}/q_{141}$ as before. Since $\ell + m < 2\ell + m$, we set $M := 10^{66}$ as the upper bound on $\ell + m$. With the help of a simple computer program in Mathematica, we get that $\varepsilon > 0.0000918806$, and therefore,

$$m \le \frac{\log\left(\frac{38}{\log \alpha}q/\varepsilon\right)}{\log 10} < 73.$$

Thus, we have that $m \le 73$. The case $m < 2$ holds as well since $m < 2 < 73$. Lastly, for fixed $d_1 \ne d_2 \in \{0, 1, 2, \dots, 9\}$, $d_1 > 0$, $1 \le \ell \le 69$ and $1 \le m \le 73$, we return to the inequality (10) and put

$$z_3 := \ell \log 10 - n \log \alpha + \log \left( \frac{d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)}{9a} \right).$$

From the inequality (10), we have that

$$|\Gamma_3| = |e^{z_3} - 1| < \frac{3}{\alpha^n}.$$

Since $n > 1000$, the right-hand side of the above inequality is less than $1/2$. Thus, the above inequality implies that

$$|z_3| < \frac{6}{\alpha^n},$$

which leads to

$$\left| \ell \log 10 - n \log \alpha + \log \left( \frac{d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)}{9a} \right) \right| < \frac{6}{\alpha^n}.$$

Dividing through by $\log \alpha$ gives,

$$\left| \ell \frac{\log 10}{\log \alpha} - n + \frac{\log \left( \frac{d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)}{9a} \right)}{\log \alpha} \right| < \frac{6}{\alpha^n \log \alpha}.$$
Again, we apply Lemma 2 with the quantities:

$$ \mu(d_1, d_2) := \frac{\log\left(\frac{d_1 \cdot 10^{\ell+m} + (d_1 - d_2) \cdot 10^m - (d_1 - d_2)}{9a}\right)}{\log \alpha}, \quad A := \frac{6}{\log \alpha}, \quad B := \alpha. $$

We take the same $\kappa$ and its convergent $p/q = p_{141}/q_{141}$ as before. Since $\ell < 2\ell + m$, we choose $M := 10^{66}$ as the upper bound for $\ell$. With the help of a simple computer program in Mathematica, we get that $\varepsilon > 0.00000594012$, and thus,

$$ n \le \frac{\log\left(\frac{6/\log\alpha q/\varepsilon}{\log\alpha}\right)}{\log\alpha} < 602. $$

Thus, we have shown that $n \le 602$, contradicting our assumption that $n > 1000$. Therefore, Theorem 1 holds. □

**Acknowledgements** The authors of this paper thank the anonymous referees and the editor for the careful reading of the manuscript and the useful comments and suggestions that greatly improved the quality of presentation of the current paper.

**Funding** Open access funding provided by Austrian Science Fund (FWF). M.D. was supported by FWF projects: F05510-N26—Part of the special research program (SFB), “Quasi-Monte Carlo Methods: Theory and Applications” and W1230—“Doctoral Program Discrete Mathematics”.

## Declarations

**Conflict of interest** The authors declare that they have no conflict of interest.

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

## References

1. Alahmadi, A., Altassan, A., Luca, F., Shoaib, H.: Fibonacci numbers which are concatenations of two repdigits. Quaest. Math. 44(2), 281–290 (2021). https://doi.org/10.2989/16073606.2019.1686439

2. Banks, W.D., Luca, F.: Concatenations with binary reccurrent sequences. J. Integer Seq. 8(5), Art. 05.1.3 (2005)

3. Bednařík, D., Trojovská, E.: Repdigits as product of Fibonacci and Tribonacci numbers. Mathematics 8(10), 1720 (2020). https://doi.org/10.3390/math8101720

4. Boussayoud, A., Boughaba, S., Kerada, M., Araci, S., Acikgoz, M.: Generating functions of binary products of k-Fibonacci and orthogonal polynomials. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 113(3), 2575–2586 (2019). https://doi.org/10.1007/s13398-019-00641-4

5. Bravo, J.J., Luca, F.: On a conjecture about repdigits in k-generalized Fibonacci sequences. Publ. Math. Debreceen 82(3–4), 623–639 (2013)

6. Bugeaud, Y., Mignotte, M., Siksek, S.: Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers. Ann. Math. 163(2), 969–1018 (2006)

7. Ddamulira, M.: Tribonacci numbers that are concatenations of two repdigits. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 114(4), Paper No. 203, 10 pp (2020) https://doi.org/10.1007/s13398-020-00933-0
8. Ddamulira, M.: Repdigits as sums of three Padovan numbers. Bol. Soc. Mat. Mex. **26**(2), 247–261 (2020). https://doi.org/10.1007/s40590-019-00269-9

9. Ddamulira, M.: Padovan numbers that are concatenations of two distinct repdigits. Math. Slovaca **71**(2), 275–284 (2021). https://doi.org/10.1515/ms-2017-0467

10. Dujella, A., Pethő, A.: A generalization of a theorem of Baker and Davenport. Q. J. Math. Oxford Ser. 2 **49**(195), 291–306 (1998)

11. Erduvan, F., Keskin, R.: Lucas numbers which are concatenations of three repdigits. Results Math. **76**(1), 13 (2021). https://doi.org/10.1007/s00025-020-01314-0

12. García Lomelí, A.C., Hernández Hernández, S.: Repdigits as sums of two Padovan numbers. J. Integer Seq. **22**(2), Art. 19.2.3 (2019)

13. Gúzman Sánchez, S., Luca, F.: Linear combinations of factorials and *s*-units in a binary recurrence sequence. Ann. Math. Qué. **38**(2), 169–188 (2014). https://doi.org/10.1007/s40316-014-0025-z

14. Luca, F.: Fibonacci and Lucas numbers with only one distinct digit. Portugal. Math. **57**(2), 243–254 (2000)

15. Qu, Y., Zeng, J.: Lucas numbers which are concatenations of two repdigits. Mathematics **8**(8), 1360 (2020). https://doi.org/10.3390/math8081360

16. Rayaguru, S.G., Panda, G.K.: Balancing numbers which are concatenations of two repdigits. Bol. Soc. Mat. Mex. **26**(3), 911–919 (2020). https://doi.org/10.1007/s40590-020-00293-0

17. Trojovský, P.: Fibonacci numbers with a prescribed block of digits. Mathematics **8**(4), 639 (2020). https://doi.org/10.3390/math8040639

18. Trojovský, P.: On repdigits as sums of Fibonacci and Tribonacci numbers. Symmetry **12**(11), 1774 (2020). https://doi.org/10.3390/sym12111774

**Publisher's Note** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.