Primality proof for n = 26161:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=109.html>109 is prime.</a>
<br>b^((n-1)/109)-1 mod n = 13439, which is a unit, inverse 22038.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 1292, which is a unit, inverse 22901.
<p>(5 * 109) divides n-1.
<p>(5 * 109)^2 > n.
<p>n is prime by Pocklington's theorem.