Re: (new?) factorization technique

"Michael Brown" <see@signature.below> wrote in message
news:429c1773$1@clarion.carno.net.au...
> vector wrote:
>> Hello all,
>>
>> I've written an article discussing an approach I found to finding
>> prime factorizations. I don't know if the technique is original, but
>> I've never seen it described anywhere else before.
>
> It's come up a few times before. You can use the binary representation of
> it to transform the factoring problem into a large non-linear boolean
> equation problem (which unfortunately doesn't get you anywhere ...).
> Essentially the problem is that the number of possibilities that you need
> to test grows exponentially with the size of the input (IIRC, someone who
> knows the actual asymtotics please correct me :) ). This exponential work
> growth is why it's not talked about very often ("no point" so to speak).
>

Thank you for your helpful reply. I appreciate your comments.

I wonder about something no one has said yet, though. Does this procedure
have a name? You know, something along the lines of "Unvor-Gyvable Növis
Factorization Method" or similar? Apparently I should have found all this
and more with a simple Google search, but like I said, I never saw it
documented anywhere (which did surprise me). So, what is this called?
Received on Thu Sep 29 21:39:35 2005