Take b = 2.

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

2351 is prime. b^((n-1)/2351)-1 mod n = 63, which is a unit, inverse 8509.

(2351) divides n-1.

(2351)^2 > n.

n is prime by Pocklington's theorem.