Take b = 2.

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

61 is prime. b^((n-1)/61)-1 mod n = 1116, which is a unit, inverse 415.

(61) divides n-1.

(61)^2 > n.

n is prime by Pocklington's theorem.