newsletterlibrary.com

Top : Science : Math : Number Theory : Prime Numbers :
Primality Tests

Categories
Primality Proving 
Pseudoprimes 

Websites
Papers on primality tests and Frobenius pseudoprimes.
site exerpt
Pseudoprimes/Probable Primes  I now have a weblog devoted to updates on my research. Recent Developments in Primality Testing Here are slides of my talk on this subject. The talk is contained in two separate files. talk0797.tex(16K) talk0797.dvi(20K) talk0797.ps (152K) talk0797.pdf (244K) talk0797a.tex(4K)...
http://www.pseudoprime.com/pseudo.html

Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
site exerpt
Least primitive root of prime numbers  Least primitive root of prime numbers Least prime primitive root of prime numbers Least base necessary to prove the primality of a number Introduction Results References Links Contact [Up] Introduction Let p be a prime number. Fermat's little theorem[1] states...
http://www.ieeta.pt/~tos/p-roots.html

Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
site exerpt
Lucas Sequences in Cryptography  This is a short note on the practical usefulness of Lucas sequences in applied cryptography. A Lucas sequence is a sequence of integers characterized by two parameters, P and Q. In practice Q is always 1 and the sequence is...
http://www.eskimo.com/~weidai/lucas.html

Includes details of primality testing using the Perrin sequence, listing the first 17 Perrin pseudoprimes.
site exerpt
Perrin numbers  Motivated by a theorem of E. Lucas: If n is prime it divides A(n) exactly, the question whether primality of n follows from n divides A(n) exactly was formulated 1899. So far, they say, nobody has found a composite n...
http://ftp.ai.univie.ac.at/perrin.html

A deterministic polynomial time primality test, developed by Manindra Agarwal, Nitin Saxena and Neeraj Kayal of IIT Kanpur. Preprint in PS/PDF and links to media reports.
site exerpt
Object not found!  L was not found on this server. If you entered the URL manually please check your spelling and try again. If you think this is a server error, please contact the webmaster. Error 404 www.cse.iitk.ac.in Thu Oct 27 09:17:28 2005...
http://www.cse.iitk.ac.in/news/primality.html

Suggests to measure reliability of probabilistic primality tests by applying them to odd composites. No false prime reports found in Maple's isprime.
site exerpt
Detecting False Reports In Primality Tests By The Oddcomp(z) Method  There are more primes than the number of atoms in the universe [1,2 All standing trees on planet Earth will not be sufficient to produce paper pulp to publish all the 512-bit primes in bound volumes. How do we detect...
http://web.singnet.com.sg/~huens/paper23.htm

A report by Minjae Kim.
site exerpt
Contrast primality tests  Contrast various tests for primality Minjae Kim Department of Computer Science Illinois Institute of Technology December 4, 2002 Abstract I present there are various tests for primality developed for a long time. We can see there has existed many different...
http://www.csam.iit.edu/~cs549/c...oject/Contrastprimalitytests.htm

A small Java applet to interactively perform strong probable primality tests.
site exerpt
Aesthetics of the Prime Sequence  Primes and nucleotide basesGraphicsAutism and primesSoftwareRelated LinksCopyrights Contemporary Research Contact Result Format: TestNumber Is the number you entering. It support positive numbers of any size. IsPrime or IsProbablyPrime or NoPrime Primality status. For numbers less than 9223372036854775807 the algorithm is...
http://www.2357.a-tu.net/index.php?link=Primality

Articles on many different tests and related subjects.
http://mathworld.wolfram.com/topics/PrimalityTesting.html