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