Take b = 2.

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

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

(1531) divides n-1.

(1531)^2 > n.

n is prime by Pocklington's theorem.