Take b = 2.

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

74729 is prime. b^((n-1)/74729)-1 mod n = 3, which is a unit, inverse 49820.

(74729) divides n-1.

(74729)^2 > n.

n is prime by Pocklington's theorem.