
doi: 10.4064/aa171-2-4
Summary: Let \(a,b,c\) be fixed coprime positive integers with \(\min\{a,b,c\}>1\), and let \(m=\max \{a,b,c\}\). Using the Gel'fond-Baker method, we prove that all positive integer solutions \((x,y,z)\) of the equation \(a^x+b^y=c^z\) satisfy \(\max \{x,y,z\}1\).
ternary purely exponential Diophantine equation, upper bound for solutions, Counting solutions of Diophantine equations, counting solutions, Exponential Diophantine equations
ternary purely exponential Diophantine equation, upper bound for solutions, Counting solutions of Diophantine equations, counting solutions, Exponential Diophantine equations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
