Take b = 2.

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

631 is prime. b^((n-1)/631)-1 mod n = 1637, which is a unit, inverse 441.

(631) divides n-1.

(631)^2 > n.

n is prime by Pocklington's theorem.