Re: Factoring problem, solved

From: ošin (ošin_at_ragnarok.com)
Date: 01/20/05 

Date: Wed, 19 Jan 2005 19:18:37 -0800

>I am increasingly certain that I've solved the factoring problem.

You mean you have an algorithm that factors in polynomial time? What makes
you think that you have done that?

Your goofy Java program does not work (you admit that). You give no reason
to think that it completes in polynomial time, or even sub-exponential time.
You just claim that you are "increasingly certain that you have solved the
factoring problem", and we are to believe you? After all the FLT nonsense
you spouted for years? Do you really think that anyone here is going to get
excited about your "work"? FOAD.

BTW, have you heard back from the Annals yet?

Relevant Pages

  • Re: Factoring problem, solved
    ... >I am increasingly certain that I've solved the factoring problem. ... You mean you have an algorithm that factors in polynomial time? ... to think that it completes in polynomial time, ... FOAD. ...
    (sci.math)
  • Re: Factoring problem, my assertion revisited
    ... > factoring problem, and kept talking about theoretically, while my ... do you mean you think you've found an algorithm ...
    (sci.math)
  • Re: Factoring problem, my assertion revisited
    ... > factoring problem, and kept talking about theoretically, while my ... do you mean you think you've found an algorithm ...
    (sci.crypt)
  • 6P=NP: Proof: Nondeterministic Algorithm
    ... each time the algorithm is run the resulting guess may differ. ... be done in Oor polynomial time. ... verifies x if there exists a certificate y such ... Algorithm A verifies language L if for any string x Î ...
    (sci.math)
  • Re: simple and beauty strategy
    ... The relation between the complexity classes P and NP is studied in ... positive solutions can be verified in polynomial time given the right ... the NP-complete problems are the "toughest" ... that every algorithm which decides the truth of Presburger statements ...
    (rec.gambling.lottery)