Take b = 2.

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

153259 is prime. b^((n-1)/153259)-1 mod n = 2064347, which is a unit, inverse 52404.

(153259) divides n-1.

(153259)^2 > n.

n is prime by Pocklington's theorem.