Take b = 2.

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

79 is prime. b^((n-1)/79)-1 mod n = 768, which is a unit, inverse 608.

(79) divides n-1.

(79)^2 > n.

n is prime by Pocklington's theorem.