Status
Available
Library's review
Indeholder "1. Introduction", "2. Trial division", " 2.1 Quadratic residues", " 2.2 Timing", "3. The continued fraction method", " 3.1 Expansion phase", " 3.2 Finding Square-sets", " 3.3 Concluding remarks", "4. Primality testing", " 4.1 Using factors of N-1", " 4.2 Using factors of other numbers",
Meget sjovt. Jeg kan huske at Thorkil havde kontor på R1 gangen og at han havde udskrifter liggende med Fibonacci tal og primfaktorisering af dem.
Show More
" 4.3 Probabilistic tests", " 4.4 Applying primality tests", "5. Pollard's methods", "6. Combining the methods", "7. Results", " 7.1 Algebraic factors", " 7.2 Table format", " 7.3 Fibonacci and Lucas numbers", " 7.4 2^n - 1 and 2^n + 1", " 7.5 A large prime", "References", "A. Mathematical background", "B. Multi precision arithmetic", "C. Implementation overview", "D. Fibonacci numbers", "E. Lucas numbers", "F. 2^n - 1", "G. 2^n + 1", "H. 2^n - 2^((n+1)/2) + 1", "I. 2^n + 2^((n+1)/2) + 1".Meget sjovt. Jeg kan huske at Thorkil havde kontor på R1 gangen og at han havde udskrifter liggende med Fibonacci tal og primfaktorisering af dem.
Show Less
Publication
Computer Science Dept., Aarhus University (1982), Unknown Binding, 129 pages
Language
Original language
English
Physical description
129 p.; 20.6 cm
Local notes
Omslag: Ikke angivet
Omslaget viser forfatternavn og titel på rød baggrund
Indskannet omslag - N650U - 150 dpi
Side 3: The problem of distinguishing prime numbers from composites, and of resolving compositee numbers into their prime factors, is one of the most important and useful in all of arithmetic. ... The dignity of science seems to demand that every aid to the solution of such an elegant and celebrated problem be zealously cultivated. -- Karl Friedrich Gauss 'Disquisitiones Arithmetica' Art. 329 (1801).
Omslaget viser forfatternavn og titel på rød baggrund
Indskannet omslag - N650U - 150 dpi
Side 3: The problem of distinguishing prime numbers from composites, and of resolving compositee numbers into their prime factors, is one of the most important and useful in all of arithmetic. ... The dignity of science seems to demand that every aid to the solution of such an elegant and celebrated problem be zealously cultivated. -- Karl Friedrich Gauss 'Disquisitiones Arithmetica' Art. 329 (1801).
Pages
129