Diophantine Representation of Fibonacci Numbers Over Natural Numbers

James P. Jones

A chapter in Applications of Fibonacci Numbers, 1990, pp 197-201 from Springer

Abstract: Abstract The sequence of Fibonacci numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, …, defined by F0 = 0, F1 = 1, F n+2 = F n + F n+1, played an important role in the solution of one of the Hilbert Problems. The Fibonacci sequence was used in 1970 by the Russian mathematician Y.V. Matijasevič to solve the Tenth Problem of Hilbert. The Tenth Problem of Hilbert was the problem of existence of an algorithm for deciding solvability of Diophantine equations. Matijasevič [8] [9] made use of divisibility properties of the Fibonacci sequence to prove that every recursively enumerable set is Diophantine. This solved Hilbert’s Tenth Problem in the negative.

Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-1910-5_22

Ordering information: This item can be ordered from
http://www.springer.com/9789400919105

DOI: 10.1007/978-94-009-1910-5_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().