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