Take b = 2.

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

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

(30773) divides n-1.

(30773)^2 > n.

n is prime by Pocklington's theorem.