Take b = 2.

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

83 is prime. b^((n-1)/83)-1 mod n = 3, which is a unit, inverse 56.

(83) divides n-1.

(83)^2 > n.

n is prime by Pocklington's theorem.