Primality proof for n = 1871:
Take b = 2.
b^(n-1) mod n = 1.
17 is prime.
b^((n-1)/17)-1 mod n = 8, which is a unit, inverse 234.
11 is prime.
b^((n-1)/11)-1 mod n = 863, which is a unit, inverse 800.
(11 * 17) divides n-1.
(11 * 17)^2 > n.
n is prime by Pocklington's theorem.