Lucas and fibonacci numbers and some diophantine Equations (Q5332260)

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 3206350
Language Label Description Also known as
default for all languages
No label defined
    English
    Lucas and fibonacci numbers and some diophantine Equations
    scientific article; zbMATH DE number 3206350

      Statements

      Lucas and fibonacci numbers and some diophantine Equations (English)
      0 references
      0 references
      1965
      0 references
      number theory
      0 references
      The Fibonacci numbers are \( u_{n}=5^{-1 / 2}\left(a^{n}-b^{n}\right) \), and the Lucas numbers are \( v_{n}=a^{n}+b^{n} \), where \( a, b=\frac{1}{2}\left(1 \pm 5^{1 / 2}\right) \). The author previously [J. Lond. Math. Soc. 39, 537--540 (1964; Zbl 0127.26705)] proved that \( u_{n} \) is a perfect square only if \( n=0 \), 1,2 or 12. He now proves this again, more simply, and obtains similar results for \( v_{n} \) (a square only if \( n=1 \) or 3\( ) \) and for \( \frac{1}{2} u_{n}(n=0, \pm 3,6) \) and \( \frac{1}{2} v_{n}(n=0 \) or \(\pm 6) \). He can then find all solutions of eight quartic Diophantine equations, each obtained from one or other of the Pellian equations \( p^{2}-5 q^{2}= \pm 1, \pm 4 \) by restricting \( p \) or \( q \) to be a square or the double of a square.
      0 references

      Identifiers