betaFeedback

WorksMathematics

Pillai's equation between k-generalized Pell numbers and Tribonacci numbers

Abstract

For an integer k≥2k\ge2, let (Pn(k))n≥0(P_n^{(k)})_{n\ge0} be the kk-generalized Pell sequence and (Tm)m≥1(T_m)_{m\ge1} the Tribonacci sequence. We determine, for every k≥2k\ge2, all integers cc having at least two representations c=Pn(k)−Tmc=P_n^{(k)}-T_m with m≥2m\ge2. The starting point is an identity of Kılıç: Pn(k)=F2n+1P_n^{(k)}=F_{2n+1} for 0≤n≤k0\le n\le k. In the range n≤kn\le k the problem therefore becomes, for all kk at once, Pillai's equation between odd-indexed Fibonacci numbers and Tribonacci numbers, which has exactly six solutions. In the range n>kn>k we solve the problem for k=2k=2 and k=3k=3 using the exact heights of the Binet coefficients; for k≥4k\ge4 we prove a bound for nn polynomial in kk. We also use the fact that Pn(k)P_n^{(k)} is extremely close to F2n+1F_{2n+1} when kk is large to show that k≤414k\le414, and treat the remaining values one by one. For k≥4k\ge4 there are, besides the solutions common to all kk, exactly four further solutions, for k=4k=4, 55 and 99. The proofs combine Matveev's theorem with the reduction method of Dujella and Pethő.

Introduction

For a fixed integer cc, Pillai’s equation asks for all pairs of representations

c=x−y=x1−y1,(x,y)≠(x1,y1),c = x-y = x_1-y_1,\qquad(x,y)\ne(x_1,y_1),

where x,x1x,x_1 range over one sequence and y,y1y,y_1 over another. The problem originates with Pillai’s 1936–1937 study [8, 9] of ax−by=ca^x-b^y=c for fixed bases a,ba,b. In the past few years, using the development of explicit lower bounds for linear forms in complex logarithms of algebraic numbers, the same question has been studied for many pairs of linear recurrence sequences in place of ax,bya^x,b^y: Fibonacci numbers against powers of 2 or 3, Tribonacci numbers against powers of 2 [3], and Padovan numbers against Fibonacci numbers [10].

This paper is about one such pair: the kk-generalized Pell numbers Pn(k)P_n^{(k)} against the Tribonacci numbers TmT_m. Unlike the papers cited above, kk is not fixed at the outset, and this is what makes the pair interesting. A first computation already shows something unusual which is that for every k≥3k \ge3 the integer c=0c=0 has three representations,

0=P0(k)−T2=P1(k)−T3=P3(k)−T6(1=1, 2=2, 13=13),0=P_0^{(k)}-T_2=P_1^{(k)}-T_3=P_3^{(k)}-T_6 \qquad(1=1,\ 2=2,\ 13=13),

and they do not depend on kk. For k=2k=2 the third one disappears, since P3(2)=12P_3^{(2)}=12, and the same indices give instead c=−1=P3(2)−T6=P0(2)−T3c=-1=P_3^{(2)}-T_6=P_0^{(2)}-T_3. The explanation is the identity

Pn(k)=F2n+1,P_n^{(k)}=F_{2n+1},

for 0≤n≤k0\le n\le k, valid for every k≥2k\ge2, due to Kılıç [6] stating that the first k+1k+1 terms of Pn(k)P_n^{(k)} are exactly the odd-indexed Fibonacci numbers. As long as n≤kn\le k, the problem does not see kk at all, and the natural questions are how far this independence goes, and what happens once n>kn>k. This splits Pillai’s equation between kk-Pell and Tribonacci numbers into two ranges, treated in the two parts of this paper.

In Part 1, we solve the sub-problem restricted to n≤kn\le k: by the identity above this is, for every kk at once, the same fixed Diophantine equation, Pillai’s equation between odd-indexed Fibonacci numbers and Tribonacci numbers, a pair that has not, to our ends_mid=1 knowledge, been treated previously. Matveev’s theorem gives an astronomically large bound, N<9.24×1048N < 9.24 \times10^{48}; the reduction of Dujella and Pethő [4] brings it down to N≤71N \le71, and a computer search leaves six solutions, all with N≤7N \le7, as in Tiebekabe and Adonsou’s treatment [10] of the Padovan–Fibonacci case. The structure of the proof is summarized in Table 1.

In Part 2, we treat the complementary range n>kn > k, where Pn(k)≠F2n+1P_n^{(k)} \ne F_{2n+1}. This is where the difficulty lies because the field Q(γ(k),α)\mathbb{Q}(\gamma(k),\alpha) has degree up to 3k3k, and the height of the coefficient fk(γ)f_k(\gamma) grows like log⁡k\log k. For k=2k = 2 and k=3k = 3 all the algebraic numbers involved can be computed exactly, and the method of Part 1 goes through. For k≥4k \ge4, Matveev’s theorem only gives a bound n<N(k)n < \mathcal{N}(k) which grows with kk (Proposition 14.1), so the values of kk cannot simply be treated one at a time. For large kk we use the fact that the dominant root γ(k)\gamma(k) is exponentially close to φ2\varphi^2: then Pn(k)P_n^{(k)} is extremely close to F2n+1F_{2n+1} (Lemma 15.1), the linear forms live in the field Q(5,α)\mathbb{Q}(\sqrt{5},\alpha) of degree 6, independent of kk, and the reduction shows that k≤414k \le414 (Proposition 15.2). The values 4≤k≤4144 \le k \le414 are then treated one by one. A second difficulty is that the argument used for k=2,3k = 2,3 to show that the linear forms do not vanish, namely Q(γ)∩Q(α)=Q\mathbb{Q}(\gamma) \cap\mathbb{Q}(\alpha) = \mathbb{Q}, is not available for every kk; we replace it by an automorphism fixing α\alpha and moving γ\gamma.

Since T1=T2=1T_1=T_2=1, every integer c=Pn(k)−1c=P_n^{(k)}-1 has the two trivial representations with m=1m=1 and m=2m=2; as usual, we exclude them by requiring m,m1≥2m,m_1\ge2.

Throughout, (FN)N≥0(F_N)_{N\ge0} is the ordinary Fibonacci sequence, F0=0F_0=0, F1=1F_1=1, FN=FN−1+FN−2F_N=F_{N-1}+F_{N-2}, and (Tm)m≥1(T_m)_{m\ge1} is the Tribonacci sequence, T1=T2=1T_1=T_2=1, T3=2T_3=2, Tm=Tm−1+Tm−2+Tm−3T_m=T_{m-1}+T_{m-2}+T_{m-3}.

Definition 1.1. For an integer k≥2k\ge2, the kk-generalized Pell sequence (Pn(k))n≥−(k−1)(P_n^{(k)})_{n\ge-(k-1)} is defined by P−(k−1)(k)=⋯=P−1(k)=0P_{-(k-1)}^{(k)}=\cdots=P_{-1}^{(k)}=0, P0(k)=1P_0^{(k)}=1, and

Pn(k)=2Pn−1(k)+Pn−2(k)+⋯+Pn−k(k)(n≥1).P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)} \qquad(n\ge1).

For k=2k=2 this is the classical Pell sequence 1,2,5,12,29,…1,2,5,12,29,\ldots. Its characteristic polynomial is Pk(x)=xk−2xk−1−xk−2−⋯−x−1P_k(x)=x^k-2x^{k-1}-x^{k-2}-\cdots-x-1.

With this indexing, Pn(k)P_n^{(k)} is the term denoted Pn+1(k)P_{n+1}^{(k)} in [1, 6]. In all the statements below we write a solution of

c=Pn(k)−Tm=Pn1(k)−Tm1(1)c=P_n^{(k)}-T_m=P_{n_1}^{(k)}-T_{m_1} \tag*{(1)}

as (n,m,n1,m1;c)(n,m,n_1,m_1;c), normalized by n>n1≥0n>n_1\ge0 and m>m1≥2m>m_1\ge2.

Theorem 1.2 (Main result, Part 1). Let k≥2k\ge2. The solutions of (1) with n≤kn\le k are exactly

$(1,3,0,2;0),, \qquad(2,4,1,2;1),, \qquad(2,5,1,4;-2)$,

and, when k≥3k\ge3, also

$(3,6,0,2;0),, \qquad(3,6,1,3;0),, \qquad(3,7,1,6;-11)$.

In particular the list does not depend on kk once $k\ge3.

Theorem 1.2 is deduced (§ 2.6) from Kılıç’s identity (Lemmas 2.6 and 2.7) together with the following self-contained result about ordinary Fibonacci and Tribonacci numbers, which is the technical heart of Part 1.

Theorem 1.3 (Key tool, Part 1). Let N>N1≥1N>N_1\ge1 be odd integers and m>m1≥2m>m_1\ge2 be integers such that

FN−Tm=FN1−Tm1.(2)F_N-T_m=F_{N_1}-T_{m_1}. \tag*{(2)}

References

  1. [1]J. J. Bravo, J. L. Herrera, F. Luca, On a generalization of the Pell sequence, Math. Bohem. 146 (2021), no. 2, 199–213.DOI
  2. [2]J. J. Bravo, J. L. Herrera, F. Luca, Common values of generalized Fibonacci and Pell sequences, J. Number Theory 226 (2021), 51–71.DOI
  3. [3]J. J. Bravo, F. Luca, K. Yazán, On Pillai’s problem with Tribonacci numbers and powers of 2, Bull. Korean Math. Soc. 54 (2017), no. 3, 1069–1080.
  4. [4]A. Dujella, A. Pethő, A generalization of a theorem of Baker and Davenport, Q. J. Math. Oxford Ser. (2) 49 (1998), no. 195, 291–306.
  5. [5]S. Guzmán Sánchez, F. Luca, Linear combinations of factorials and s-units in a binary recurrence sequence, Ann. Math. Qué. 38 (2014), no. 2, 169–188.
  6. [6]E. Kılıç, On the usual Fibonacci and generalized order-k Pell numbers, Ars Combin. 88 (2008), 33–45.
  7. [7]E. M. Matveev, An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers II, Izv. Ross. Akad. Nauk Ser. Mat. 64 (2000), no. 6, 125–180; English translation in Izv. Math. 64 (2000), no. 6, 1217–1269.
  8. [8]S. S. Pillai, On a^x − b^y = c, J. Indian Math. Soc. (N.S.) 2 (1936), 119–122.
  9. [9]S. S. Pillai, A correction to the paper “On a^x − b^y = c”, J. Indian Math. Soc. 2 (1937), 215.
  10. [10]P. Tiebekabe, S. Adonsou, On Pillai’s problem involving two linear recurrent sequences: Padovan and Fibonacci, Malaya J. Mat. 10 (2022), no. 3, 204–215; arXiv:2207.11331.

Paper details

vlnc:W_wkkmcvpc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents