Take b = 2.

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

739 is prime. b^((n-1)/739)-1 mod n = 5859, which is a unit, inverse 3606.

(739) divides n-1.

(739)^2 > n.

n is prime by Pocklington's theorem.