Take b = 2.

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

107 is prime. b^((n-1)/107)-1 mod n = 1393, which is a unit, inverse 1400.

(107) divides n-1.

(107)^2 > n.

n is prime by Pocklington's theorem.