Re: JSH: Mathematical proof of factoring problem solution

JSH <jstevh@xxxxxxxxx> writes:

[...]

There is no way trivial factorizations can be preferred as the trivial
factorization just gives you two cases for the factors: T mod p and 1,
or -T mod p and 1

So they can only account for TWO CASES though I think that multiple
a's may give you those cases, but they have to also evenly cover all
the others.

Ah, so you're relying on "the math doesn't care" again?

You know that when you submit this for publication the reviewers are
going to suggest you implement it, and, well, see if it actually
works? So why not do that now?

[...]

.

Relevant Pages

  • Re: JSH: Just plain silly
    ... I wrote the editors to inform them of an error. ... > commenting on the article CAME AFTER PUBLICATION.) ... I was not sent a copy of this review. ... with the exception of those who are fixated on trading insults with JSH, ...
    (sci.math)
  • Re: May be a short history of JSH? No offense.
    ... After years of claiming no mathematician in ... Gee, publication, AFTER people pointed out that the final conclusion ... have peer-review (despite claiming it), and too many bad papers were ... But this story has a happy ending for JSH; ...
    (sci.math)
  • Re: I was right, surrogate factoring proof
    ... JSH fooled you this time: the algorithm he posted actually requires ... The smallest composite I found for which his new algorithm fails is M=25 ... so it's gotten well beyond the 600s this time without any success. ... Fully agreed that worrying about the factorization of T has long been ...
    (sci.crypt)
  • Re: JSH: Just plain silly
    ... W. Dale Hall: ... Factorization' has appeared in SWJPAM Issue 2," (Note: ... commenting on the article CAME AFTER PUBLICATION.) ...
    (sci.math)
  • Re: Factoring problem, my assertion revisited
    ... making the factorization of T *too* easy. ... I can understand Rick Decker easily enough, but JSH keeps calling ... > online buddy, ... Rick "the liar" ...
    (sci.math)
Quantcast