Take b = 2.

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

1033843 is prime. b^((n-1)/1033843)-1 mod n = 3868493676, which is a unit, inverse 1333074980.

(1033843) divides n-1.

(1033843)^2 > n.

n is prime by Pocklington's theorem.