Primality proof for n = 5171:
Take b = 2.
b^(n-1) mod n = 1.
47 is prime.
b^((n-1)/47)-1 mod n = 1253, which is a unit, inverse 2992.
11 is prime.
b^((n-1)/11)-1 mod n = 645, which is a unit, inverse 3760.
(11 * 47) divides n-1.
(11 * 47)^2 > n.
n is prime by Pocklington's theorem.