Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2008

[Date Index] [Thread Index] [Author Index]

Search the Archive

QuickFactorInteger


Dear Mathematica Gurus,

Who know how construct procedure to obtained reasonable primes divisors 
of big number in reasonable time. If number have two big primes divisors 
range 40 decimal digits Mathematica function FactorInteger working hours 
and do nothing. I want do time limit (e.g. 5 second) and received list 
of factors which was obtained after these 5 seconds or do other  trick 
to obtained partialy result of FactorInteger.

Best wishes
Artur


  • Prev by Date: Re: Primed Symbols in Mathematica
  • Next by Date: Package Problem
  • Previous by thread: Re: Minimize
  • Next by thread: Re: QuickFactorInteger