Take b = 2.

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

68521 is prime. b^((n-1)/68521)-1 mod n = 707758818, which is a unit, inverse 296071965.

(68521) divides n-1.

(68521)^2 > n.

n is prime by Pocklington's theorem.