Re: JSH: Your funeral


"Jon Slaughter" <Jon_Slaughter@xxxxxxxxxxx> wrote in message
news:pKmFi.53365$YL5.5930@xxxxxxxxxxxxxxxxxxxxxxxxxxxxx

"Joshua Cranmer" <Pidgeot18@xxxxxxxxx> wrote in message
news:fc4scv$gp5$1@xxxxxxxxxxx
JSH wrote:
I picked factoring because ultimately I don't need any of you to do
your jobs.

So my job is ultimately impacted by factoring? I doubt that.

All I have to do is factor an RSA challenge number and the theory I
now have says that with time I can do it.

"With time." The latest number factored, RSA-200, took about 75 years of
computer time using the best known factoring algorithms. As far as anyone
can tell, your algorithm runs about as slow as a random GCD algorithm (I
make the note as far as anyone can tell -- your explanations as to how to
factor S and produce n and k are very lacking).

Now laugh at that all you want. Show your continuing bravado against
mathematical proof.

Show us your *watertight* proof and we will stop laughing. But we haven't
seen it.

You people do not know mathematics which is why you are being beaten
in this way.

Ditto.

And the point now is that you are not mathematicians, you lie
stupidly, and there was no other way to get the truth out so you stand
against human progress and the only way to prove it was to put you
against a wall and crush you with the truth.

You have not yet provided sufficient evidence. I give you a challenge.
Solve RSA-704 by the end of September. If you can do it, I congratulate
you. If you cannot, then you will admit that your algorithm is not worth
anything and you denounce the rank of mathematician. Deal?

Dude!! The guys just lonely. He has no friends or family and this is the
only place he can get human interaction. Cut him some slack!

he snot lonely, hes got his johnson in his other hand + you have seen his
picture, that is all these guys do at night for HOURS and HOURS, its HUGE.




.

Relevant Pages

  • Re: JSH: Your funeral
    ... your jobs. ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD algorithm (I ...
    (sci.math)
  • Re: JSH: Your funeral
    ... your jobs. ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD ... discoverer then yeah, maybe you should worry. ...
    (sci.math)
  • beta version of Victor Shoups book, "A Computational Introduction to Number Theory and Algebra&
    ... Computing with Large Integers ... The Basic Euclidean Algorithm ... Factoring and Computing Euler's phi-Function are Equivalent ... The Existence of Finite Fields ...
    (sci.crypt)
  • Re: Ultimate check, new way to factor or not?
    ... It's commonly known as a the "factoring sieve" and Fermat showed that ... It is listed as "algorithm ... "factoring with sieves" on pp.389. ... > when it defies the mathematics. ...
    (sci.crypt)
  • Re: I was right, surrogate factoring proof
    ... primes divide n -- at most I'll have to look through sqrt/ ... But don't forget that's included in the cost of the algorithm! ... if surrogate factoring ever becomes ... two values are congruent modulo p, and hopefully not congruent modulo n/p. ...
    (sci.math)
Loading