Primality proof for n = 1481:

Take b = 2.

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

37 is prime.
b^((n-1)/37)-1 mod n = 783, which is a unit, inverse 575.

5 is prime.
b^((n-1)/5)-1 mod n = 723, which is a unit, inverse 1354.

(5 * 37) divides n-1.

(5 * 37)^2 > n.

n is prime by Pocklington's theorem.