Primality proof for n = 4603:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=59.html>59 is prime.</a>
<br>b^((n-1)/59)-1 mod n = 1537, which is a unit, inverse 4028.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 2103, which is a unit, inverse 4174.
<p>(13 * 59) divides n-1.
<p>(13 * 59)^2 > n.
<p>n is prime by Pocklington's theorem.