Primality proof for n = 76152123566553479:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=4156739.html>4156739 is prime.</a>
<br>b^((n-1)/4156739)-1 mod n = 72328433532179141, which is a unit, inverse 59481731497343060.
<p><a href=1354841.html>1354841 is prime.</a>
<br>b^((n-1)/1354841)-1 mod n = 25366394481550358, which is a unit, inverse 14333593687874871.
<p>(1354841 * 4156739) divides n-1.
<p>(1354841 * 4156739)^2 > n.
<p>n is prime by Pocklington's theorem.