Show simple item record

dc.contributor.authorTamir, Danen_US
dc.date.accessioned2007-11-20T10:03:26Z
dc.date.available2012-02-24T10:03:38Z
dc.date.issued2007-11-05en_US
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/2591
dc.descriptionIssued as Texas State University-San Marcos, Department of Computer Science, Technical Report number TXSTATE-CS-TR-2007-8, November 5, 2007.en_US
dc.description.abstractA new, computationally efficient, strong primality test procedure is proposed.en_US
dc.formatText
dc.format.extent3 pages
dc.format.medium1 file (.pdf)
dc.language.isoen_US
dc.subjectNumber theoryen_US
dc.subjectPrime numbersen_US
dc.subjectPrimality testen_US
dc.subjectPerrin sequenceen_US
dc.subjectMultiple precisionen_US
dc.titleGenerating Large Prime Numbers Using the Perrin Sequenceen_US
txstate.documenttypeTechnical Report
txstate.departmentComputer Science


Download

Thumbnail

This item appears in the following Collection(s)

Show simple item record