Take b = 2.

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

773 is prime. b^((n-1)/773)-1 mod n = 5303, which is a unit, inverse 13606.

(773) divides n-1.

(773)^2 > n.

n is prime by Pocklington's theorem.