The complete solution of the Diophantine equation \((4m^2 + 1)^x + (5m^2 - 1)^y = (3m)^z\) (Q2400088): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10998-016-0111-x / rank | |||
Property / cites work | |||
Property / cites work: On the diophantine equation \(1+x+y=z\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4861499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Hasse-type principle for exponential Diophantine equations and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponential diophantine equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Carmichael's lambda function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3239359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The diophantine equation \(a^ x+b^ y=c^ z\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The diophantine equation \(a^ x +b^ y= c^ z\). II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The diophantine equation \(a^ x + b^ y = c^ z\). III / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4897985 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10998-016-0111-X / rank | |||
Normal rank |
Latest revision as of 10:21, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complete solution of the Diophantine equation \((4m^2 + 1)^x + (5m^2 - 1)^y = (3m)^z\) |
scientific article |
Statements
The complete solution of the Diophantine equation \((4m^2 + 1)^x + (5m^2 - 1)^y = (3m)^z\) (English)
0 references
25 August 2017
0 references
Let \(a\), \(b\), \(c\) be positive integers with \(\gcd(a, b, c) = 1\) and consider the Diophantine equation \[ a^x + b^y = c^z\tag{1} \] where \(x\), \(y\), \(z\) are unknown positive integers. This equation has been investigated by several authors. In particular, Terai conjectured that if \(a, b, c \geq 2\) then equation 1 has at most one solution in \((x, y, z)\) with \(x, y, z \geq 2\). This conjecture implies the classical conjecture of Je\`smanowicz, saying that \[ (m^2 - n^2)^x + (2mn)^y = (m^2 + n^2)^z \] has no solution other than \((x, y, z) = (2, 2, 2)\), where \(m\), \(n\) are positive integers with \(m > n\), \(\gcd(m, n) = 1\) and \(m \not\equiv n \pmod 2\). In this case \(a = m^2 - n^2\), \(b = 2mn\) and \(c = m^2 + n^2\) form a reduced Diophantine triple, thus \((x, y, z) = (2, 2, 2)\) is always a solution. As a related problem, Terai investigated the equation \[ (4m^2 + 1)^x + (5m^2 - 1)^y = (3m)^z,\tag{2} \] where \(m\) is an arbitrary but fixed positive integer, and \(x\), \(y\), \(z\) are unknown positive integers. He proved the following:\vskip\baselineskip \textbf{Theorem 1.} (Terai) If \(0 < m \leq 20\) or \(m \not\equiv 3 \pmod 6\) then equation 2 has the only solution \((x, y, z) = (1, 1, 2)\).\vskip\baselineskip Recently, Su and Li investigated the cases where \(3\mid m\). They obtained the following result.\vskip\baselineskip \textbf{Theorem 2.} (Su and Li) If \(m \geq 90\) and \(3\mid m\) then the only solution to equation 2 is \((x, y, z) = (1, 1, 2)\).\vskip\baselineskip Combining Theorems 1 and 2, provides the complete solution of equation 2 for \(m \leq 20\) or \(90 \leq m\). The aim of the paper is to complete the solution of this equation. Solving the remaining cases and putting it together with Theorems 1 and 2 the author obtain the following:\vskip\baselineskip \textbf{Theorem 3.} For any positive integer \(m\), equation 2 has only one solution in \(x\), \(y\) and \(z\), namely \((x, y, z) = (1, 1, 2)\).
0 references
exponential Diophantine equations
0 references
exponential congruences
0 references
Hasse-principle
0 references
local methods
0 references