Testing an integer for prime or composite character. Probabilisitc tests yield an answer with high probability of correctness, primality proofs yield an answer which is certain to be correct, often with a certificate of primality which can be verified mo...
This page was last updated on October 7th, 2008
This page was last updated on October 7th, 2008
Primality Tests (from Prime Numbers)
Canadian Content » Science » Math » Number_Theory » Prime_Numbers » Primality_Tests »
Primality Testing Applet
A small Java applet to interactively perform strong probable primality tests.
The PRIMES is in P Little FAQ
Answers to some frequently asked question about the recent proof that PRIMES is in P, compiled by Anton Stiglic.
Lucas Sequences in Cryptography
Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
PRIMES Is In P
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.
Contrast Primality Tests
A report by Minjae Kim.
Perrin Numbers
Includes details of primality testing using the Perrin sequence, listing the first 17 Perrin pseudoprimes.
Primality Testing
The problem of primality testing and factorization are two distinct problems. If we concentrate on primality testing, we never need to know the actual factors. The only question to be answered is "is the number in question prime or composite."
Detecting False Reports In Primality Tests By The Oddcomp(z) Method
Presents a probabilistic primality test based on power series.
Least Primitive Root of Prime Numbers
Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
A small Java applet to interactively perform strong probable primality tests.
Answers to some frequently asked question about the recent proof that PRIMES is in P, compiled by Anton Stiglic.
Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
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.
A report by Minjae Kim.
Includes details of primality testing using the Perrin sequence, listing the first 17 Perrin pseudoprimes.
The problem of primality testing and factorization are two distinct problems. If we concentrate on primality testing, we never need to know the actual factors. The only question to be answered is "is the number in question prime or composite."
Presents a probabilistic primality test based on power series.
Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
Prime Numbers >> Primality Tests yielded other results on Canadian Content:
|
We haven't found any relevant pages yet. |
|
 |
-
