Take b = 2.

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

15101 is prime. b^((n-1)/15101)-1 mod n = 3, which is a unit, inverse 10068.

(15101) divides n-1.

(15101)^2 > n.

n is prime by Pocklington's theorem.