Description of is_euler_prp

[haru-44]

I’m sorry to bother you again.

gmpy/src/gmpy_mpz_prp.c

Lines 134 to 135 in 2beaae2

	"Then an Euler probable prime requires:\n\n"
	" a**((n-1)/2) == 1 (mod n)");

This description is different from the immediately preceding comment.
I think the correct description should be a**((n-1)/2) == (a/n) (mod n) [(a/n) is the Jacobi symbol].

[haru-44]

thanks