Take b = 2.

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

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

(308713) divides n-1.

(308713)^2 > n.

n is prime by Pocklington's theorem.