Primality proof for n = 1699:

Take b = 2.

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

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

(283) divides n-1.

(283)^2 > n.

n is prime by Pocklington's theorem.