Take b = 2.

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

643 is prime. b^((n-1)/643)-1 mod n = 4095, which is a unit, inverse 1191.

(643) divides n-1.

(643)^2 > n.

n is prime by Pocklington's theorem.