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

QuickFactorInteger

• To: mathgroup at smc.vnet.net
• Subject: [mg93831] QuickFactorInteger
• From: Artur <grafix at csl.pl>
• Date: Wed, 26 Nov 2008 07:22:31 -0500 (EST)
• References: <gfgqib$dm1$1@smc.vnet.net> <gfh3ca$g1d$1@smc.vnet.net> <200811140209.VAA16497@smc.vnet.net> <200811141136.GAA13071@smc.vnet.net>
• Reply-to: grafix at csl.pl

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

• Follow-Ups:
  • Re: QuickFactorInteger
    • From: Daniel Lichtblau <danl@wolfram.com>

• References:
  • Re: Model the surface of an ellipsoid
    • From: Mayneord <xrayspectrum@googlemail.com>
  • Minimize
    • From: Artur <grafix@csl.pl>