Take b = 2.

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

45989 is prime. b^((n-1)/45989)-1 mod n = 1743507, which is a unit, inverse 309271.

(45989) divides n-1.

(45989)^2 > n.

n is prime by Pocklington's theorem.