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): Difference between revisions
From MaRDI portal
Revision as of 01:16, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
