Take b = 2.

b^(n-1) mod n = 1.

1013 is prime. b^((n-1)/1013)-1 mod n = 63, which is a unit, inverse 193.

(1013) divides n-1.

(1013)^2 > n.

n is prime by Pocklington's theorem.