Primality proof for n = 1487:
Take b = 2.
b^(n-1) mod n = 1.
743 is prime. b^((n-1)/743)-1 mod n = 3, which is a unit, inverse 496.
(743) divides n-1.
(743)^2 > n.
n is prime by Pocklington's theorem.