Abstract In this paper, we reduce a large integer $latex N$ to an integer $latex N^\prime$, which has a smaller number of decimal digits than $latex N$. Then we find the greatest common divisor (gcd) of $latex N$ and $latex N^\prime$ to return a nontrivial factor of $latex N$. Introduction The branch of mathematics that... Continue Reading →