Primality proof for n = 151:

Take b = 3.

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

5 is prime.
b^((n-1)/5)-1 mod n = 58, which is a unit, inverse 138.

(5^2) divides n-1.

(5^2)^2 > n.

n is prime by Pocklington's theorem.