Primality proof for n = 2949535533569:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1512421.html>1512421 is prime.</a>
<br>b^((n-1)/1512421)-1 mod n = 2761602708722, which is a unit, inverse 595986881521.
<p><a href=293.html>293 is prime.</a>
<br>b^((n-1)/293)-1 mod n = 576499177705, which is a unit, inverse 445218633149.
<p>(293 * 1512421) divides n-1.
<p>(293 * 1512421)^2 > n.
<p>n is prime by Pocklington's theorem.