On the equation \(y^x\pm x^y=z^2\) (Q5928698): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005728118 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear forms in two logarithms and interpolation determinants / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A corollary to a theorem of Laurent-Mignotte-Nesterenko / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4291794 / rank | |||
Normal rank | |||
Latest revision as of 14:56, 3 June 2024
scientific article; zbMATH DE number 1583393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the equation \(y^x\pm x^y=z^2\) |
scientific article; zbMATH DE number 1583393 |
Statements
On the equation \(y^x\pm x^y=z^2\) (English)
0 references
1 April 2001
0 references
The authors prove that the equation \(y^x\pm x^y= z^2\) has only the positive integer solution \((x,y,z)= (2,3,1)\) satisfying \(\min(x,y)> 1\), \(\gcd(x,y)= 1\) and \(2\mid xy\). The proofs depend on some lower bounds of linear forms in \(p\)-adic and Archimedean logarithms.
0 references
exponential Diophantine equation
0 references
lower bounds of linear forms
0 references
\(p\)-adic logarithms
0 references
Archimedian logarithms
0 references
