Take b = 2.

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

7507 is prime. b^((n-1)/7507)-1 mod n = 31078419, which is a unit, inverse 8467402.

(7507) divides n-1.

(7507)^2 > n.

n is prime by Pocklington's theorem.