Take b = 2.

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

523 is prime. b^((n-1)/523)-1 mod n = 1023, which is a unit, inverse 496.

(523) divides n-1.

(523)^2 > n.

n is prime by Pocklington's theorem.