Take b = 2.

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

5 is prime.

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

3 is prime.

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

(3^4 * 5) divides n-1.

(3^4 * 5)^2 > n.

n is prime by Pocklington's theorem.