Re: Social forces, that strong?


<jstevh@xxxxxxx> wrote in message
news:1112921248.594852.249880@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
> It seems strange to me, how lock-step the posters are on the newsgroup,
> as without regard to reason, I tend to see a lot of posts that just
> ignore essential facts in order to criticize my work.

Mr. Harris,

here you are comparing your "so-called and flawed" methods to existing
methods.

How about you answer a several questions.

1. Has your SF broken any of the RSA challenge numbers: NO

2. Has your method beaten the numbers factored by the NFS or GNFS: NO

3. Has your method beaten Dario's Alperns implementation (google search for
his applet) Factorization using the Elliptic Curve Method: NO

4. Is you SF factoring better than MMA or GP Pari: NO

5. Can your prime counting function calculate Pi(x) for x = 10^22 and
larger: NO

I can make dozens of such claims. Hell, your SF isn't even mildly
interesting as randomly choosing factors is superior in performance. I
won't be losing any sleep regarding your so-called method because it's rate
of success decreases in a super-exponential fashion as the number grows!
Great work bozo!

So, you sit here criticizing people on the NG, but what have you actually
accomplished by the "DIRECT" evidence given above?

I dare to refute a single one of those statements.

The fact is you can't and you know it, so you continue to try and steer the
unknowing away from the truth!

You are so sad in your desperation to be acknowledged.

Grow up cause your hammer is the size of a grain of sand!

Go ahead, REFUTE "ANY" statement I made above you LIAR, CHEAT and CHARLATAN.

What's wrong trolling-crank? Put up!


.