Take b = 2.

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

47 is prime. b^((n-1)/47)-1 mod n = 567, which is a unit, inverse 308.

(47) divides n-1.

(47)^2 > n.

n is prime by Pocklington's theorem.