Take b = 3.

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

13 is prime.

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

7 is prime.

b^((n-1)/7)-1 mod n = 6762, which is a unit, inverse 5646.

(7 * 13) divides n-1.

(7 * 13)^2 > n.

n is prime by Pocklington's theorem.