Primality proof for n = 19:

Take b = 2.

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

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

(3^2) divides n-1.

(3^2)^2 > n.

n is prime by Pocklington's theorem.