Take b = 2.

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

853 is prime. b^((n-1)/853)-1 mod n = 15, which is a unit, inverse 2958.

(853) divides n-1.

(853)^2 > n.

n is prime by Pocklington's theorem.