- Sep 21, 2013View SourceBernhard Helmes wrote:
> A new and better propositionThe gremlins refuse to consider a
test that is not true for primes.
Consider, for example, the prime
p = 1037*2^8-1 = 265471
and set a = 3, x = 2, y = 1.
Then this prime fails your latest wriggle:
> (x+yA)^(2^m)<>1 mod p with A=sqrt(a)print(Mod(Mod(1,265471)*(2+A),A^2-3)^(2^8));
Mod(Mod(1, 265471), A^2 - 3)
Please do not post probable primality "tests"
that are failed by primes.
David (trying to control the grumpy gremlins:-)