Re: JSH: Way too interesting


jstevh@xxxxxxx wrote:
mike4ty4@xxxxxxxxx wrote:
jstevh@xxxxxxx wrote:
So I have this neat result using congruences which is so easy and
trivial that I can just put it out there and watch what happens!

And on this group, surprising even me, there is still the usual
reaction.

I can check with other groups and see what happens, shifting how I
present the mathematics.

Far more interesting than I thought possible.

It's like a study of the world with the most powerful intellectual
microscope ever built--a simple solution to the factoring problem
versus a social view that I'm just some crackpot.


James Harris

If you really do have a simple solution, then produce the prime
factorizations of all the numbers here:

http://www.rsasecurity.com/rsalabs/node.asp?id=2093

Why? Why should I bother?


To show that your algorithm really does work.

Think carefully. I have a theory at this point. It looks good to me,
like interesting mathematics. I like it.

What good would come of me implementing it--assuming it works well?


Because if you really have a working algorithm, you should demonstrate
it. It's called "burden of proof". If you claim to have X then you
should
demonstrate it otherwise the claim is not supported. If you can show
what the factors are, then you have proven your claim. So, list the
factors of the six numbers that are shown as "not factored". If your
theory really indeed works, then just do this. Demonstrating it would
show
everyone here that you indeed have found something revolutionary, and
you would have made a great contribution to mathematics, no longer be
considered an "idiot", etc.

Why should I bother?


See above.

Can you factor these numbers? If you just sat down and spent a little
bit of time implementing the algorithm, _could you do it_?


James Harris

.

Relevant Pages

  • 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: [OT] The PGP Signed Posts Farce
    ... ]>> They have to obey mathematics, and yes, there is every way to know. ... ]have to have an algorithm for solving p-complete problems in polynomial ... factoring numbers less than say 10^99. ... Being able to solve one finite problem ...
    (comp.os.linux.misc)
  • Re: Surrogate factoring, a fascinating idea
    ... That's because so far your "algorithm" isn't complete. ... > factoring is NOT a hard problem as previously thought. ... time trying to impress us with you gee-wow whiz-bang mathematics why ...
    (sci.crypt)
  • Re: JSH: Way too interesting
    ... And on this group, surprising even me, there is still the usual ... microscope ever built--a simple solution to the factoring problem ... like interesting mathematics. ... absurd nonsense and then after 6 months of circular arguments admits he was ...
    (sci.math)
  • Re: A very fast Fermat factoring algorithm
    ... > For my undergraduate thesis in mathematics I developed a factoring ... > algorithm which is identical to Fermat's factoring algorithm but about ... > 10^9 times faster. ...
    (sci.crypt)