Take b = 2.

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

509 is prime. b^((n-1)/509)-1 mod n = 3, which is a unit, inverse 340.

(509) divides n-1.

(509)^2 > n.

n is prime by Pocklington's theorem.