THE EXPONENTIAL DIOPHANTINE EQUATION <i>n<sup>x</sup></i> + (<i>n</i> + 1)<sup><i>y</i></sup> = (<i>n</i> + 2)<sup><i>z</i></sup> REVISITED (Q3183188)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5617540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE EXPONENTIAL DIOPHANTINE EQUATION <i>n<sup>x</sup></i> + (<i>n</i> + 1)<sup><i>y</i></sup> = (<i>n</i> + 2)<sup><i>z</i></sup> REVISITED |
scientific article; zbMATH DE number 5617540 |
Statements
THE EXPONENTIAL DIOPHANTINE EQUATION <i>n<sup>x</sup></i> + (<i>n</i> + 1)<sup><i>y</i></sup> = (<i>n</i> + 2)<sup><i>z</i></sup> REVISITED (English)
0 references
19 October 2009
0 references
exponential Diophantine equations
0 references
Baker's method
0 references
modular method
0 references
0 references
0.9050567746162416
0 references
0.8993877172470093
0 references
0.8583248853683472
0 references
0.8482585549354553
0 references
