Let \((a,b,c,d) \in A\) and \(\{R_n\}_{n \ge 0}\) be either \(\{U_n\}_{n \ge 0}\) or \(\{V_n\}_{n \ge 0}\). In order to apply the procedure described in Theorem 2.1 to resolve equation (1.1) in \(x=R_i,y=R_j,z=R_k\), we firstly do the following steps (since in Theorem 2.1, \(1\le i\le j\le k\) is assumed). The first step is permuting the first three components in (a, b, c, d). Then for each of the resulting tuples, we provide an upper bound for i as explained in Theorem 2.1. In fact, Theorem 2.1 gives the least upper bound for all such cases of the tuples of A. After that we adopt the arguments described in [9] (in case of the Fibonacci sequence) to determine the list of solutions. Finally, when the solutions of (1.1) with these cases are obtained we permute the components of these solutions in which they satisfy equation (1.1) at the tuple \((a,b,c,d)\in A\) in order to determine all of its solutions \((x,y,z)=(R_i, R_j, R_k).\)
If we fix (a, b, c, d), i and \(m=k-j\), then we need to study the equation
$$\begin{aligned} aR_i^2+bR_j^2+c R_{j+m}^2-dR_i R_j R_{j+m}=0, \end{aligned}$$
where \(R_n=U_n\) or \(V_n.\) We note that the equation above only depends on j. Now, we adopt the arguments given in [9].
-
(I)
We eliminate as many values of i as possible by checking the solvability of quadratic equations
$$\begin{aligned} aR_i^2+by^2+cz^2-dR_iyz=0. \end{aligned}$$
-
(II)
For fixed m we eliminate equations \(aR_i^2+bR_j^2+c R_{j+m}^2-dR_i R_j R_{j+m}=0\) modulo p, where p is a prime.
-
(III)
We can also eliminate equations \(aR_i^2+bR_j^2+c R_{j+m}^2-dR_i R_j R_{j+m}=0\) using related identities of second order linear recurrence sequences.
-
(IV)
We consider the equation \(aR_i^2 + bR_j^2 + cR_{j+m}^2 = dR_i R_j R_{j+m} \) as a quadratic in \(R_j \). Its discriminant \(d^2R_i^2R_{j+m}^2 -4b(aR_i^2 + cR_{j+m}^2 )\) must be a square. The terms of the sequences \(\{U_n\}_{n \ge 0}\) and \(\{V_n\}_{n \ge 0}\) satisfy the fundamental identity
$$\begin{aligned} V_n^2-DU_n^2=4Q^n. \end{aligned}$$
Therefore, in case of \(Q=\pm 1\) we have the systems of equations
$$\begin{aligned} Y_1^2&=DX^2\pm 4,\\ Y_2^2&=d^2R_i^2X^2 -4b(aR_i^2 + cX^2 ), \end{aligned}$$
where \(X=R_{j+m}=U_{j+m}\), \(Y_1=V_{j+m}\), \(Y_2=2bR_j-dR_iU_{j+m}\); and
$$\begin{aligned} Y_1^2&=DX^2\mp 4D,\\ Y_2^2&=d^2R_i^2X^2 -4b(aR_i^2 + cX^2 ), \end{aligned}$$
where \(X=R_{j+m}=V_{j+m}\), \(Y_1= DU_{j+m}\), \(Y_2=2bR_j-dR_iV_{j+m}\). Multiplying these equations together, in general, yields quartic genus 1 curves. One may determine the integral points on these curves using the Magma [3] function SIntegralLjunggrenPoints (based on results obtained by Tzanakis [10]). Indeed, it may happen that we get genus 0 curves.
Let us apply the procedure described in Theorem 2.1 with these arguments to determine the solutions of equation (1.1) in some second order linear recurrence sequences.
Balancing numbers and Markoff–Rosenberger equations
The first definition of balancing numbers is essentially due to Finkelstein [4], although he called them numerical centers. In 1999, Behera and Panda [2] defined balancing numbers as follows. A positive integer n is called a balancing number if
$$1 + 2 +\cdots + (n-1) = (n + 1) + (n + 2) +\cdots + (n + k)$$
for some \(k\in {\mathbb {N}} \). The sequence of balancing numbers is denoted by \(\{B_n\}_{n\ge 0}\). This sequence can be defined in a recursive way as well, we have that \(B_0=0,B_1=1\) and
$$\begin{aligned} B_{n}=6B_{n-1}-B_{n-2},\quad n\ge 2. \end{aligned}$$
As we see this is the sequence \(\{U_n(6,1)\}_{n \ge 0} \). So \(P=6\), \(Q=1\) and \(D=32 \). We also have that
$$\begin{aligned} \alpha =3+2\sqrt{2},\quad \beta =3-2\sqrt{2}. \end{aligned}$$
We have the bounds
$$\begin{aligned} \alpha ^{n-1}\le B_n\le \alpha ^n \quad \text{ for } n\ge 1, \end{aligned}$$
(3.1)
which are specific to the sequence of balancing numbers. Since \(Q=1\) the numbers \(X=B_n\) satisfy the Pellian equation \(Y^2=8X^2+1 \). We prove the following result.
Theorem 3.1
If \((x,y,z)=(B_i,B_j,B_k)\) is a solution of the equation
$$\begin{aligned} ax^2+by^2+cz^2=dxyz \end{aligned}$$
and \((a,b,c,d)\in \bigl \{(1,1,1,1),(1,1,1,3),(1,1,2,2), (1,1,2,4), (1,1,5,5), (1,2,3,6) \bigr \}\), then there is at most one solution given by \( x=y=z=B_1=1. \)
Proof
Note that here we can directly use the results given in Theorem 2.1 (i.e. \(B_0 \ge \alpha ^{-4}\) and \(i \le 12\)), argument (I) and any of the arguments described in (II), (III) or (IV) to prove the theorem completely. But in practice, having a smaller upper bound on i and eliminating as many \(i's\) as possible are very useful for determining the complete set of solutions, and, as pointed earlier, the upper bound “12” on i is only the least upper bound that could be even smaller due to particular sequences. Therefore, we follow the general strategy given in Theorem 2.1 to compute the best possible values for the lower bounds on \(B_0's\) (i.e. greater values) and the upper bounds on \(i's\) (i.e. smaller values) specific to the sequence of balancing numbers with the use of the inequalities given in (3.1). It turns out that in all the cases we have that \(i\le 5 \). Moreover, by applying argument (I), many values of \(i's\) can be eliminated by checking integral solutions of binary quadratic forms. Therefore, we skip the congruence arguments given by (II) and (III). We directly consider the genus 1 curves obtained from the system of equations
$$\begin{aligned} Y_1^2&=8X^2+1,\\ Y_2^2&=d^2B_i^2X^2 -4b(aB_i^2 + cX^2 ). \end{aligned}$$
In the following table, we provide details of the computations.
\(\left[ a,b,c,d\right] \)
|
\(B_0\)
|
\(C_0\)
|
\(\left[ i\right] \)
|
\(\left[ i, A'X^{4} +B'X^{2} +C', \left[ X,Y\right] \right] \)
|
---|
\(\left[ 1, 1, 1, 1\right] \)
|
0.0052038
|
5
|
\(\left[ 2 \right] \)
|
\(\left[ 2, 256X^{4} - 1120X^{2} - 144, \left[ \right] \right] \)
|
\(\left[ 1, 1, 1, 3\right] \)
|
0.3587572
|
2
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 40X^{4} - 27X^{2} - 4, \left[ \left[ 1, -3\right] , \left[ -1, -3\right] \right] \right] \)
|
\(\left[ 1, 1, 2, 2\right] \)
|
0.0052038
|
4
|
\(\left[ 2 \right] \)
|
\(\left[ 2, 1088X^{4} - 1016X^{2} - 144, \left[ \right] \right] \)
|
\(\left[ 1, 2, 1, 2\right] \)
|
0.1819805
|
3
|
\(\left[ 2 \right] \)
|
\(\left[ 2, 1088X^{4} - 2168X^{2} - 288, \left[ \right] \right] \)
|
\(\left[ 2, 1, 1, 2\right] \)
|
0.1819805
|
3
|
[]
|
[]
|
\(\left[ 1, 1, 2, 4\right] \)
|
0.1819805
|
2
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 64X^{4} - 24X^{2} - 4, \left[ \left[ 1, 6\right] , \left[ -1, 6\right] \right] \right] \)
|
\(\left[ 1, 2, 1, 4\right] \)
|
0.2928932
|
3
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 64X^{4} - 56X^{2} - 8, \left[ \left[ 1, 0\right] , \left[ -1, 0\right] \right] \right] \)
|
\(\left[ 2, 1, 1, 4\right] \)
|
0.2928932
|
3
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 96X^{4} - 52X^{2} - 8, \left[ \left[ 1, -6\right] , \left[ -1, -6\right] \right] \right] \)
|
\(\left[ 1, 1, 5, 5\right] \)
|
0.0052038
|
4
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 40X^{4} - 27X^{2} - 4, \left[ \left[ 1, -3\right] , \left[ -1, -3\right] \right] \right] \)
|
\(\left[ 1, 5, 1, 5\right] \)
|
0.1161165
|
4
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 40X^{4} - 155X^{2} - 20, \left[ \left[ 2, 0\right] , \left[ -2, 0\right] \right] \right] \)
|
\(\left[ 5, 1, 1, 5\right] \)
|
0.1161165
|
4
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 168X^{4} - 139X^{2} - 20, \left[ \left[ 1, -3\right] , \left[ -1, -3\right] \right] \right] \)
|
\(\left[ 1,2,3,6\right] \)
|
0.1819805
|
2
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 96X^{4} - 52X^{2} - 8, \left[ \left[ 1, -6\right] , \left[ -1, -6\right] \right] \right] \)
|
\(\left[ 1,3,2,6\right] \)
|
0.3587572
|
2
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 96X^{4} - 84X^{2} - 12, \left[ \left[ 1, 0\right] , \left[ -1, 0\right] \right] \right] \)
|
\(\left[ 2, 1, 3, 6\right] \)
|
0.1819805
|
2
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 192X^{4} - 40X^{2} - 8, \left[ \left[ 1, 12\right] , \left[ -1, 12\right] \right] \right] \)
|
\(\left[ 2, 3, 1, 6\right] \)
|
0.0606601
|
4
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 192X^{4} - 168X^{2} - 24, \left[ \left[ 1, 0\right] , \left[ -1, 0\right] \right] \right] \)
|
\(\left[ 3, 1, 2, 6\right] \)
|
0.3587572
|
2
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 224X^{4} - 68X^{2} - 12, \left[ \left[ 1, -12\right] , \left[ -1, -12\right] \right] \right] \)
|
\(\left[ 3, 2, 1, 6\right] \)
|
0.0606601
|
4
|
\(\left[ 1 \right] \)
|
\(\left[ 1, 224X^{4} - 164X^{2} - 24, \left[ \left[ 1, 6\right] , \left[ -1, 6\right] \right] \right] \)
|
The first column gives the tuples \((a,b,c,d) \in S\), the second column represents approximated lower bounds on \(B_0's\), the third column has upper bounds on \(i's\) represented by \(C_0\), in the fourth column we provide lists containing the remaining values of \(i's\) not eliminated by argument (I), and in the last column we have lists containing i, the right hand side of the quartic polynomial \(Y^2=A'X^{4} +B'X^{2} +C'\) defining genus 1 curve and the integral solutions (the second coordinate is only up to sign, for us, only the first coordinate is interesting since that gives \(B_{j+m}\)). For example, in case of \((a,b,c,d)=(1,2,3,6)\) we have that \(B_0\approx 0.1819805\) and \(C_0=2 \). That is \(i\le 2 \). Applying argument (I) we can eliminate \(i=2\). Hence, it remains to study the case with \(i=1\). Here, we get that the only integral solutions are the ones with \(X=\pm 1 \). Since \(X=B_{j+m}\), the only possibility is \(B_{j+m}=1 \). The last step is the solution of the quadratic equation
$$\begin{aligned} 1^2+2\cdot B_j^2+3\cdot 1^2=6\cdot 1\cdot B_j\cdot 1. \end{aligned}$$
It follows that \(B_j\) is either 1 or 2, but 2 is not a balancing number. Therefore, the only solution in this case is
$$\begin{aligned} (B_i,B_j,B_k)=(B_1,B_1,B_1)=(1,1,1). \end{aligned}$$
\(\square \)
Jacobsthal numbers and Markoff–Rosenberger equations
If \((P,Q)=(1,-2)\), then we deal with a special sequence in which we have that \(P <2\); that is the sequence of Jacobsthal numbers \(\{J_n\}_{n \ge 0}=\{U_n(1,-2)\}_{n \ge 0} \). Here, we have \(J_0=0,J_1=1\) and
$$\begin{aligned} J_n=J_{n-1}+2J_{n-2}\quad \text{ if } n\ge 2. \end{aligned}$$
It is also known that the next Jacobsthal number is also given by the recursion formula
$$\begin{aligned} J_{n+1}=2J_n+(-1)^n. \end{aligned}$$
We obtain that
$$\begin{aligned} D=9, \quad \alpha =2, \quad \beta =-1. \end{aligned}$$
Therefore, the closed-form of \(J_n\) is given by
$$\begin{aligned} \frac{2^n-(-1)^n}{3}. \end{aligned}$$
Based on the above closed-form equation we may provide bounds for \(J_n\), these are as follows
$$\begin{aligned} \frac{2^{n-1}}{3}\le J_n\le 2^{n-1}, \quad n\ge 1. \end{aligned}$$
(3.2)
Similarly, these bounds are only specific to the general term \(J_n\). Here, we prove the following statement.
Theorem 3.2
If \((x,y,z)=(J_i,J_j,J_k)\) is a solution of equation
$$\begin{aligned} aJ_i^2+bJ_j^2+cJ_k^2=dJ_iJ_jJ_k \end{aligned}$$
(3.3)
and \((a,b,c,d)\in \{(1,1,1,1), (1,1,1,3), (1,1,2,2), (1,1,2,4), (1,1,5,5), (1,2,3,6)\}\), then the complete list of solutions is given by
(a, b, c, d)
|
Solutions
|
---|
(1, 1, 1, 1)
|
\(\{(3,3,3)\}\)
|
(1, 1, 1, 3)
|
\(\{(1,1,1)\}\)
|
(1, 1, 2, 2)
|
\(\{ \}\)
|
(1, 1, 2, 4)
|
\(\{(1,1,1),(1,3,1),(1,3,5),(3,1,1),(3,1,5),(3,11,1),(11,3,1)\}\)
|
(1, 1, 5, 5)
|
\(\{(1,3,1),(3,1,1)\}\)
|
(1, 2, 3, 6)
|
\(\{(1,1,1),(5,1,1)\}\)
|
Proof
Since \(P<2\), we cannot directly use the results given in Theorem 2.1. But, since \(\beta =-1, \alpha =2\) and \(\sqrt{D}=3\), we may follow the steps of the proof of Theorem 2.1 with the use of the inequalities given in (3.2). Hence, we obtain that
$$\begin{aligned} B_0=\min _{I\in {\mathbb {Z}}}\left| 2^I-\frac{d}{3c}\right| \end{aligned}$$
and
$$\begin{aligned} \left| 2^{k-i-j}-\frac{d}{3c}\right| \le \left( \frac{9(a+b)}{2c}+\frac{d}{c}+1\right) 2^{-i}. \end{aligned}$$
(3.4)
In fact, in some cases we obtain that \(B_0=0\).
The case \((a,b,c,d)=(1,1,1,1)\). Here, we obtain that \(B_0\approx 0.0833333\) and the bound for i is 7. Applying the argument given at (I) it turns out that all values can be eliminated except \(i=3 \). If \(i=3\), then we compute the possible values of \(k-j\) from inequality (3.4). We have that \(k-j\in \{0,1,2,3\} \). If \(k-j\in \{1,2\}\), then applying (II) with \(p=3\) works and in case of \(k-j=3\) we use \(p=11\) to show that there is no solution. The remaining case is related to \(k-j=0 \). We obtain the equation
$$\begin{aligned} 3^2+J_j^2+J_j^2=3J_jJ_j. \end{aligned}$$
It follows that \(J_j=J_k=3\), so the solution is given by \((J_i,J_j,J_k)=(3,3,3).\)
The case \((a,b,c,d)=(1,1,1,3)\). In this case in (3.4) we have \(|2^{k-i-j}-1|\) and this expression is 0 if \(k-i-j=0 \). Therefore, we need to study the equation
$$\begin{aligned}&(2^i-(-1)^i)^2+(2^j-(-1)^j)^2+(2^{i+j}-(-1)^{i+j})^2\\&\quad =(2^i-(-1)^i)\cdot (2^j-(-1)^j)\cdot (2^{i+j}-(-1)^{i+j}). \end{aligned}$$
By symmetry we may assume that \(i\le j \). The small solutions with \(0\le i\le j\le 2\) can be enumerated easily. Since we consider solutions with \(i,j>0\), we omit \((i,j)=(0,0) \). The other solution is given by \((i,j)=(1,1) \). Hence, we get that \((J_i,J_j,J_k)=(1,1,1) \). If \(i=2\), then it follows that with modulo 7 there is no solution. If \(i>2\), then we work modulo 8 to show that no solution exists. If \(k-i-j\ne 0\), then we obtain that \(B_0=1\). As a consequence we have that \(i\in \{1,2\} \). We may exclude the cases \(i=1,2\) and \(k-j=2\) modulo 5. In a similar way, working modulo 7 we eliminate the cases \(i=1,k-j=3\) and \(i=2,k-j=3,4 \). The remaining cases are given by \(i\in \{1,2\},k-j\in \{0,1\}.\) If \(i=1,2, k-j=0\), then it easily follows that (1, 1, 1) is the only solution. If \(i=1,2,k-j=1\), then the equation is
$$\begin{aligned} 1+J_j^2+J_{j+1}^2=3J_jJ_{j+1}. \end{aligned}$$
Since \(J_{j+1}=2J_j+(-1)^j\), the above equation can be written as
$$\begin{aligned} J_j^2-(-1)^jJ_j-2=0. \end{aligned}$$
Thus, the only possibilities are given by \(J_j\in \{\pm 1,\pm 2\} \). Again, the only solution we get is (1, 1, 1).
The case \((a,b,c,d)=(1,1,2,2)\). Here, we compute the bounds for i in the cases \((a,b,c,d)=(1,1,2,2),(1,2,1,2),(2,1,1,2) \). Simply argument (I) is enough to show that there exists no solution.
The case \((a,b,c,d)=(1,1,2,4)\). The bound for i is 4 and by (I) we can eliminate the case \(i=4\) when the order of the coefficients is (1, 1, 2, 4) . Congruence arguments (modulo 3 or 7) work if \((i,k-j)\in \{(1,2),(1,3),(2,2),(2,3)\} \). The remaining cases are
$$\begin{aligned} (i,k-j)\in \{(1,0),(1,1),(2,0),(2,1),(3,0),(3,1),(3,2),(3,3)\}. \end{aligned}$$
From \((i,k-j)=(1,0),(2,0),(3,0)\) we obtain the solutions (by solving quadratic equations) (1, 1, 1) and (3, 1, 1) . If \((i,k-j)=(1,1),(2,1)\), then we get \(J_j^2+4(-1)^jJ_j+3=0 \). Hence, \(J_j=1\) or 3. So we obtain the solutions (1, 1, 1), (1, 3, 1), (1, 3, 5). In case of \((i,k-j)=(3,1)\) we obtain \(15J_j^2+4(-1)^jJ_j-11=0 \). Thus, we have the solution (3, 1, 1) . By applying the rule \(J_{n+1}=2J_{n}+(-1)^n\) two or three times we can reduce the problems \((i,k-j)=(3,2),(3,3)\) to quadratic equations. The formulas are getting more involved, for example if \((i,k-j)=(3,2)\) we have
$$\begin{aligned} 9+J_j^2+2(4J_j+2(-1)^j+(-1)^{j+1})^2=12J_j(4J_j+2(-1)^j+(-1)^{j+1}). \end{aligned}$$
In this case we get that \(J_j=1 \). In a very similar way, we handle the cases with the tuples (1, 2, 1, 4) and (2, 1, 1, 4).
The case \((a,b,c,d)=(1,1,5,5).\) Here, we need to deal with the tuples \((1,1,5,5),(1,5,1,5)\) and (5, 1, 1, 5) . The bounds for i are given by 3, 6 and 6, respectively. Since the steps are similar as we have applied in the previous cases, we omit the details.
The case \((a,b,c,d)=(1,2,3,6).\) We only provide some data related to the computation. Let us start with the bounds:
Tuple
|
Bound for i
|
Special case
|
---|
(1, 2, 3, 6)
|
4
|
–
|
(1, 3, 2, 6)
|
2
|
\(k-i-j=0\)
|
(2, 1, 3, 6)
|
4
|
-
|
(2, 3, 1, 6)
|
2
|
\(k-i-j=1\)
|
(3, 1, 2, 6)
|
2
|
\(k-i-j=0\)
|
(3, 2, 1, 6)
|
2
|
\(k-i-j=1\)
|
As before we apply the arguments given by (I) and (II) and the identity \(J_{n+1}=2J_n+(-1)^n\) to resolve all the possible cases. The only new case that has not appeared yet is \(k-i-j=1 \). If we take the tuple (2, 3, 1, 6), then we obtain
$$\begin{aligned} 2J_i^2+3J_j^2+J_{i+j+1}^2-6J_iJ_jJ_{i+j+1}=0, \end{aligned}$$
(3.5)
or
$$\begin{aligned}&2(2^i-(-1)^i)^2+3(2^j-(-1)^j)^2+(2^{i+j+1}-(-1)^{i+j+1})^2\nonumber \\&\quad =2(2^i-(-1)^i)\cdot (2^j-(-1)^j)\cdot (2^{i+j+1}-(-1)^{i+j+1}). \end{aligned}$$
(3.6)
With respect to the values of i and j we consider the following cases (assuming that \(1 \le i \le j \le k\)):
-
If i and j are both even, i.e. \(i=2t\) and \(j=2r\) for all positive integers \(t, r \ge 1\), then equation (3.6) becomes
$$\begin{aligned} E_1=2(4^t-1)^2+3(4^r-1)^2+(2\cdot 4^{t+r}+1)^2-2(4^t-1)\cdot (4^r-1)\cdot (2\cdot 4^{t+r}+1)=0. \end{aligned}$$
But \(E_1 \equiv 4 \pmod {8}\) for all \(t, r \ge 1\), which leads to a contradiction. Moreover, since i and j are both even with \(i \ge 2\) and \(j \ge 2\), then all the even values of i and j are excluded.
-
If i and j are both odd, i.e. \(i=2t+1\) and \(j=2r+1\) for all positive integers \(t, r \ge 1\), then equation (3.6) implies that
$$\begin{aligned} E_2= & {} 2(2\cdot 4^t+1)^2+3(2\cdot 4^r+1)^2+(2\cdot 4^{t+r+1}+1)^2\\&-2(2\cdot 4^t+1) \cdot (2\cdot 4^r+1)\cdot (2\cdot 4^{t+r+1}+1)=0. \end{aligned}$$
Similarly, \(E_2\equiv 4 \pmod {8} \) for all \(t, r \ge 1\), and again we get a contradiction. Indeed, all the odd values of \(i \ge 3\) and \(j \ge 3\) are excluded, and it remains only to check whether equation (3.5) has solutions or not at the following cases: \(i=1\), \(j=1\); \(i=1\), \(j\ge 3\); \(j=1\), \(i\ge 3 \). In fact, since we assumed that \(1 \le i \le j \le k\), then the latter case can be covered by checking the solvability of equation (3.5) at \(i=j=1.\)
-
If i is even and j is odd, i.e. \(i=2t\) and \(j=2r+1\) for all positive integers \(t, r \ge 1\), then equation (3.6) leads to
$$\begin{aligned} E_3= & {} 2(4^t-1)^2+3(2\cdot 4^r+1)^2+(4^{t+r+1}-1)^2\\&- 2(4^t-1)\cdot (2\cdot 4^r+1)\cdot (4^{t+r+1}-1)=0. \end{aligned}$$
Again, we get a contradiction since \(E_3 \equiv 4 \pmod {8}\) for all \(t, r \ge 1\). Here, we excluded all the even values of \(i \ge 2\) and odd values of \(j \ge 3\), and it remains to check whether equation (3.5) has solutions or not only at \(j=1, i\ge 2\). Similarly, this can be covered by studying the solutions of equation (3.5) only at \(i=j=1 \).
-
Finally, if i is odd and j is even, i.e. \(i=2t+1\) and \(j=2r\) for all positive integers \(t, r \ge 1\), then similarly we have
$$\begin{aligned} E_4= & {} 2(2\cdot 4^t+1)^2+3(4^r-1)^2+(4^{t+r+1}-1)^2\\&- 2(2\cdot 4^t+1)\cdot (4^r-1)\cdot (4^{t+r+1}-1)=0, \end{aligned}$$
and \(E_4 \equiv 4 \pmod {8}\) for all \(t, r \ge 1\), which gives a contradiction. It is clear that all the odd values of \(i \ge 3\) and even values of \(j \ge 2\) are excluded, and we need to check whether equation (3.5) has solutions or not only at \(i=1, j\ge 2\).
From these cases we conclude that it only remains to study the solutions of equation (3.5) at \(i=1\) and all the integers of j with \(j\ge 1 \). This can be done by direct substitution and using argument (III) as follows. It is clear that we have \(k=i+j+1=j+2\) and
$$\begin{aligned} 2+3J_j^2+J_{j+2}^2-6J_jJ_{j+2}=0 \quad \text{ for } \quad j \ge 1. \end{aligned}$$
(3.7)
-
If \(j=1\), then we have that \(-4=2+3J_1^2+J_{3}^2-6J_1J_{3}=0\), which is impossible.
-
If \(j=2\), then we get the solution \((i,j,k)=(1,2,4)\). Hence, equation (3.5) has the solution \((J_i, J_j, J_{i+j+1})=(J_i, J_j, J_{k})=(J_1, J_2, J_4)=(1,1,5).\)
-
If \(j \ge 3\), we can show that equation (3.5) has no more solutions by showing that
$$\begin{aligned} 2+3J_j^2+J_{j+2}^2-6J_jJ_{j+2}<0 \quad \text{ for } \quad j \ge 3. \end{aligned}$$
Indeed, after substituting the Jacobsthal numbers formula \(J_j=J_{j-1}+2J_{j-2}\) in the left hand side of equation (3.7) a few times we get that
$$\begin{aligned} 2+3J_j^2+J_{j+2}^2-6J_jJ_{j+2}=2-2J_{j-1}^2-24J_{j-1}J_{j-2}-24J_{j-2}^2 <0, \end{aligned}$$
for \(j \ge 3\), and this contradicts equation (3.7).
Therefore, by permuting the components of the solution (1, 1, 5) to be a solution of equation (3.3) at the tuple (1, 2, 3, 6) we get the solution (5, 1, 1). \(\square \)