Primality proof for n = 43:
Take b = 2.
b^(n-1) mod n = 1.
7 is prime. b^((n-1)/7)-1 mod n = 20, which is a unit, inverse 28.
(7) divides n-1.
(7)^2 > n.
n is prime by Pocklington's theorem.