Take b = 2.

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

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

(347) divides n-1.

(347)^2 > n.

n is prime by Pocklington's theorem.