
Glossary: Prime Pages: Top 5000: 
Should the generalized Riemann hypothesis be proved, the following would gives us
a powerful test for primality.
Millers Test: Assume the generalized Riemann hypothesis is true. If n is an aSPRP for all integers a with 1 < a < 2(log n)^{2}, then n is prime.The constant 2 (which will no doubt be improved) is due to Bach.
See Also: Pseudoprime, PRP Related pages (outside of this work) References:
Chris K. Caldwell © 19992017 (all rights reserved)
