Take b = 2.

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

129097 is prime. b^((n-1)/129097)-1 mod n = 63, which is a unit, inverse 393439.

(129097) divides n-1.

(129097)^2 > n.

n is prime by Pocklington's theorem.