Primality proof for n = 3055649:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=137.html>137 is prime.</a>
<br>b^((n-1)/137)-1 mod n = 853660, which is a unit, inverse 2467009.
<p><a href=41.html>41 is prime.</a>
<br>b^((n-1)/41)-1 mod n = 862869, which is a unit, inverse 2691065.
<p>(41 * 137) divides n-1.
<p>(41 * 137)^2 > n.
<p>n is prime by Pocklington's theorem.