Take b = 2.

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

929 is prime. b^((n-1)/929)-1 mod n = 228192, which is a unit, inverse 77984.

(929) divides n-1.

(929)^2 > n.

n is prime by Pocklington's theorem.