Take b = 2.

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

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

(115751) divides n-1.

(115751)^2 > n.

n is prime by Pocklington's theorem.