Take b = 2.

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

80897 is prime. b^((n-1)/80897)-1 mod n = 475353798, which is a unit, inverse 284871290.

(80897) divides n-1.

(80897)^2 > n.

n is prime by Pocklington's theorem.