On prime powers in linear recurrence sequences

In this paper we consider the Diophantine equation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$U_n=p^x$$\end{document}Un=px where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$U_n$$\end{document}Un is a linear recurrence sequence, p is a prime number, and x is a positive integer. Under some technical hypotheses on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$U_n$$\end{document}Un, we show that, for any p outside of an effectively computable finite set of prime numbers, there exists at most one solution (n, x) to that Diophantine equation. We compute this exceptional set for the Tribonacci sequence and for the Lucas sequence plus one.


Introduction
Let U = (U n ) n≥0 be a sequence of integers satisfying a recurrence relation U n+d = s d−1 U n+d−1 + · · · + s 0 U n , n ≥ 0.  Let us assume that this linear recurrence is of order d, that is U n does not satisfy a recurrence relation for a smaller d. We denote by its characteristic polynomial. In case that all multiplicities m i are equal to 1 we call U a simple recurrence relation. If U is a simple recurrence sequence of order d we can write U n = a 1 α n 1 + a 2 α n 2 + · · · + a d α n d with a 1 , . . . , a d ∈ C\{0}. If the characteristic roots also satisfy |α 1 | > |α 2 | ≥ · · · ≥ |α d | we say that U satisfies a dominant root condition. If we even have we say that U satisfies a strong dominant root condition. We say that U satisfies the multiplicative independence condition if the numbers a 1 and α 1 are multiplicatively independent, that is that the only integral solution to a x 1 α y 1 = 1 is (x, y) = (0, 0). A sequence of special interest in this paper will be the Tribonacci sequence T = (T n ) n≥0 which is a linear recurrence sequence of order 3 given by T n+3 = T n+2 + T n+1 + T n , n ≥ 0 and T 0 = 0, T 1 = 1 and T 2 = 1. We will also have a closer look on the linear recurrence sequence L = (L n ) n≥0 also of order 3 given by L n+3 = 2L n+2 − L n , n ≥ 0 and L 0 = 3, L 1 = 2 and L 2 = 4. Note that this recurrence sequence is the classical Lucas sequenceL = (L n ) n≥0 added by 1, whereL is given bỹ L n+2 =L n+1 +L n , n ≥ 0 andL 0 = 2 andL 1 = 1. In particular, we have L n =L n + 1 and will therefore call L the added by one Lucas sequence.
There is a rich literature on Diophantine equations involving linear recurrence sequences and we refer to [7] for an overview. In this paper we will focus on Diophantine equations of the form U n = y m . In the case that U n is a binary recurrence sequence Pethő [11] and, independently, Shorey and Stewart [12] (see also [13,Chapter 9]) showed that such equations have only finitely many solutions (n, m, y) ∈ N 2 × Z with y, m > 1. In the case of higher order recurrence sequences Shorey and Stewart [12] showed that under a dominant root assumption a solution (n, y, m) to U n = y m with y, m > 1 satisfies m < C, where C is an effectively computable constant. Moreover, a recent result due to Bugeaud and Kaneko [6] implies that the equation U n = y m with y, m > 1 has at most finitely many solutions and their number can be explicitly determined.
However, for a given binary sequence U n it is a very hard task to find all solutions to U n = y m . In the case of the Fibonacci and the Lucas sequence this task was finally resolved by Bugeaud, Mignotte and Siksek [5].
In the case of recurrence sequences of higher order (satisfying a dominant root condition) the methods fail to find all solutions (n, y, m) to U n = y m with y, m > 1 and results similar to those of Pethő, Shorey and Stewart for the binary case have not been proved yet.
In this paper we are interested in the following problem. Let U = (U n ) n≥0 be a fixed sequence and P = {p 1 , . . . , p t } a finite set of primes. How many solutions (n, x 1 , . . . , x t ), with n, x 1 , . . . , x t non-negative integers does the equation U n = ±p x 1 1 · · · p x t t have? Of course the theory of S-unit equations yields a bound for the number of solutions depending only on t. These bounds are usually far from the optimal bound and do not reflect what can be expected from numerical experiments. In this paper we resolve the case that t = 1. That is we consider Diophantine equations of the form U n = p x for a fixed sequence U = (U n ) n≥0 and arbitrary, but fixed prime p. By Baker's method using lower bounds for linear forms in logarithms this equation can be solved easily for particular values for p. However, in this paper we show that up to a finite effective computable set of primes S = S(U ) the Diophantine equation U n = p x has at most one solution. More precisely we show: Then there exists an effective computable set of primes S such that the equation U n = ±p x has at most one solution (n, x) ∈ N 2 with x = 0 unless p ∈ S.
Remark 1 Let us note that the assumption that U is simple can be dropped. To avoid technical difficulties we refrain from this extension.
The set S in Theorem 1 is not only effective computable, but we can also provide an efficient algorithm to compute the set S and find all exceptional primes. We demonstrate the method by applying it to the Tribonacci sequence T and the sequence L and prove the following two theorems:

Theorem 2
The Diophantine equation T n = p x has at most one solution (n, x) with x = 0 unless p = 2. In the case that p = 2 there exist two solutions, namely T 3 = 2 and T 4 = 4.

Theorem 3
The Diophantine equation L n = p x has at most one solution (n, x) with x = 0 unless p = 2. In the case that p = 2 there exist three solutions, namely L 1 = 2, L 2 = 4 and L 4 = 8.
It is easy to see that the Tribonacci sequence T is indeed of order three, is simple and satisfies the dominant root condition but not the strong dominant root condition. However, the Tribonacci sequence satisfies the multiplicative independence condition (see also Sect. 2).
On the other hand it is easy to see that the Lucas sequence added by 1, i.e. the sequence L, is simple and of order three and satisfies the strong dominant root condition, but does not satisfy the multiplicative independence condition. Moreover let us note that a result of Shorey and Stewart [12,Theorem 4] implies that the Diophantine equation L n = y m has only finitely many solutions (n, y, m) with y, m > 1 and n even. This implies even a stronger result than stated in Theorem 3, considering only even indices n. But to our knowledge no such result is known for odd indices n and thus our result (Theorem 3) indeed complements the result due to Shorey and Stewart.
Finally let us note that Theorem 1 can be easily proved in the case that U is a Lucas-Lehmer sequence, by applying the Primitive Divisor Theorem proved by Bilu, Hanrot, and Voutier [4]. Therefore we choose the sequences T and L to avoid cases that could easily be solved by the Primitive Divisor Theorem. We also want to note that the result of Theorem 2 can easily be deduced by a result due to Gomez and Luca [8] who found all multiplicatively dependent pairs of k-generalized Fibonacci numbers. However, let us note that our proof of Theorem 2 yields an alternative approach.
In the next section we provide some useful lemmas and inequalities. In Sect. 3 we will use Baker's method to obtain upper bounds for n in the case that p is arbitrary but fixed and will therefore reprove a theorem due to Shorey and Tijdeman [12,Theorem 3]. The heart of the proof is in Sect. 4, where we show that the existence of two solutions (n 1 , x 1 ) and (n 2 , x 2 ) implies an effectively computable upper bound for n 1 . This allows us to finally prove Theorem 1. Unfortunately the absolute upper bounds are too large to successfully perform a computer search. However, in the case of the Tribonacci sequence and the Lucas sequence added by one the bound for n 1 is small enough to find small lists of possible candidates of primes p such that the Diophantine equations T n = p x and L n = p x may have two solutions. Using the upper bounds found in Sect. 3 together with the Baker-Davenport reduction (see Lemma 6) and using lower bounds for approximations by continued fractions (see Lemma 5) we find all primes p that admit more than one solution. These reduction procedures are discussed in the final Sect. 5.
Throughout the paper we will denote by C 1 , C 2 , . . . positive and effectively computable constants.

Auxiliary results
To ease the notation let us write a = a 1 and α = α 1 . Since U n is defined over the integers all roots of the characteristic polynomial are algebraic integers. Since U n is simple, of order at least two and satisfies a dominant root condition we conclude that |α| > 1 and furthermore that a and α are real. Replacing U n by (−1) n U n or (−1) n+1 U n or −U n we may also assume that both α and a are positive.
With these assumptions and notations in force there exist effective computable constants We also have thus we have x n log α log p . In case that U satisfies also a strong dominant root condition we obtain a lower bound Finally let us note that there exists N 0 such that |U n | is strictly increasing for n ≥ N 0 .
In the case of the Tribonacci sequence we can make these computations explicit. In particular, we have that T n = aα n + bβ n +bβ n .
where α, β undβ are the roots of the characteristic Polynomial X 3 − X 2 − X − 1, that is we have Note that a, b undb are computed from solving the linear system aα 0 + bβ 0 +bβ 0 = 0, Moreover, let us note that αββ = −1 and therefore |β| = |β| = |α| −1/2 . From these estimations for α and β it is clear that T n ∼ aα n . In particular we have that provided that n > 8. Note that (5) implies that x < n log α log p . Finally, let us note that the Tribonacci sequence T n is strictly increasing for n ≥ 2.
In the case of the sequence L we find the explicit formula Note that γ δ = −1 and therefore |δ| = |γ | −1 . Obviously L satisfies the strong dominant root condition but not the multiplicative independence relation. However, under the assumption that n > 10 we obtain the estimates We also have the inequality 0.99 < L n − γ n < 1.01.
Finally let us note that L n is strictly increasing for n ≥ 1. In this paper we will make extensive use of lower bounds for linear forms of logarithms of complex numbers. In particular we will use a result due to Matveev [10]. Let η = 0 be an algebraic number of degree d and let be the minimal polynomial of η. Then the absolute logarithmic Weil height is defined by In the case that η is a rational number, say η = P/Q ∈ Q with P, Q integers such that gcd(P, Q) = 1, we have h(P/Q) = max{log |P|, log |Q|}. With this basic notation we have the following result on lower bounds for linear forms in logarithms due to Matveev [10].

Lemma 1
Denote by η 1 , . . . , η m algebraic numbers, neither 0 nor 1, by log η 1 , . . ., log η m determinations of their logarithms, by D the degree over Q of the number field K = Q(η 1 , . . . , η m ), and by b 1 , . . . , b m rational integers. Furthermore let κ = 1 if K is real and κ = 2 otherwise. Choose Assume that b m = 0 and log η 1 , . . . , log η m are linearly independent over Z. Then However, in the case that the number of logarithms is m = 2 we have numerically rather good results due to Laurent [9]. In particular, we will use the following result: Lemma 2 Suppose that the numbers η 1 , η 2 , log η 1 , log η 2 are real and positive and that η 1 and η 2 are multiplicatively independent. Then for positive integers b 1 und b 2 we have In order to apply the results of Matveev and Laurent we have to know the heights of the relevant quantities and also have to ensure that they are multiplicatively independent. In the case of the Tribonacci sequence and the Lucas sequence added by one we can use Sage [14] to compute the heights of the relevant quantities and obtain To ensure the multiplicative independence of α, a and p in the case of the Tribonacci sequence and the Lucas sequence added by one the following lemma is helpful: Lemma 3 Let p be a prime, then α, a and p are multiplicatively independent and also γ and p are multiplicatively independent.
Proof Since α and γ are units and p is a prime it is obvious that α and p respectively γ and p are multiplicatively independent. Thus it remains to show that α, a and p are multiplicatively independent.
Let us note that the splitting field K = Q(α, β,β) of the characteristic polynomial X 3 − X 2 − X − 1 has class number 1. Moreover, 1/a is an algebraic integer with absolute Norm N K /Q (1/a) = 2 4 · 11 2 . That is unless p = 2 or p = 11 the lemma is proved.
However, using Sage [14] we compute the following prime ideal factorizations (1/a) = p 2 q 1 q 2 which show that α, a, 2 and 11 are multiplicatively independent and thus proving the lemma.
Also let us note the following helpful fact that can easily be proved using elementary calculus: Proof Replace x by 1 + y then the first statement is equivalent to the statement that |y| < 1/2 implies | log(1 + y)| < 3|y|/2. Thus assuming that |y| < 1/2 we have From this inequality we easily deduce both statements.
In order to reduce the huge bounds coming from the applications of the results due to Matveev and Laurent we use continued fractions. In particular, we use the following two results: Lemma 5 Assume that μ is real and irrational and has the continued fraction expansion μ = [a 0 ; a 1 , a 2 , . . . ]. Let be an integer and set A = max 1≤ j≤ {a j } and let p /q be the -th convergent to μ, then for any rational fraction p/q with q ≤ q .
Proof This follows from the inequality given in [2, page 47] combined with the best approximation property of continued fractions.
The second method is due to Baker and Davenport [3] for which we state a variant of this reduction method:

Lemma 6 Given a Diophantine inequality of the form
with positive constants c 1 , c 2 and real numbers μ and τ . Assume that n < N and that there is a real number κ > 1 such that there exists a convergent p/q to μ with where · denotes the distance to the nearest integer. Then we have Proof We consider inequality (10) and multiply it by q. Then under our assumptions we obtain Note that the equality in (11) holds since by assumption N qμ < 1 2κ < 1 2 and therefore N qμ = Nqμ . Solving Inequality (11) for n yields the lemma.

A first upper bound
In this section we will find absolute upper bounds for x and upper bounds for n in terms of p for solutions (n, x) to the Diophantine equations and and For a fixed prime p we can find such a bound by the standard procedure following the ideas of Shorey and Stewart [12] using Baker's method.

General method
Let us assume that that (n, x) is a solution to (12). Then Eq. (12) yields Taking logarithms yields Let us note that in the case that α and a are multiplicatively dependent we have integers z 1 and z 2 such that α z 1 a z 2 = 1. Since |α| > 1 we have that z 2 = 0 and therefore log a = −z 1 log α z 2 . Thus we obtain in this case the inequality We apply Matveev's result depending on the multiplicative dependence of α and a to (15) with m = 3 or to (16) with m = 2. Therefore let us note that the heights of α and a are effective computable and that the height of p is log p and therefore (in the case that m = 3) we have that A 1 , A 2 are bounded by an absolute effective computable constant and Note that in the case that m = 2 we have that A 1 is bounded by an effective computable constant and that A 2 = D log p. Thus we have in any case Let S 0 be the set of primes that divide the norm of α, or divide the denominator of a, or divide the norm of a. Obviously the set S 0 is finite and for all primes p / ∈ S 0 we have that α, a and p are multiplicatively independent. Therefore let us assume that p is not a member of S 0 , hence we obtain together with (15) the inequality provided that p / ∈ S 0 . Note that in the case that m = 2 similar considerations lead to the same conclusion and in particular to Inequality (17). (12) and that p / ∈ S 0 , then there exist effective computable constants C 8 and C 9 such that n < C 8 log p, and x < C 9 .

Lemma 7 Assume that (n, x) is a solution to
Proof Inequality (17) implies an absolute upper bound for n log p . Since inequality (2) we have x n log |α| log p and this immediately yields an absolute bound for x and also the bound for n stated in the lemma.

Remark 2 In Lemma 7 we basically reproved a result of Shorey and Stewart [12, Theorem 3]. But instead of using a result of Baker [1] on lower bounds for linear forms in logarithms
we use the more explicit and easier to apply result due to Matveev [10].

Results for the Tribonacci sequence
Let us assume that (n, x) is a solution to (13) and in view of (5) we assume that n ≥ 10. Then (13) implies Taking logarithms on both sides yields |n log α − x log p + log a| < 2.33 α −3n/2 We proceed to apply Matveev's result. We set D = 3, κ = 1 and m = 3.
With this choice we have Furthermore we note that p x = T n < 1.001aα n < α n .
Thus b i |A i | < 3n log α and therefore Finally we compute the quantities C(3) and C 0 numerically, put everything together and obtain C(3)C 0 W 0 D 2 Ω < 1.174 · 10 12 log p log(25.671B).

Lemma 8 Let (n, x) be a solution to Diophantine Equation
Proof Only the bound for x is left to prove. However, since x < n log α log p due to Inequality (19) the bound for x follows immediately.

Remark 4
For a fixed prime p it is easy to find explicit upper bounds for n using Lemma 8. Applying Baker-Davenport reduction to Inequality (18) we will find rather small explicit upper bounds for n, which are small enough to perform an explicit computer search for all solutions. This will be discussed in detail in Sect. 5.

Results for the added by one Lucas sequence
Now, we will consider Diophantine Equation (14). In view of (6) we assume that n > 10. In this case Diophantine Equation (14) can be written as γ n + 1 + δ n = p x and we obtain due to (6) the inequality Taking logarithms yields We apply Laurent's result to this inequality. Therefore we note that with K = Q(γ , p) we have D = [K : Q] = 2. Let us set According to (9) we choose A 1 = 0.2407 and A 2 = log p. With this choice we obtain due to inequality (7). If we assume that log b ≤ 14.62 we obtain n < 2.24 · 10 6 log p and due to (7) we also obtain x < 1.08 · 10 6 . Therefore we will assume that log b > 14.62 and Lemma 2 yields n log γ − log(1.52) < 68.94 log p log 1.5b 2 .
Therefore we obtain thatb < 12822 but this yields a contradiction to our assumption that log b > 14.62. Therefore we have:

The multiplicative independence condition
Let us consider the Diophantine equation U n = p x , with n ≥ N 0 and p / ∈ S 0 . Assume that U satisfies the multiplicative independence condition, i.e. log a and log α are linearly independent over Q. And in view of Theorem 1 we assume that there exist at least two solutions (n 1 , x 1 ) and (n 2 , x 2 ) with n 1 < n 2 . From (15) we obtain a system of inequalities: We eliminate log p from this system by multiplying the first inequality by x 1 and the second by x 2 and subtracting them from each other. Then we obtain due to Lemma 7 with Δ = n 1 x 2 −n 2 x 1 and Δ 1 = x 2 −x 1 . Note that (21) implies that there exists an effectively computable constant N 1 such that for all n 1 ≥ N 1 we have |Δ log α + Δ 1 log a| < 1.
Let us assume for the sake of the argument that max{N 0 , N 1 } ≤ n 1 < n 2 . First we note that Δ 1 = 0 since otherwise we would obtain x 1 = x 2 and therefore also n 1 = n 2 and the two solutions would be identical. Note that we assume that N 0 ≤ n 1 < n 2 and that U n is strictly increasing for n ≥ N 0 . Let us assume for the moment that Δ = 0. If Δ = 0 we obtain | log a| < C 10 α 2 α n 1 which implies n 1 ≤ C 11 . Now, let us consider the case that Δ = 0. Note that Δ 1 < C 9 due to Lemma 7. Therefore inequality (21) yields We may apply Matveev's result (Lemma 1) or Laurent's result (Lemma 2) to the linear form Λ = Δ log α + Δ 1 log a and obtain that −C 13 < log |Δ log α + Δ 1 log a| < −n 1 C 14 , i.e. that n 1 < C 15 . Note that the last inequality holds for some Constant C 14 since we assume that N 1 ≤ n 1 < n 2 . Therefore we have proved: Proposition 1 Assume that U n satisfies the multiplicative independence condition and that the Diophantine equation U n = p x , with n > max{N 0 , N 1 } and p / ∈ S 0 has at least two solution (n 1 , x 1 ) and (n 2 , x 2 ) with max{N 0 , N 1 } ≤ n 1 < n 2 and x 1 , x 2 = 0. Then there exists an effective computable constant C 15 such that n 1 < C 15 .
Let S(U ) be the set of primes p such that U n is a power of p for some index n with 0 ≤ n ≤ C 15 together with the set of primes coming from the set S 0 . Note that the set S(U ) is finite and because C 15 is effectively computable the set S(U ) is indeed effectively computable (at least in principal). With this notation we immediately deduce that the Diophantine equation U n = p x has at most one solution with x = 0 if p / ∈ S(U ). Thus we have proved Theorem 1 in this case.
Let us note that for a concrete given sequence U one can apply results from the theory of continued fractions (e.g. Lemma 5) to deduce from inequality (21) rather small upper bound for n 1 . This method will be applied in the next subsection, when we deal with the Tribonacci sequence.

Results for the Tribonacci sequence
We consider the Diophantine equation T n = p x . And in view of Theorem 2 we assume that there exist at least two solutions (n 1 , x 1 ) and (n 2 , x 2 ). If we can show that two such solutions with 4 ≤ n 1 < n 2 do not exist we have proved Theorem 2. In view of Inequality (18) we assume that 9 ≤ n 1 < n 2 . With these assumptions Inequality (18) holds and we obtain a system of inequalities: Multiplying the first inequality by x 1 and the second by x 2 and eliminating the log p term we obtain |Δ log α + Δ 1 log a| < x 2 2.33 α −3n 1 /2 + x 1 2.33α −3n 2 /2 with Δ = n 1 x 2 −n 2 x 1 and Δ 1 = x 2 − x 1 . First, we note that Δ 1 = 0 since otherwise x 1 = x 2 and therefore also n 1 = n 2 and the two solutions would be identical. Let us assume for the moment that Δ = 0. In this case we obtain | log a| < 3.6 x 2 α −3n 1 /2 .
And therefore we obtain Since continued fractions are the best approximations we compute the continued fractions of μ = log α − log a and notice that the 32-nd convergent p 32 /q 32 = 121491924785 217306873051 is the first convergent such that its denominator is larger than 1.77·10 11 . Moreover, we compute A = 15 and therefore we obtain by Lemma 5 the inequality which yields n 1 ≤ 89.7. If we factor the first 89 Tribonacci numbers and only take those into account which are primes or prime powers we obtain

Remark 5
The proof of Theorem 2 is complete, if we can show that the Diophantine equation T n = p x , with n ≥ 3 has at most one solution if p = 3, 7, 13, 103, 149 or p = 19341322569415713958901 and at most two solutions if p = 2. As already mentioned this can be done by using the Baker-Davenport reduction which will be discussed in Sect. 5.

The strong dominant root case
Since the case that a and α are multiplicatively independent has been resolved, we may assume that a and α are multiplicatively dependent, that is we fix integers z 1 and z 2 such that α z 1 a z 2 = 1 and (z 1 , z 2 ) = (0, 0). That is Let us also note that since we assume a strong dominant root condition we have instead of (15) the inequality Before we proceed with the proof of Theorem 1 in the strong dominant root case we prove the following lemma.

Lemma 10
There exists an effective computable constant N 1 such that C 16 and C 17 can be chosen such that C 17 C 16 < α α 2 , provided that n ≥ N 1 .

Proof
Since p x = U n there is a positive constant A 3 such that p x = aα n + a 2 α n 2 + θ A 3 |α 3 | n for some |θ | ≤ 1. With these notations we compute Λ = |x log p − n log α − log a| = log p x aα n ≤ log 1 + a 2 α n 2 aα n + A 3 |α 3 | n aα n . Now, we find an explicit upper bound for Λ, provided that n is chosen large enough such that Similarly we obtain Under the assumption that n ≥ N we can choose C 16 and C 17 such that aa 2 . Since the right hand side of (23) converges to 1 as N → ∞ we obtain the content of the lemma.
Let us assume that U n = p x has two solutions (n 1 , x 1 ) and (n 2 , x 2 ) with x 1 , x 2 > 0 and N 0 ≤ n 1 < n 2 . This yields the following system of inequalities: Eliminating log p yields similar as in the case that a and α are multiplicatively independent the inequality Let us note that if we assume that n 1 ≥ N 1 where N 1 is the bound from Lemma 10 we obtain which implies Therefore we deduce that Δ =ñ 1 x 2 −ñ 2 x 1 = 0, provided that n ≥ N 1 . Therefore we obtain | log α| < C 18 α 2 α n 1 which yields n 1 < C 19 and we obtain: Assume that U n satisfies the strong dominant root condition and that the Diophantine equation U n = p x with n > N 0 and p / ∈ S 0 has at least two solutions (n 1 , x 1 ) and (n 2 , x 2 ) with n 1 < n 2 and x 1 , x 2 = 0. Then there exists an effective computable constant C 19 such that n 1 < C 19 .
As in the case that the multiplicative independence condition holds we deduce now Theorem 1 in this case. Thus Theorem 1 is completely proved.

Results for the added by one Lucas sequence
Let us assume that the Diophantine equation L n = p x has at least two solutions (n 1 , x 1 ) and (n 2 , x 2 ). We follow the arguments of the strong dominant root case where log α and log a are linearly dependent. First we compute a lower bound N 1 for which Lemma 10 holds. Therefore let us note that we have a = a 2 = 1 and that we can choose A 3 = 1. Thus we havec = 5. Moreover, we have α = 1+ = γ −1 in (23). Therefore we have to find a bound N 1 such that By an explicit computation we obtain that N 1 = 7 is sufficient. Now we consider the following system of inequalities under the assumption that n 1 > 7.
Since the computations of the previous subsection we may assume that Δ = 0 and obtain γ n 1 < 6.83 · 10 6 and therefore we have n 1 < 32.71. If we factor the first 32 members of the sequence L and only consider those which are primes or prime powers we obtain

Reduction of the upper bounds for a fixed prime
The purpose of this last section is to prove Theorems 2 and 3 .

Application of the Baker-Davenport reduction method
We consider the Diophantine equation T n = p x with x = 0 and p ∈ P = {2, 3, 7, 13, 103, 149, p 0 } with p 0 = 19341322569415713958901 and n < 1.62 · 10 11 log p. In particular we consider Inequality (18) and divide it through log p and obtain n log α log p + log a log p − x < 2.33 log p exp − 3 log α 2 n .
Thus we apply Lemma 6 with μ = log α log p , τ = log a log p , c 1 = 2.33 log p , c 2 = 3 log α 2 , N = 1.62 · 10 11 log p for each p ∈ P. In each case we obtain a new bound for n. In Table 1 we indicate for which prime p the -th convergent yields a new upper bound B for n. Thus we conclude that if T n = p x has two solutions (n 1 , x 1 ) and (n 2 , x 2 ) with x 1 , x 2 = 0 and n 1 < n 2 , then n 2 ≤ 89. However a quick computer search among the first 89 Tribonacci numbers shows that only in the case that p = 2 we have two solutions namely T 3 = 2 and T 4 = 4. Thus the proof of Theorem 2 is complete.

Using continued fractions
Now we consider the Diophantine equation L n = p x with x = 0 and p ∈ P = {2, 3, 5, 19, 5779} and x < 1.08 · 10 6 . In particular we consider the inequality n x − log p log γ < 3.54γ −n which we deduce from (20). We apply Lemma 5 to this inequality with μ = log p log γ and the smallest convergent p /q to μ such that q > 1.08 · 10 6 . For the continued fraction to μ we compute according to Lemma 5 the quantity A and obtain 1 (2 + A)q 2 < n x − log p log γ < 3.54γ −n and therefore we obtain n < B = log 3.54(2 + A)q 2 log γ .
If we compute all the quantities for all p ∈ P we obtain new bounds for n. In Table 2 we give the relevant quantities for each prime p ∈ P. This implies that in any case n 2 ≤ 84. Thus we compute the first 84 members of L and check whether they are a power of any of the primes p ∈ P. A quick computer search yields that the only case for which more than one solution exists is p = 2. In this case we have the three solutions L 1 = 2, L 2 = 4 and L 4 = 8. Thus Theorem 3 is proved.
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/.