Primality proof for n = 114749:

Take b = 2.

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

28687 is prime.
b^((n-1)/28687)-1 mod n = 15, which is a unit, inverse 7650.

(28687) divides n-1.

(28687)^2 > n.

n is prime by Pocklington's theorem.