Take b = 2.

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

13 is prime. b^((n-1)/13)-1 mod n = 106, which is a unit, inverse 110.

(13) divides n-1.

(13)^2 > n.

n is prime by Pocklington's theorem.