Primality proof for n = 3848175851593:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=407203.html>407203 is prime.</a>
<br>b^((n-1)/407203)-1 mod n = 197523662354, which is a unit, inverse 3187516971646.
<p><a href=393761.html>393761 is prime.</a>
<br>b^((n-1)/393761)-1 mod n = 1737520707303, which is a unit, inverse 2093933288755.
<p>(393761 * 407203) divides n-1.
<p>(393761 * 407203)^2 > n.
<p>n is prime by Pocklington's theorem.