Primality proof for n = 389:
Take b = 2.
b^(n-1) mod n = 1.
97 is prime. b^((n-1)/97)-1 mod n = 15, which is a unit, inverse 26.
(97) divides n-1.
(97)^2 > n.
n is prime by Pocklington's theorem.