Take b = 2.

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

829 is prime. b^((n-1)/829)-1 mod n = 447875, which is a unit, inverse 411461.

(829) divides n-1.

(829)^2 > n.

n is prime by Pocklington's theorem.