Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers (Q2501204): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098263571 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0403046 / rank
 
Normal rank

Latest revision as of 07:01, 19 April 2024

scientific article
Language Label Description Also known as
English
Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
scientific article

    Statements

    Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2006
    0 references
    The authors combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equation, etc.) with a modular approach based on some of the ideas of the proof of Fermat's Last Theorem. The authors are going to -- present theoretical improvements to various aspects of the classical approach (through linear forms in logarithms), -- show how local information obtained through the modular approach (associate to a maybe -- existing solution of a Diophantine equation an elliptic curve) can be used to reduce the size of the bounds [for exponents and variables], and to show how this local information can be pieced together to prove that there are no missing solutions, -- solve various outstanding Diophantine equations. Using the described strategy, the authors show (after a short historical survey of known results) two spectacular results: The only perfect powers in the Fibonacci sequence \(F_n\) [\(F_0=0, F_1=1, F_{n+2} = F_{n+1} + F_n\)] are \(F_0=0,\; F_1=1,\; F_2=1,\; F_6=8\) and \(F_{12}=144\), and, the only perfect powers in the Lucas sequence \(L_n\) [\(L_0=2,\; L_1=1,\;\) and \(L_{n+2} = L_{n+1} + L_n\)] are \(L_1=1\) and \(L_3=4\). The authors describe in a very lucid way the eight main steps for deducing these results. Relying in part on a paper of \textit{M. Laurent, M. Mignotte} and \textit{Y. Nesterenko} [J. Number Theory 55, No. 2, 285--321 (1995; Zbl 0843.11036)], the authors prove an important improvement of lower bounds for linear forms in three logarithms, \[ \Lambda = b_2 \log \alpha_2 - b_1 \log \alpha_1 - b_3\log \alpha_3, \] where \(b_j\) are positive rational integers with gcd\((b_1,b_2,b_3)=1\), and the \(\alpha_j\) are non-zero multiplicatively independent algebraic numbers. Given \(\rho \geq e\), and assume that several inequalities concerning the integers \(K, L\), \(R, R_i\), \(S, S_i, T, T_i\), all \(\geq 3\), are fulfilled. Then either \[ | \Lambda| \cdot \max\left\{ \frac{LRe^{LR| \Lambda| /(2b_1)}}{2b_1}, \frac{LSe^{LS| \Lambda| /(2b_2)}}{2b_2}, \frac{LTe^{LT| \Lambda| /(2b_3)}}{2b_3} \right\} > \rho^{-KL} \] is true or one of the conditions (C1), (C2), (C3) holds. Here (C1) is \[ \exists r,s\in\mathbb{Z}, \; rb_2 = sb_1 \text{ with } 0<r\leq R_i, 0<s\leq S_i \text{ for some } i=1,2, \] (C2) is similar, and (C3) means \[ \exists r^\prime, s^\prime, t^\prime, t^{\prime\prime} \in \mathbb{Z} \text{ such that } s^\prime t^\prime b_1 + r^\prime t^{\prime\prime} b_2 + r^\prime s^\prime b_3 = 0, \] with bounds \[ 0<| r^\prime| < \min\left\{ R_1 +1, \left(\frac{(R_1+1)(S_1+1)}{T_1+1}\right)^{\frac12}\right\} \] and similar bounds for \(| s^\prime| ,\; | t| ^\prime\), and \(| t| ^{\prime\prime}\).
    0 references
    exponential Diophantine equations
    0 references
    lower bounds for linear forms in logarithms
    0 references
    Thue equation
    0 references
    elliptic curves
    0 references
    perfect powers in the Fibonacci sequence
    0 references
    Lucas sequence
    0 references
    ideas from Wiles' proof of Fermat's conjecture
    0 references
    upper bounds for solutions of Thue equations
    0 references
    regulator of algebraic number fields
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references