Math.NumberTheory.Factor

Documentation

data EllipticCurve

Constructors

EC Integer Integer Integer

Instances

Eq EllipticCurve

Show EllipticCurve

data EllipticCurvePt

Constructors

Inf

P Integer Integer

Instances

Eq EllipticCurvePt

Show EllipticCurvePt

pfactors :: Integer -> [Integer]

List the prime factors of n (with multiplicity). The algorithm uses trial division, followed by the elliptic curve method if necessary. The running time increases with the size of the second largest prime factor of n. It can find 10-digit prime factors in seconds, but can struggle with 20-digit prime factors.