Factoring integers defined by second and third order recurrence relations

Show simple item record

dc.contributor.advisor Radziszowski, Stanislaw en_US
dc.contributor.advisor Anderson, Peter en_US
dc.contributor.advisor Arpaia, Pasquale en_US
dc.contributor.author Ocke, Kirk
dc.date.accessioned 2011-07-26T20:50:17Z
dc.date.available 2011-07-26T20:50:17Z
dc.date.issued 1997
dc.identifier.uri http://hdl.handle.net/1850/13857
dc.description.abstract Factoring the first two-hundred and fifty Fibonacci numbers using just trial division would take an unreasonable amount of time. Instead the problem must be attacked using modern factorization algorithms. We look not only at the Fibonacci numbers, but also at factoring integers defined by other second and third order recurrence relations. Specifically we include the Fibonacci, Tribonacci and Lucas numbers. We have verified the known factorizations of first 382 Fibonacci numbers and the first 185 Lucas numbers, we also completely factored the first 311 Tribonacci numbers.
dc.language.iso en_US
dc.subject Computer science en_US
dc.subject Number theory en_US
dc.subject.lcc QA242 .O25 1997
dc.subject.lcsh Factorization (Mathematics)
dc.subject.lcsh Fibonacci numbers
dc.title Factoring integers defined by second and third order recurrence relations
dc.type Thesis
dc.description.college B. Thomas Golisano College of Computing and Information Sciences
dc.description.department Department of Computer Science

Files in this item

Files Size Format View
KOckeThesis12-08-1997.pdf 1.297Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse