Services & Resources / Wolfram Forums / MathGroup Archive

MathGroup Archive 2008

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

Search the Archive

Re: QuickFactorInteger

  • To: mathgroup at
  • Subject: [mg93857] Re: [mg93831] QuickFactorInteger
  • From: DrMajorBob <btreat1 at>
  • Date: Thu, 27 Nov 2008 05:30:51 -0500 (EST)
  • References: <gfgqib$dm1$> <gfh3ca$g1d$>
  • Reply-to: drmajorbob at

Yeah, <sarcasm on>, this is an easy problem; WRI chose a slow algorithm on  
purpose! <sarcasm off>

Seriously, all you must do to become astonishingly famous is JUST to solve  
this problem.

The difficulty of it is the basis of most crytographic encodings, today.

Here's a MUCH smaller problem, just to illustrate:

Times @@ Rest@NestList[NextPrime, 11^25, 2]


{13.2398, {{108347059433883722041830257,
    1}, {108347059433883722041830293, 1}}}

Two 27 digit primes.


On Wed, 26 Nov 2008 06:22:31 -0600, Artur <grafix at> wrote:

> 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

DrMajorBob at

  • Prev by Date: Mathematica 7: PieChart: opacity of a sector label?
  • Next by Date: Re: Implementation rest modulo 2 needed
  • Previous by thread: RE: Mathematica 7: PieChart: opacity of a sector label?
  • Next by thread: Re: Implementation rest modulo 2 needed