Primality proof for n = 255061103803346185973548526989:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=391669282183.html>391669282183 is prime.</a>
<br>b^((n-1)/391669282183)-1 mod n = 197690604069135969009134633081, which is a unit, inverse 83843030690213050324461345524.
<p><a href=1075060097.html>1075060097 is prime.</a>
<br>b^((n-1)/1075060097)-1 mod n = 247019199996362412111726712205, which is a unit, inverse 12859343024447538925475948031.
<p>(1075060097 * 391669282183) divides n-1.
<p>(1075060097 * 391669282183)^2 > n.
<p>n is prime by Pocklington's theorem.