Take b = 2.

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

33871 is prime. b^((n-1)/33871)-1 mod n = 1252953, which is a unit, inverse 741793.

(33871) divides n-1.

(33871)^2 > n.

n is prime by Pocklington's theorem.