Take b = 2.

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

53 is prime. b^((n-1)/53)-1 mod n = 592, which is a unit, inverse 800.

(53) divides n-1.

(53)^2 > n.

n is prime by Pocklington's theorem.