Primality Tests Prime Numbers Number Theory

@Intermall

Top: Science: Math: Number_Theory: Prime_Numbers: Primality_Tests:

• Top/Science/Math/Number Theory/Computational

• - 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."
  
• - 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.
  
• - Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
  
• - Presents a probabilistic primality test based on power series.
  
• - Includes details of primality testing using the Perrin sequence, listing the first 17 Perrin pseudoprimes.
  
• - A report by Minjae Kim.
  
• - A small Java applet to interactively perform strong probable primality tests.
  
• - Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
  
• - Answers to some frequently asked question about the recent proof that PRIMES is in P, compiled by Anton Stiglic.