Primality proof for n = 490463:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=661.html>661 is prime.</a>
<br>b^((n-1)/661)-1 mod n = 439848, which is a unit, inverse 311749.
<p><a href=53.html>53 is prime.</a>
<br>b^((n-1)/53)-1 mod n = 190015, which is a unit, inverse 427619.
<p>(53 * 661) divides n-1.
<p>(53 * 661)^2 > n.
<p>n is prime by Pocklington's theorem.