Take b = 2.

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

9463 is prime. b^((n-1)/9463)-1 mod n = 15, which is a unit, inverse 32806.

(9463) divides n-1.

(9463)^2 > n.

n is prime by Pocklington's theorem.