Is the following statement wrong?
If C(p-1,(p-1)/2) mod p = p-1 then p is prime
C(6,3) mod 7 = 6
If it is correct how can we prove it?
Thank you very much for any comment.
Follow Math Help Forum on Facebook and Google+
5 is prime C(4,2) mod 5=1
My claim is that if C(p-1,(p-1/2)) mod p= p-1 THEN p is prime.
The fisrt counterexample was found.
p=5097 is composite
I do not know if there are other counterexamples.
View Tag Cloud