Primality proof for n = 307:
Take b = 2.
b^(n-1) mod n = 1.
17 is prime.
b^((n-1)/17)-1 mod n = 272, which is a unit, inverse 114.
2 is prime.
b^((n-1)/2)-1 mod n = 305, which is a unit, inverse 153.
(2 * 17) divides n-1.
(2 * 17)^2 > n.
n is prime by Pocklington's theorem.