| knowledge-database (beta) |
Current group: sci.crypt
Re: Surrogate factoring approach, analysis
|
|
 | | From: | Lits O'Hate | | Subject: | Re: Surrogate factoring approach, analysis | | Date: | 21 Jan 2005 15:58:30 -0800 |
|
|
 | jstevh@msn.com wrote:
> I wrote a prototype test program to test out my new factoring method.
Yeah, I know. Too bad it's full of bugs and glacially slow.
> From my position, it's just great that it works AT ALL.
Every first-term programming student is assigned a program to find primes or factor numbers. If you turned this in you'd get an "F".
> How fast can your computer factor 15?
Why? Is that one of the numbers your program thinks "should be prime?"
> Are you really as stupid as you come across in your posts or are you > just playing a complete dumb-ass on Usenet?
I see you're upset. I suppose that's a natural reaction to complete failure, especially for a narcissist. Why don't you relax and have a drink?
|
|
|
| | |
|
 |