Re: Factoring problem, solved

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

Date: Wed, 19 Jan 2005 00:30:51 -0800

> The idea may seem pathetically simple, but that is because ...

Well, I was thinking less about the idea seeming pathetically simple but
rather moer about you seeming pathetically simple.

> I have just shown you in a few lines how to factor an arbitrary
> non-zero positive integer M in polynomial time.

Where did you prove anything about polynomial time?

> That code implements a VERSION of my own theory, as I
> don't factor both j and T, but only T, as j gets background factored by
> the mathematics.

What do you mean by "j gets background factored by the mathematics"?

> It is CRITICAL that the information be taken seriously as soon as
> possible so that some other method can be used for Internet security,
> and quickly implemented.

Yawn............

> Time is a factor.

Time is a factor? I thought it was a composite.

Relevant Pages

  • Re: Factoring problem, solved
    ... rather moer about you seeming pathetically simple. ... Where did you prove anything about polynomial time? ... What do you mean by "j gets background factored by the mathematics"? ... I thought it was a composite. ...
    (sci.crypt)
  • Re: Ultimate check, new way to factor or not?
    ... > polynomial time. ... Now, factoring is in general hard, with *certain* types of numbers, ... the mathematics or what's possible, but only in trying to dismiss my ... while certain key features of my discovery make it very exciting, ...
    (sci.crypt)
  • Re: tar to multiple files
    ... NP is the set of problems that can be solved by a deterministic algorithm ... that takes polynomial time, compared to the number of inputs. ... NPC is the set of problems in NP such that any other problem in NP ... One of the Big Questions in mathematics is: ...
    (comp.os.linux.misc)
Quantcast