Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2003

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

Search the Archive

Re: Integer factorization in Mathematica

  • To: mathgroup at
  • Subject: [mg39486] Re: Integer factorization in Mathematica
  • From: Daniel Lichtblau <danl at>
  • Date: Wed, 19 Feb 2003 04:42:00 -0500 (EST)
  • References: <>
  • Sender: owner-wri-mathgroup at

Check the on-line documentation of Mathematica version 4.2, located at

The Mathematica Book > Mathematica Reference > Some Notes on
Implementation > Numerical and Related Functions

Under subheading Number-theoretical functions we find

"\[FilledSmallCircle] FactorInteger switches between removing small
primes by trial division and using the Pollard p-1, Pollard rho and
quadratic sieve algorithm."

Specifically, MPQS is used.

I should note that "fastest" is quite dependent on the sizes of factors
as well as the size of the number itself.

Daniel Lichtblau
Wolfram Research

  • Prev by Date: Re: Animation to QuickTime Movie? (EMERGENCY)
  • Next by Date: MR vs ARIMA (Multiple Regression vs Auto Regressive Integrated
  • Previous by thread: Integer factorization in Mathematica
  • Next by thread: Re: Integer factorization in Mathematica