Primality proof for n = 503:

Take b = 2.

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

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

(251) divides n-1.

(251)^2 > n.

n is prime by Pocklington's theorem.