Take b = 2.

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

59 is prime.

b^((n-1)/59)-1 mod n = 17829, which is a unit, inverse 8885.

13 is prime.

b^((n-1)/13)-1 mod n = 22081, which is a unit, inverse 29488.

(13 * 59) divides n-1.

(13 * 59)^2 > n.

n is prime by Pocklington's theorem.