Primality proof for n = 49645261:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=41.html>41 is prime.</a>
<br>b^((n-1)/41)-1 mod n = 21966832, which is a unit, inverse 6825436.
<p><a href=31.html>31 is prime.</a>
<br>b^((n-1)/31)-1 mod n = 22206688, which is a unit, inverse 41093098.
<p>(31^2 * 41) divides n-1.
<p>(31^2 * 41)^2 > n.
<p>n is prime by Pocklington's theorem.