Primality proof for n = 2903:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1451.html>1451 is prime.</a>
<br>b^((n-1)/1451)-1 mod n = 3, which is a unit, inverse 968.
<p>(1451) divides n-1.
<p>(1451)^2 > n.
<p>n is prime by Pocklington's theorem.