Quote:
Originally Posted by CRGreathouse
Would you use this method to factor, say, 647978103069410806903326919883810380070087355654969148727717? It is of the form pq for primes p and q, so you can choose a = p and n = q-1 to see that it is of the desired form a^2 + n*a.
This is a small number as far as factoring is concerned -- yafu's SIQS cracks it in 2.8 seconds -- but it should be enough to show us how your method works. Please don't use other factoring tools for this, we're interested in how well your method works not how well others work.  |
There's something wrong, yet.
If I find the problem I will start the implementation.