Take b = 2.

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

727 is prime. b^((n-1)/727)-1 mod n = 15, which is a unit, inverse 194.

(727) divides n-1.

(727)^2 > n.

n is prime by Pocklington's theorem.