Generating Large Prime Numbers Using the Perrin Sequence

Simple item page
dc.contributor.authorTamir, Dan
dc.date.accessioned2007-11-20T10:03:26Z
dc.date.available2012-02-24T10:03:38Z
dc.date.issued2007-11-05
dc.description.abstractA new, computationally efficient, strong primality test procedure is proposed.
dc.description.departmentComputer Science
dc.formatText
dc.format.extent3 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationTamir, D. (2007). Generating large prime numbers using the Perrin sequence (Report No. TXSTATE-CS-TR-2007-8). Texas State University-San Marcos, Department of Computer Science.
dc.identifier.urihttps://hdl.handle.net/10877/2591
dc.language.isoen
dc.subjectnumber theory
dc.subjectprime numbers
dc.subjectprimality test
dc.subjectPerrin sequence
dc.subjectmultiple precision
dc.subjectComputer Science
dc.titleGenerating Large Prime Numbers Using the Perrin Sequence
dc.typeTechnical Report

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
fulltext.pdf
Size:
31.95 KB
Format:
Adobe Portable Document Format
Download

Collections

College of Science and Engineering