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.
Library of Congress Subject Headings
Factorization (Mathematics); Fibonacci numbers
Publication Date
1997
Document Type
Thesis
Department, Program, or Center
Computer Science (GCCIS)
Advisor
Radziszowski, Stanislaw
Advisor/Committee Member
Anderson, Peter
Advisor/Committee Member
Arpaia, Pasquale
Recommended Citation
Ocke, Kirk, "Factoring integers defined by second and third order recurrence relations" (1997). Thesis. Rochester Institute of Technology. Accessed from
https://repository.rit.edu/theses/657
Campus
RIT – Main Campus
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA242 .O25 1997