Take b = 2.

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

641 is prime. b^((n-1)/641)-1 mod n = 3, which is a unit, inverse 428.

(641) divides n-1.

(641)^2 > n.

n is prime by Pocklington's theorem.