Take b = 2.

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

263 is prime. b^((n-1)/263)-1 mod n = 63, which is a unit, inverse 1178.

(263) divides n-1.

(263)^2 > n.

n is prime by Pocklington's theorem.