Primality proof for n = 1031:
Take b = 2.
b^(n-1) mod n = 1.
103 is prime. b^((n-1)/103)-1 mod n = 1023, which is a unit, inverse 902.
(103) divides n-1.
(103)^2 > n.
n is prime by Pocklington's theorem.