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