Primality proof for n = 42433:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=17.html>17 is prime.</a>
<br>b^((n-1)/17)-1 mod n = 33402, which is a unit, inverse 12362.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 42375, which is a unit, inverse 3658.
<p>(13 * 17) divides n-1.
<p>(13 * 17)^2 > n.
<p>n is prime by Pocklington's theorem.