Take b = 2.

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

659 is prime. b^((n-1)/659)-1 mod n = 7156, which is a unit, inverse 3591.

(659) divides n-1.

(659)^2 > n.

n is prime by Pocklington's theorem.