Primality proof for n = 2955889:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1579.html>1579 is prime.</a>
<br>b^((n-1)/1579)-1 mod n = 537443, which is a unit, inverse 1897992.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 817126, which is a unit, inverse 1608490.
<p>(13 * 1579) divides n-1.
<p>(13 * 1579)^2 > n.
<p>n is prime by Pocklington's theorem.