Primality proof for n = 89:
Take b = 2.
b^(n-1) mod n = 1.
11 is prime. b^((n-1)/11)-1 mod n = 77, which is a unit, inverse 37.
(11) divides n-1.
(11)^2 > n.
n is prime by Pocklington's theorem.