Maximum Length of the Euclidean Algorithm and Continued Fractions in F(X)

Arnold Knopfmacher and John Knopfmacher

A chapter in Applications of Fibonacci Numbers, 1990, pp 217-222 from Springer

Abstract: Abstract In this paper, a bound is derived for the maximum length of the Euclidean algorithm for pairs of polynomials h, k in F[x], where F is an arbitrary field, and various explicit examples of maximum length are considered. In particular we show that pairs of consecutive Fibonacci polynomials and, more generally, many types of orthogonal polynomials lead to examples of maximum length.

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_25

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

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

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 ().