A Use of Generalized Fibonacci Numbers in Finding Quadratic Factors

A. G. Shannon, Irving C. Tang and R. L. Ollerton

A chapter in Applications of Fibonacci Numbers, 1996, pp 443-450 from Springer

Abstract: Abstract The factorization of polynomials is a fundamental computational problem in finite fields. Daqing [2] and von zur Gathen [3] have summarized prominent results for permutation polynomials in which interest was rekindled because of possible cryptographic applications. In this paper, we shall consider some factorizations in terms of linear recurrence relations. (For a detailed exposition of linear recurrence and relations and finite fields, the reader is referred to Selmer [5].) Here, we utilize Tang’s analog minimisation procedure for finding quadratic factors of a polynomial [7]. It is outlined as an application of generalized Fibonacci numbers {u n }. The sequence {U n } is defined by (1.1) $$ {u_{n\,}}\, = \,{U_{{N^u}n\, - \,1}}\, - \,V{\,_{{N^u}n\, - \,2\,}}n \geqslant \,2 $$ with u 0 = 0,u 1 = 1, and {U n } and {V n } are sequences determined later. Clearly when U N = − V N = 1, the sequence of Fibonacci numbers is generated.

Date: 1996
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-0223-7_37

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

DOI: 10.1007/978-94-009-0223-7_37

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