Open AccessInteger Factorization
Author(s) -
Thorkil Naur
Publication year - 1983
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v11i144.7419
Subject(s) - fibonacci number , primality test , mathematics , integer (computer science) , factorization , fraction (chemistry) , prime factor , number theory , combinatorics , lucas number , discrete mathematics , integer factorization , arithmetic , lucas sequence , factoring , prime number , prime (order theory) , computer science , algorithm , fibonacci polynomials , encryption , chemistry , public key cryptography , difference polynomials , organic chemistry , orthogonal polynomials , programming language , operating system , finance , economics
This report gives a summary of methods for factoring large integers and presents particular factorizations obtained by these methods using the computer facilities at DAIMI. We have used trial division, the continued fraction method, Pollard's methods, and various tests for primality to obtain new factorizations of Fibonacci numbers, Lucas numbers and numbers of the form 2 uparrow n ± 1.