primed, part II

In other news, I coded up an implementation of that Shanks factorization algorithm. So far it can do 19 digits, but I don't know how to get it to stop returning trivial solutions (e.g. factoring 51 as 1 * 51) so it only works most of the time. I was able to factor some phone numbers for people, so that was amusing. I tried to make a copy that used Java's arbitrary precision data types to work on RSA-100, but that wasn't going well. I'm also having problems with Java running out of memory.