Take b = 2.

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

1061 is prime. b^((n-1)/1061)-1 mod n = 63, which is a unit, inverse 4750.

(1061) divides n-1.

(1061)^2 > n.

n is prime by Pocklington's theorem.