Mersenne: Back to the maths of primes for a sec....

[Chris Jefferson]

Sorry, just a quick question!
In various places, I have read that the generalized Riemann hypothesis is 
true, then there is a very simple test for primeness, namely if n is an
a-SPRP for all integers a<2(log n)^2, then n is prime. From a computation
viewpoint, is this actually of any use, as it will show if numbers are
composite and if it is quick, then primes could be checked using it, then
double checked via another means, also giving the opportunity to disprove
a major hypothesis of maths...

------------------------------------
Chris Jefferson, Girton College, Cambridge, [EMAIL PROTECTED]
------------------------------------
I have a proof that x^n+y^n=z^n never has integer solutions for n>2.
However, it won't fit into my signature file....
------------------------------------

________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm