Primality proof for n = 152435752726607681:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=43305611570059.html>43305611570059 is prime.</a>
<br>b^((n-1)/43305611570059)-1 mod n = 44341761301560243, which is a unit, inverse 37706587074020438.
<p>(43305611570059) divides n-1.
<p>(43305611570059)^2 > n.
<p>n is prime by Pocklington's theorem.