Take b = 2.

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

1433 is prime. b^((n-1)/1433)-1 mod n = 16779, which is a unit, inverse 16815.

(1433) divides n-1.

(1433)^2 > n.

n is prime by Pocklington's theorem.