Re: (new?) factorization technique
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: (new?) factorization technique

From: Risto Lankinen <rlankine@hotmail.com>
Date: Thu Jun 02 2005 - 12:18:16 CEST

Hi!

"vector" <root@localhost> wrote in message
news:tKGdnXTaJK-ebAbfRVn-oA@comcast.com...
>
> 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. There's well-documented Java code
> available for download that demonstrates the algorithm. I hope someone
will
> find it useful, or at least interesting.
>
> http://techniker.blogspot.com/2005/05/unusual-approach-to-integer.html
>
> If you choose to leave comments, please be constructive with your
feedback.

To me it seems that this...

http://groups.google.com/groups?selm=8484%40ccncsu.ColoState.EDU
http://groups.google.com/groups?selm=13559%40ccncsu.ColoState.EDU

... is essentially the same as your algorithm using binary (=base-2).

 - Risto -
Received on Thu Sep 29 21:39:37 2005