The diophantine equation \(a^ x + b^ y = c^ z\). III (Q1917601)

[Part II, cf. ibid. 71, No. 6, 109-110 (1995; Zbl 0842.11009).] In this paper, the author proves the following: Theorem. Let \(r\) be an odd prime, and \[ \begin{aligned} a=m & \sum^{{r-1 \over 2}}_{j=0} (-1)^j {r\choose 2j} m^{r-(2j+1)}, \\ b = & \sum^{{r-1 \over 2}}_{j=0} (-1)^j {r\choose 2j+1} m^{r-(2j+1)}, \quad c=m^2+1 \end{aligned} \] \(m\) is even, \(({a\over b}) =-1\). Let \(b\) be a prime power. Suppose that \(ab\equiv 0 \pmod\ell\) and \(e \equiv 0 \pmod r\), where \(r\) is the order of \(c\) modulo \(\ell.\) If \(r>8\cdot 10^6\) or \(\log c> 10^{10^{14}}\), then the diophantine equation \(a^x+b^y = c^z\) has only the positive integral solution \((x,y,z) = (2,2,r)\).