Take b = 2.

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

809 is prime. b^((n-1)/809)-1 mod n = 255, which is a unit, inverse 330.

(809) divides n-1.

(809)^2 > n.

n is prime by Pocklington's theorem.