Take b = 2.

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

43 is prime. b^((n-1)/43)-1 mod n = 161, which is a unit, inverse 257.

(43) divides n-1.

(43)^2 > n.

n is prime by Pocklington's theorem.