Primality proof for n = 41081:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=79.html>79 is prime.</a>
<br>b^((n-1)/79)-1 mod n = 6276, which is a unit, inverse 10807.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 32464, which is a unit, inverse 20438.
<p>(13 * 79) divides n-1.
<p>(13 * 79)^2 > n.
<p>n is prime by Pocklington's theorem.