Take b = 2.

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

857 is prime. b^((n-1)/857)-1 mod n = 255, which is a unit, inverse 2205.

(857) divides n-1.

(857)^2 > n.

n is prime by Pocklington's theorem.