Take b = 2.

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

19 is prime. b^((n-1)/19)-1 mod n = 68, which is a unit, inverse 59.

(19) divides n-1.

(19)^2 > n.

n is prime by Pocklington's theorem.