Primality proof for n = 295429921339288635355502201959:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=93575169138071.html>93575169138071 is prime.</a>
<br>b^((n-1)/93575169138071)-1 mod n = 286279076949539690198556921030, which is a unit, inverse 276404923564080317163833908549.
<p><a href=12545359681.html>12545359681 is prime.</a>
<br>b^((n-1)/12545359681)-1 mod n = 18510374850088764107039657359, which is a unit, inverse 98850597780046410562065514978.
<p>(12545359681 * 93575169138071) divides n-1.
<p>(12545359681 * 93575169138071)^2 > n.
<p>n is prime by Pocklington's theorem.