Take b = 2.

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

2551 is prime. b^((n-1)/2551)-1 mod n = 157958, which is a unit, inverse 199577.

(2551) divides n-1.

(2551)^2 > n.

n is prime by Pocklington's theorem.