Primality proof for n = 1657:
Take b = 3.
b^(n-1) mod n = 1.
23 is prime.
b^((n-1)/23)-1 mod n = 232, which is a unit, inverse 50.
3 is prime.
b^((n-1)/3)-1 mod n = 1585, which is a unit, inverse 23.
(3^2 * 23) divides n-1.
(3^2 * 23)^2 > n.
n is prime by Pocklington's theorem.