Primality proof for n = 8263:
Take b = 2.
b^(n-1) mod n = 1.
17 is prime.
b^((n-1)/17)-1 mod n = 5154, which is a unit, inverse 1095.
3 is prime.
b^((n-1)/3)-1 mod n = 239, which is a unit, inverse 5428.
(3^5 * 17) divides n-1.
(3^5 * 17)^2 > n.
n is prime by Pocklington's theorem.