Abstract
In this paper we determine all Padovan numbers that are palindromic concatenations of two distinct repdigits.
Similar content being viewed by others
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
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
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 Fibonnaci 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 = \overline{\underbrace{d_1\cdots d_1}_{\ell ~\text {times}} \underbrace{d_2\cdots d_2}_{m~\text {times}}}\), times, then
Other related interesting results in this research direction include: the result of Bednaří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
Our result is the following.
Theorem 1
The only Padovan numbers which are palindromic concatenations of two distinct repdigits are
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 = {\overline{\beta }}\) given by:
where
For all \(n \ge 0\), Binet’s formula for the Padovan sequence tells us that the nth Padovan number is given by
where
The minimal polynomial of a over \({\mathbb {Z}}\) is given by
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 \}\):
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
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 \),
Furthermore, the following estimate also holds:
Lemma 1
Let \(n \ge 1\) be a positive integer. Then
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
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
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
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:
We quote the version of Baker’s theorem proved by Bugeaud, Mignotte, and Siksek ([6], Theorem 9.4).
Theorem 2
Let \(\eta _1, \ldots , \eta _t\) be positive real algebraic numbers in a real algebraic number field \({\mathbb {K}} \subset {\mathbb {R}}\) of degree D. Let \(b_1, \ldots , b_t\) be nonzero integers such that
Then
where
and
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 \(\parallel r \parallel \) the quantity \(\min \{|r - n| : n \in {\mathbb {Z}} \}\), which is the distance from r to the nearest integer.
Lemma 2
Let \(\kappa \ne 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
If \(\varepsilon > 0\), then there is no solution of the inequality
in positive integers m, n, k with
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
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\ne d_2 \in \{0,1,2, \ldots , 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
The next lemma relates the sizes of n and \(2\ell + m\).
Lemma 4
All solutions of (5) satisfy
Proof
Recall that \(\alpha ^{n-3} \le P_n \le \alpha ^{n-1}\). We note that
Taking the logarithm on both sides, we get
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
Hence,
We thus have that
where we used the fact that \(n > 1000\). Dividing both sides by \(d_1 \cdot 10^{2\ell + m}\), we get
We put
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 preceeding equation and taking absolute values, we have that
which is false. We thus have that \(\Gamma _1 \ne 0\).
With a view towards applying Theorem 2, we define the following parameters:
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
We also have that \(h(\eta _2) = h(\alpha ) = \frac{1}{3}\log \alpha \) and \(h(\eta _3) = \log 10\). Hence, we let
Thus, we deduce via Theorem 2 that
Comparing the last inequality obtained above with (6), we get
and therefore,
Step 2. We rewrite Eq. (5) as
That is,
Hence,
Dividing throughout by \((d_1 \cdot 10^\ell - (d_1-d_2))\cdot 10^{m+\ell }\), we have that
We put
As before, we have that \(\Gamma _2 \ne 0\) because this would imply that
which in turn implies that
which is false. In preparation towards applying Theorem 2, we define the following parameters:
In order to determine what \(A_1\) will be, we need to find the find the maximum of the quantities \(h(\eta _1)\) and \(|\log \eta _1|\).
We note that
where in the second last inequality above, we used (7). On the other hand, we also have that
where in the second last inequality, we used Eq. (7). We note that \(D h(\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
Comparing the last inequality with (8), we have that
Step 3. We rewrite Eq. (5) as
Therefore,
Consequently,
Let
As before, we have that \(\Gamma _3 \ne 0\) since we would have that
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
which is false. We would now like to apply Theorem 2 to \(\Gamma _3\). To this end, we let:
As in the previous cases, we can take \(B: = n\) and \(D: = 3\). We note that
Using Eqs. (7) and (9), we have that
Thus, we deduce that
We now find an upper bound for \(|\log \eta _1|\). We have that
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
Comparing the last inequality with (10), we deduce that
It follows that
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
After a simplification, we obtain the (rather loose) bound
Lemma 4 then implies that
The following lemma summarizes what we have proved thus far:
Lemma 5
All solutions to the Diophantine equation (1) satisfy
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
The inequality (6) can be rewritten as
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,
This implies that
Dividing through the above inequality by \( \log \alpha \) gives
So, we apply Lemma 2 with the quantities:
Let \(\kappa =[a_0;a_1,a_2, \ldots ]=[8; 5, 3, 3, 1, 5, 1, 8, 4, 6, 1, 4, 1, 1, 1, 9, 1, 4, 4, 9, 1, 5, \ldots ]\) 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
is such that \( q=q_{141}>6M \). Furthermore, it gives \( \varepsilon > 0.0716554 \), and thus,
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, \ldots , 9\}, ~d_1>0 \) and \( 1\le \ell \le 70 \), we return to the inequality (8) and put
From the inequality (8), we have that
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
which implies that
Dividing through by \( \log \alpha \) gives
Thus, we apply Lemma 2 with the quantities:
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,
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, \ldots , 9\}, ~d_1>0 \), \( 1\le \ell \le 69 \) and \( 1\le m\le 73 \), we return to the inequality (10) and put
From the inequality (10), we have that
Since \( n>1000 \), the right–hand side of the above inequality is less than 1/2. Thus, the above inequality implies that
which leads to
Dividing through by \( \log \alpha \) gives,
Again, we apply Lemma 2 with the quantities:
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,
Thus, we have shown that \( n\le 602 \), contradicting our assumption that \( n> 1000 \). Therefore, Theorem 1 holds. \(\square \)
References
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
Banks, W.D., Luca, F.: Concatenations with binary reccurent sequences. J. Integer Seq. 8(5), Art. 05.1.3 (2005)
Bednařík, D., Trojovská, E.: Repdigits as product of Fibonacci and Tribonacci numbers. Mathematics 8(10), 1720 (2020). https://doi.org/10.3390/math8101720
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
Bravo, J.J., Luca, F.: On a conjecture about repdigits in \( k \)-generalized Fibonacci sequences. Publ. Math. Debreceen 82(3–4), 623–639 (2013)
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)
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
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
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
Dujella, A., Pethő, A.: A generalization of a theorem of Baker and Davenport. Q. J. Math. Oxford Ser. 2 49(195), 291–306 (1998)
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
Garcíá 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)
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
Luca, F.: Fibonacci and Lucas numbers with only one distinct digit. Portugal. Math. 57(2), 243–254 (2000)
Qu, Y., Zeng, J.: Lucas numbers which are concatenations of two repdigits. Mathematics 8(8), 1360 (2020). https://doi.org/10.3390/math8081360
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
Trojovský, P.: Fibonacci numbers with a prescribed block of digits. Mathematics 8(4), 639 (2020). https://doi.org/10.3390/math8040639
Trojovský, P.: On repdigits as sums of Fibonacci and Tribonacci numbers. Symmetry 12(11), 1774 (2020). https://doi.org/10.3390/sym12111774
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”.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
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/.
About this article
Cite this article
Chalebgwa, T.P., Ddamulira, M. Padovan numbers which are palindromic concatenations of two distinct repdigits. RACSAM 115, 108 (2021). https://doi.org/10.1007/s13398-021-01047-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13398-021-01047-x