Re: Factoring problem, solved

From: Douglas A. Gwyn (DAGwyn_at_null.net)
Date: 01/20/05 

Date: Wed, 19 Jan 2005 22:58:46 -0500

jstevh@msn.com wrote:
> If you watch it factoring and spitting out primes (though it also
> mislabels some as prime and can't factor some easy numbers...rough
> version remember) then you can at least see that something is happening
> here worth investigating further.

"Rough" needn't mean "incorrect". If you don't need a
*correct* factorization then you can use a much simpler
algorithm. What guarantee is there that the incorrect
algorithm can be converted to a correct one? Until you
do that, I doubt that there will be much interest.

Relevant Pages

  • 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)
  • 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.crypt)
  • Re: how to factor gaussian integers ?
    ... There are very efficient algorithms for factoring ... in integral domains with only finitely many primes. ... Same idea if you have an integral domain with only finitely many ... Precisely what algorithm do you believe is efficient? ...
    (sci.math)
  • A Factoring Algorithm
    ... A Factoring Algorithm ... This is a different algorithm than that one. ... IF H is divisible by ANY of the primes ... constructing a NEW Base G, from the primes that follow P: ...
    (sci.math)
  • Re: how to factor gaussian integers ?
    ... There are very efficient algorithms for factoring in integral domains ... with only finitely many primes. ... Same idea if you have an integral domain with only finitely many ... efficiency to mean the assymptotic Big-Oh of the algorithm. ...
    (sci.math)
Loading