Take b = 2.

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

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

(3) divides n-1.

(3)^2 > n.

n is prime by Pocklington's theorem.