Take b = 2.

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

179 is prime.

b^((n-1)/179)-1 mod n = 21049, which is a unit, inverse 1632.

11 is prime.

b^((n-1)/11)-1 mod n = 35422, which is a unit, inverse 30834.

(11^2 * 179) divides n-1.

(11^2 * 179)^2 > n.

n is prime by Pocklington's theorem.