Re: Solving the factoring problem

JSH wrote:

I've been challenged to come up with a practical factoring algorithm,
based on them as there is no doubt about correctness and show that it
is an advance on current factoring methods.

You have inspired me to write my own factoring algorithm.

k=3
define foo(n)
{
m = sqrt(n)
for (i = k; i <= m; i += 2)
if (n%i == 0) { i ; k = i ; return foo(n/i) }
return n
}
foo(9059153542180253)

(It runs in bc.)

How fast does your own algorithm factor 9059153542180253?

Regards.
.