Primality proof for n = 2305472951:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1373.html>1373 is prime.</a>
<br>b^((n-1)/1373)-1 mod n = 319855112, which is a unit, inverse 403552596.
<p><a href=71.html>71 is prime.</a>
<br>b^((n-1)/71)-1 mod n = 1508896854, which is a unit, inverse 67666692.
<p>(71 * 1373) divides n-1.
<p>(71 * 1373)^2 > n.
<p>n is prime by Pocklington's theorem.