Take b = 2.

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

1601 is prime. b^((n-1)/1601)-1 mod n = 3, which is a unit, inverse 1068.

(1601) divides n-1.

(1601)^2 > n.

n is prime by Pocklington's theorem.