Primality proof for n = 160507:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=241.html>241 is prime.</a>
<br>b^((n-1)/241)-1 mod n = 74486, which is a unit, inverse 94704.
<p><a href=37.html>37 is prime.</a>
<br>b^((n-1)/37)-1 mod n = 49745, which is a unit, inverse 32708.
<p>(37 * 241) divides n-1.
<p>(37 * 241)^2 > n.
<p>n is prime by Pocklington's theorem.