Primality proof for n = 1364367483307:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=56767.html>56767 is prime.</a>
<br>b^((n-1)/56767)-1 mod n = 87947923949, which is a unit, inverse 794600744371.
<p><a href=5077.html>5077 is prime.</a>
<br>b^((n-1)/5077)-1 mod n = 214374611272, which is a unit, inverse 1020293145660.
<p>(5077 * 56767) divides n-1.
<p>(5077 * 56767)^2 > n.
<p>n is prime by Pocklington's theorem.