A proof of the Hoggatt-Bergum conjecture (Q4243670)

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 1289027
Language Label Description Also known as
default for all languages
No label defined
    English
    A proof of the Hoggatt-Bergum conjecture
    scientific article; zbMATH DE number 1289027

      Statements

      A proof of the Hoggatt-Bergum conjecture (English)
      0 references
      0 references
      19 May 1999
      0 references
      Fibonacci numbers
      0 references
      diophantine \(m\)-tuple
      0 references
      simultaneous Pell equations
      0 references
      linear forms in logarithms
      0 references
      Baker-Davenport reduction procedure
      0 references
      Hoggatt-Bergum conjecture
      0 references
      A set of positive integers \( \{a_{1}, a_{2}, \ldots , a_{m}\}\) is called a \textit{diophantine \(m\)-tuple} (in the narrow sense) if \(a_{i}a_{j}+1\) is a perfect square for all \(1 \leq i < j \leq m\). The first examples of diophantine quadruples \( \{a, b, s, d \}\) were constructed by Fermat and Euler [see \textit{L. E. Dickson}, History of the Theory of Numbers, Vol. 2, Chelsea, New York, pp. 523-529 (1966)]. The well-known result of \textit{V.~E. Hoggatt} and \textit{G. E. Bergum} [Fibonacci Q. 15, 323-330 (1977; Zbl 0383.10007)] implies that for any \(k \geq 1\) the four integers \(F_{2k}\), \(F_{2k+2}\), \(F_{2k+4}\) and \(d= 4 F_{2k+1} F_{2k+2} F_{2k+3}\), where \(F_{n}\) is the \(n\)-th Fibonacci number, form a diophantine quadruple. Hoggatt and Bergum conjectured that the value \(d\) in any diophantine quadruple of the form \(\{F_{2k},F_{2k+2}, F_{2k+4}, d \}\) is unique. This conjecture for \(k=1\) was first proved by \textit{A. Baker} and \textit{H. M. Davenport} [Q. J. Math., Oxf. (2) 20, 129-137 (1969; Zbl 0177.06802)]. The author extends the Baker-Davenport result and proves the Hoggatt-Bergum conjecture for all positive integers \(k\).
      0 references

      Identifiers

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