Take b = 2.

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

1801 is prime. b^((n-1)/1801)-1 mod n = 7901, which is a unit, inverse 1065.

(1801) divides n-1.

(1801)^2 > n.

n is prime by Pocklington's theorem.