Diophantine equations after Fermat's last theorem (Q1032652)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Diophantine equations after Fermat's last theorem
scientific article

    Statements

    Diophantine equations after Fermat's last theorem (English)
    0 references
    0 references
    0 references
    26 October 2009
    0 references
    The author considers the following two questions: {\parindent=7mm \begin{itemize}\item[(i)]Given a Diophantine equation, what information can be obtained by following the strategy of Wiles' proof of Fermat's last theorem? \item[(ii)]Is it useful to combine this approach with the traditional approaches to Diophantine equations: Diophantine approximation, arithmetical geometry, \dots? \end{itemize}} Moreover, the problem is to give an explicit resolution of these Diophantine equations. The use of Frey curves is explained in detail. Three examples are presented to illustrate the method: -- the generalized Ramanujan--Nagell equations \[ x^2+D=y^m, \;m \geq 3, \] for \(1\leq D \leq 100\), -- perfect powers in the Fibonacci sequence \[ F_n = y^m, \;m\geq2, \] in which case it was proved that the only solutions are \(F_n=0,1,8,144\), -- some multiply exponential Diophantine equations such as \[ q^u x^n - 2^r y^n = \pm 1, \;n\geq3, \] where \(q\) is an odd prime \({}<100\). For the two first examples, the author gives many concrete explanations and shows the combination of the modular method with more classical methods (elementary arguments and heavy use of Baker's theory). The paper ends with open problems for which -- up to now -- the combination of the previous methods fails, the most exiting ones being \[ x^3+y^3 = z^n, \;xyz\not=0, \;n\geq3, \] and \[ x^2-2=y^m, \;m\geq3. \]
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    exponential Diophantine equations
    0 references
    Wiles theory
    0 references
    Baker's theory
    0 references
    0 references
    0 references
    0 references
    0 references